/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:40:21,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:40:21,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:40:21,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:40:21,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:40:21,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:40:21,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:40:21,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:40:21,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:40:21,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:40:21,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:40:21,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:40:21,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:40:21,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:40:21,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:40:21,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:40:21,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:40:22,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:40:22,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:40:22,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:40:22,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:40:22,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:40:22,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:40:22,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:40:22,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:40:22,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:40:22,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:40:22,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:40:22,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:40:22,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:40:22,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:40:22,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:40:22,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:40:22,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:40:22,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:40:22,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:40:22,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:40:22,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:40:22,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:40:22,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:40:22,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:40:22,066 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:40:22,119 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:40:22,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:40:22,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:40:22,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:40:22,125 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:40:22,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:40:22,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:40:22,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:40:22,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:40:22,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:40:22,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:40:22,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:40:22,130 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:40:22,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:40:22,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:40:22,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:40:22,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:40:22,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:40:22,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:40:22,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:40:22,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:40:22,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:40:22,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:40:22,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:40:22,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:40:22,138 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:40:22,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:40:22,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:40:22,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:40:22,631 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:40:22,632 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:40:22,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-01-06 11:40:22,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e9aced254/7faf3b799de9449e9d43b32f0712640f/FLAG2d87a229d [2021-01-06 11:40:23,587 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:40:23,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-01-06 11:40:23,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e9aced254/7faf3b799de9449e9d43b32f0712640f/FLAG2d87a229d [2021-01-06 11:40:23,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e9aced254/7faf3b799de9449e9d43b32f0712640f [2021-01-06 11:40:23,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:40:23,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:40:23,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:40:23,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:40:23,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:40:23,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:23" (1/1) ... [2021-01-06 11:40:23,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec7f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:23, skipping insertion in model container [2021-01-06 11:40:23,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:40:23" (1/1) ... [2021-01-06 11:40:23,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:40:23,905 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:40:24,496 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[71313,71326] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:40:24,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:40:24,543 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:40:24,718 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[71313,71326] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:40:24,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:40:24,810 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:40:24,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24 WrapperNode [2021-01-06 11:40:24,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:40:24,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:40:24,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:40:24,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:40:24,840 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:40:24" (1/1) ... [2021-01-06 11:40:24,928 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:40:24" (1/1) ... [2021-01-06 11:40:25,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:40:25,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:40:25,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:40:25,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:40:25,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (1/1) ... [2021-01-06 11:40:25,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:40:25,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:40:25,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:40:25,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:40:25,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (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:40:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:40:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:40:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:40:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:40:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:40:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:40:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:40:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:40:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:40:25,650 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:40:26,841 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:40:26,842 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:40:26,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:40:26,854 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:40:26,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:26 BoogieIcfgContainer [2021-01-06 11:40:26,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:40:26,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:40:26,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:40:26,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:40:26,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:40:23" (1/3) ... [2021-01-06 11:40:26,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587c585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:40:26, skipping insertion in model container [2021-01-06 11:40:26,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:40:24" (2/3) ... [2021-01-06 11:40:26,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587c585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:40:26, skipping insertion in model container [2021-01-06 11:40:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:26" (3/3) ... [2021-01-06 11:40:26,868 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2021-01-06 11:40:26,876 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:40:26,882 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:40:26,902 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:40:26,935 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:40:26,936 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:40:26,936 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:40:26,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:40:26,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:40:26,936 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:40:26,936 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:40:26,937 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:40:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2021-01-06 11:40:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:40:26,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:26,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:26,977 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2021-01-06 11:40:26,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:26,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322455880] [2021-01-06 11:40:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:27,575 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:40:27,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322455880] [2021-01-06 11:40:27,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:27,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:27,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534101903] [2021-01-06 11:40:27,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:27,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:27,618 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2021-01-06 11:40:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:28,491 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2021-01-06 11:40:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:28,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2021-01-06 11:40:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:28,511 INFO L225 Difference]: With dead ends: 313 [2021-01-06 11:40:28,511 INFO L226 Difference]: Without dead ends: 158 [2021-01-06 11:40:28,516 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:40:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-01-06 11:40:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-01-06 11:40:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2021-01-06 11:40:28,574 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2021-01-06 11:40:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:28,575 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2021-01-06 11:40:28,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2021-01-06 11:40:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 11:40:28,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:28,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:28,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:40:28,580 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2021-01-06 11:40:28,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:28,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400509207] [2021-01-06 11:40:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:28,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400509207] [2021-01-06 11:40:28,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:28,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:28,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611401976] [2021-01-06 11:40:28,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:28,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:28,812 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2021-01-06 11:40:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:29,450 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2021-01-06 11:40:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:29,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 11:40:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:29,456 INFO L225 Difference]: With dead ends: 280 [2021-01-06 11:40:29,457 INFO L226 Difference]: Without dead ends: 158 [2021-01-06 11:40:29,458 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:40:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-01-06 11:40:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-01-06 11:40:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2021-01-06 11:40:29,492 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2021-01-06 11:40:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:29,493 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2021-01-06 11:40:29,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2021-01-06 11:40:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:40:29,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:29,503 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:29,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:40:29,504 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:29,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2021-01-06 11:40:29,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:29,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635904036] [2021-01-06 11:40:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:29,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635904036] [2021-01-06 11:40:29,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:29,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:29,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670542560] [2021-01-06 11:40:29,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:29,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:29,693 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2021-01-06 11:40:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:30,344 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2021-01-06 11:40:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:30,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:40:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:30,349 INFO L225 Difference]: With dead ends: 279 [2021-01-06 11:40:30,350 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 11:40:30,351 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:40:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 11:40:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2021-01-06 11:40:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2021-01-06 11:40:30,365 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2021-01-06 11:40:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:30,365 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2021-01-06 11:40:30,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2021-01-06 11:40:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:40:30,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:30,368 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:30,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:40:30,369 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2021-01-06 11:40:30,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:30,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187825640] [2021-01-06 11:40:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:30,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187825640] [2021-01-06 11:40:30,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:30,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:30,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290772080] [2021-01-06 11:40:30,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:30,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:30,494 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2021-01-06 11:40:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:31,102 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2021-01-06 11:40:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:31,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:40:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:31,105 INFO L225 Difference]: With dead ends: 277 [2021-01-06 11:40:31,105 INFO L226 Difference]: Without dead ends: 155 [2021-01-06 11:40:31,107 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:40:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-06 11:40:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2021-01-06 11:40:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2021-01-06 11:40:31,120 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2021-01-06 11:40:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:31,120 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2021-01-06 11:40:31,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2021-01-06 11:40:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:40:31,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:31,122 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:31,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:40:31,123 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2021-01-06 11:40:31,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:31,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969883864] [2021-01-06 11:40:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:31,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969883864] [2021-01-06 11:40:31,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:31,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:31,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139232195] [2021-01-06 11:40:31,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:31,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:31,220 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2021-01-06 11:40:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:31,730 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2021-01-06 11:40:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:31,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:40:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:31,733 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:40:31,733 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 11:40:31,734 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:40:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 11:40:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-01-06 11:40:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2021-01-06 11:40:31,744 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2021-01-06 11:40:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:31,745 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2021-01-06 11:40:31,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2021-01-06 11:40:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:40:31,747 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:31,747 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:31,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:40:31,748 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2021-01-06 11:40:31,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:31,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98271083] [2021-01-06 11:40:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:31,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98271083] [2021-01-06 11:40:31,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:31,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:31,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591068690] [2021-01-06 11:40:31,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:31,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:31,830 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2021-01-06 11:40:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:32,387 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2021-01-06 11:40:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:32,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:40:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:32,390 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:40:32,390 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 11:40:32,391 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:40:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 11:40:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-01-06 11:40:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2021-01-06 11:40:32,399 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2021-01-06 11:40:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:32,399 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2021-01-06 11:40:32,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2021-01-06 11:40:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 11:40:32,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:32,401 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:32,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:40:32,401 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2021-01-06 11:40:32,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:32,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000170571] [2021-01-06 11:40:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:32,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000170571] [2021-01-06 11:40:32,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:32,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:32,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030772691] [2021-01-06 11:40:32,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:32,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:32,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:32,474 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2021-01-06 11:40:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:32,946 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2021-01-06 11:40:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:32,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 11:40:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:32,948 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:40:32,948 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 11:40:32,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 11:40:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-01-06 11:40:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2021-01-06 11:40:32,956 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2021-01-06 11:40:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:32,956 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2021-01-06 11:40:32,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2021-01-06 11:40:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 11:40:32,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:32,958 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:32,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:40:32,958 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:32,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:32,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2021-01-06 11:40:32,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:32,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980707080] [2021-01-06 11:40:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:33,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980707080] [2021-01-06 11:40:33,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:33,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:33,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283806443] [2021-01-06 11:40:33,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:33,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:33,035 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2021-01-06 11:40:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:33,565 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2021-01-06 11:40:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:33,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 11:40:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:33,567 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:40:33,567 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 11:40:33,568 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:40:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 11:40:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-01-06 11:40:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2021-01-06 11:40:33,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2021-01-06 11:40:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:33,575 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2021-01-06 11:40:33,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2021-01-06 11:40:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 11:40:33,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:33,577 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:33,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:40:33,577 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2021-01-06 11:40:33,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:33,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32709329] [2021-01-06 11:40:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:33,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32709329] [2021-01-06 11:40:33,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:33,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:33,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797115516] [2021-01-06 11:40:33,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:33,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:33,714 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2021-01-06 11:40:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:34,229 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2021-01-06 11:40:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:34,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 11:40:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:34,232 INFO L225 Difference]: With dead ends: 266 [2021-01-06 11:40:34,232 INFO L226 Difference]: Without dead ends: 144 [2021-01-06 11:40:34,233 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:40:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-06 11:40:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2021-01-06 11:40:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-06 11:40:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2021-01-06 11:40:34,239 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2021-01-06 11:40:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:34,240 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2021-01-06 11:40:34,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2021-01-06 11:40:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 11:40:34,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:34,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:34,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:40:34,242 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2021-01-06 11:40:34,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:34,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183165223] [2021-01-06 11:40:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:34,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183165223] [2021-01-06 11:40:34,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:34,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:34,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545131006] [2021-01-06 11:40:34,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:34,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:34,320 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2021-01-06 11:40:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:34,961 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2021-01-06 11:40:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:34,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 11:40:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:34,964 INFO L225 Difference]: With dead ends: 306 [2021-01-06 11:40:34,964 INFO L226 Difference]: Without dead ends: 184 [2021-01-06 11:40:34,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-01-06 11:40:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2021-01-06 11:40:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2021-01-06 11:40:34,972 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2021-01-06 11:40:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:34,972 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2021-01-06 11:40:34,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2021-01-06 11:40:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:40:34,974 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:34,974 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:34,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:40:34,975 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2021-01-06 11:40:34,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:34,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856098912] [2021-01-06 11:40:34,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:35,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856098912] [2021-01-06 11:40:35,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:35,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:35,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382686943] [2021-01-06 11:40:35,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:35,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:35,055 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2021-01-06 11:40:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:35,680 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2021-01-06 11:40:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:35,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:40:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:35,683 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:40:35,683 INFO L226 Difference]: Without dead ends: 184 [2021-01-06 11:40:35,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-01-06 11:40:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2021-01-06 11:40:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2021-01-06 11:40:35,691 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2021-01-06 11:40:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:35,691 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2021-01-06 11:40:35,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2021-01-06 11:40:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:40:35,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:35,693 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:35,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:40:35,693 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:35,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:35,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2021-01-06 11:40:35,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:35,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285894938] [2021-01-06 11:40:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:35,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285894938] [2021-01-06 11:40:35,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:35,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:35,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66526554] [2021-01-06 11:40:35,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:35,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:35,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:35,785 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2021-01-06 11:40:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:36,271 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2021-01-06 11:40:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:36,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:40:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:36,273 INFO L225 Difference]: With dead ends: 327 [2021-01-06 11:40:36,273 INFO L226 Difference]: Without dead ends: 183 [2021-01-06 11:40:36,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-01-06 11:40:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2021-01-06 11:40:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2021-01-06 11:40:36,280 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2021-01-06 11:40:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:36,281 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2021-01-06 11:40:36,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2021-01-06 11:40:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:40:36,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:36,282 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:36,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:40:36,282 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2021-01-06 11:40:36,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:36,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647173391] [2021-01-06 11:40:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:36,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647173391] [2021-01-06 11:40:36,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:36,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:36,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312619350] [2021-01-06 11:40:36,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:36,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:36,358 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2021-01-06 11:40:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:36,991 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2021-01-06 11:40:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:36,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:40:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:36,994 INFO L225 Difference]: With dead ends: 325 [2021-01-06 11:40:36,994 INFO L226 Difference]: Without dead ends: 181 [2021-01-06 11:40:36,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-01-06 11:40:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-01-06 11:40:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2021-01-06 11:40:37,004 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2021-01-06 11:40:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:37,004 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2021-01-06 11:40:37,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2021-01-06 11:40:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:40:37,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:37,006 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:37,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:40:37,006 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2021-01-06 11:40:37,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:37,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389525266] [2021-01-06 11:40:37,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:37,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389525266] [2021-01-06 11:40:37,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:37,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:37,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046305341] [2021-01-06 11:40:37,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:37,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:37,124 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2021-01-06 11:40:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:37,640 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2021-01-06 11:40:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:37,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:40:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:37,642 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:40:37,642 INFO L226 Difference]: Without dead ends: 180 [2021-01-06 11:40:37,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-06 11:40:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-01-06 11:40:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2021-01-06 11:40:37,649 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2021-01-06 11:40:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:37,650 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2021-01-06 11:40:37,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2021-01-06 11:40:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:40:37,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:37,651 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:37,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:40:37,652 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2021-01-06 11:40:37,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:37,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40304429] [2021-01-06 11:40:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:37,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40304429] [2021-01-06 11:40:37,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:37,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:37,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537317754] [2021-01-06 11:40:37,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:37,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:37,713 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2021-01-06 11:40:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:38,219 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2021-01-06 11:40:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:38,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:40:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:38,222 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:40:38,222 INFO L226 Difference]: Without dead ends: 180 [2021-01-06 11:40:38,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-06 11:40:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-01-06 11:40:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2021-01-06 11:40:38,229 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2021-01-06 11:40:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:38,229 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2021-01-06 11:40:38,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2021-01-06 11:40:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 11:40:38,231 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:38,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:38,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:40:38,231 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2021-01-06 11:40:38,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:38,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873962025] [2021-01-06 11:40:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:38,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873962025] [2021-01-06 11:40:38,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:38,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:38,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284490433] [2021-01-06 11:40:38,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:38,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:38,297 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2021-01-06 11:40:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:38,812 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2021-01-06 11:40:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:38,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 11:40:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:38,814 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:40:38,814 INFO L226 Difference]: Without dead ends: 180 [2021-01-06 11:40:38,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-06 11:40:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-01-06 11:40:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2021-01-06 11:40:38,822 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2021-01-06 11:40:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:38,822 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2021-01-06 11:40:38,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2021-01-06 11:40:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 11:40:38,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:38,824 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:38,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:40:38,824 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2021-01-06 11:40:38,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:38,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524429205] [2021-01-06 11:40:38,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:38,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524429205] [2021-01-06 11:40:38,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:38,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:38,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624768585] [2021-01-06 11:40:38,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:38,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:38,913 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2021-01-06 11:40:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:39,417 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2021-01-06 11:40:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:39,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 11:40:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:39,420 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:40:39,420 INFO L226 Difference]: Without dead ends: 180 [2021-01-06 11:40:39,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-06 11:40:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2021-01-06 11:40:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-01-06 11:40:39,430 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2021-01-06 11:40:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:39,430 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-01-06 11:40:39,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-01-06 11:40:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 11:40:39,432 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:39,433 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:39,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:40:39,433 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2021-01-06 11:40:39,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:39,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138188450] [2021-01-06 11:40:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:40:39,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138188450] [2021-01-06 11:40:39,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:39,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:39,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304471958] [2021-01-06 11:40:39,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:39,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:39,519 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2021-01-06 11:40:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:40,000 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2021-01-06 11:40:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:40,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 11:40:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:40,003 INFO L225 Difference]: With dead ends: 314 [2021-01-06 11:40:40,003 INFO L226 Difference]: Without dead ends: 170 [2021-01-06 11:40:40,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-01-06 11:40:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2021-01-06 11:40:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:40:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2021-01-06 11:40:40,010 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2021-01-06 11:40:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:40,010 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2021-01-06 11:40:40,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2021-01-06 11:40:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:40:40,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:40,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:40,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:40:40,012 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2021-01-06 11:40:40,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:40,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702278680] [2021-01-06 11:40:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:40,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702278680] [2021-01-06 11:40:40,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:40,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:40,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100435648] [2021-01-06 11:40:40,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:40,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:40,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:40,116 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2021-01-06 11:40:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:40,880 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2021-01-06 11:40:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:40,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 11:40:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:40,884 INFO L225 Difference]: With dead ends: 403 [2021-01-06 11:40:40,884 INFO L226 Difference]: Without dead ends: 259 [2021-01-06 11:40:40,885 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:40:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-06 11:40:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2021-01-06 11:40:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 11:40:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2021-01-06 11:40:40,893 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2021-01-06 11:40:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:40,893 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2021-01-06 11:40:40,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2021-01-06 11:40:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:40:40,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:40,895 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:40,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:40:40,895 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2021-01-06 11:40:40,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:40,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610512118] [2021-01-06 11:40:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:40,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610512118] [2021-01-06 11:40:40,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:40,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:40,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593346015] [2021-01-06 11:40:40,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:40,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:40,978 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2021-01-06 11:40:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:41,610 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2021-01-06 11:40:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:41,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 11:40:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:41,613 INFO L225 Difference]: With dead ends: 442 [2021-01-06 11:40:41,614 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:40:41,614 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:40:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:40:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2021-01-06 11:40:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2021-01-06 11:40:41,622 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2021-01-06 11:40:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:41,622 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2021-01-06 11:40:41,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2021-01-06 11:40:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:40:41,624 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:41,624 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:41,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:40:41,624 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2021-01-06 11:40:41,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:41,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596445438] [2021-01-06 11:40:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:41,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596445438] [2021-01-06 11:40:41,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:41,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:41,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398973499] [2021-01-06 11:40:41,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:41,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:41,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:41,705 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2021-01-06 11:40:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:42,451 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2021-01-06 11:40:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:42,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:40:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:42,454 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:40:42,454 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:40:42,455 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:40:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:40:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2021-01-06 11:40:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2021-01-06 11:40:42,463 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2021-01-06 11:40:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:42,463 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2021-01-06 11:40:42,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2021-01-06 11:40:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:40:42,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:42,465 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:42,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:40:42,465 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2021-01-06 11:40:42,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:42,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041857486] [2021-01-06 11:40:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:42,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041857486] [2021-01-06 11:40:42,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:42,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:42,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689555773] [2021-01-06 11:40:42,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:42,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:42,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:42,551 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2021-01-06 11:40:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:43,123 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2021-01-06 11:40:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:43,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:40:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:43,126 INFO L225 Difference]: With dead ends: 466 [2021-01-06 11:40:43,126 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:40:43,127 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:40:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:40:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2021-01-06 11:40:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2021-01-06 11:40:43,136 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2021-01-06 11:40:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:43,137 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2021-01-06 11:40:43,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-01-06 11:40:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:43,138 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:43,139 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:43,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:40:43,139 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2021-01-06 11:40:43,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:43,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107540244] [2021-01-06 11:40:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:43,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107540244] [2021-01-06 11:40:43,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:43,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:43,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143729504] [2021-01-06 11:40:43,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:43,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:43,240 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2021-01-06 11:40:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:43,966 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2021-01-06 11:40:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:43,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:40:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:43,970 INFO L225 Difference]: With dead ends: 493 [2021-01-06 11:40:43,970 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:40:43,970 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:40:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:40:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2021-01-06 11:40:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2021-01-06 11:40:43,978 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2021-01-06 11:40:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:43,978 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2021-01-06 11:40:43,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2021-01-06 11:40:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:43,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:43,980 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:43,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:40:43,980 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2021-01-06 11:40:43,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:43,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082378218] [2021-01-06 11:40:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:44,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082378218] [2021-01-06 11:40:44,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:44,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:44,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665939775] [2021-01-06 11:40:44,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:44,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:44,063 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2021-01-06 11:40:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:44,775 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2021-01-06 11:40:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:44,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:40:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:44,778 INFO L225 Difference]: With dead ends: 491 [2021-01-06 11:40:44,778 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 11:40:44,779 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:40:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 11:40:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2021-01-06 11:40:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2021-01-06 11:40:44,788 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2021-01-06 11:40:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:44,788 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2021-01-06 11:40:44,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2021-01-06 11:40:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:44,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:44,790 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:44,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:40:44,790 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2021-01-06 11:40:44,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:44,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196676529] [2021-01-06 11:40:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:44,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196676529] [2021-01-06 11:40:44,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:44,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:44,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795422877] [2021-01-06 11:40:44,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:44,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:44,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:44,874 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2021-01-06 11:40:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:45,611 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2021-01-06 11:40:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:45,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:40:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:45,614 INFO L225 Difference]: With dead ends: 490 [2021-01-06 11:40:45,614 INFO L226 Difference]: Without dead ends: 279 [2021-01-06 11:40:45,615 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:40:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-01-06 11:40:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2021-01-06 11:40:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 11:40:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2021-01-06 11:40:45,624 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2021-01-06 11:40:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:45,624 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2021-01-06 11:40:45,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2021-01-06 11:40:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:45,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:45,626 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:45,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:40:45,626 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2021-01-06 11:40:45,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:45,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825177620] [2021-01-06 11:40:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:40:45,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825177620] [2021-01-06 11:40:45,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:45,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:40:45,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463366029] [2021-01-06 11:40:45,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:40:45,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:40:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:40:45,733 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2021-01-06 11:40:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:46,429 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2021-01-06 11:40:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:40:46,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2021-01-06 11:40:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:46,433 INFO L225 Difference]: With dead ends: 462 [2021-01-06 11:40:46,433 INFO L226 Difference]: Without dead ends: 251 [2021-01-06 11:40:46,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:40:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-01-06 11:40:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2021-01-06 11:40:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2021-01-06 11:40:46,443 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2021-01-06 11:40:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:46,443 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2021-01-06 11:40:46,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:40:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2021-01-06 11:40:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:46,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:46,445 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:46,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:40:46,445 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2021-01-06 11:40:46,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:46,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424993499] [2021-01-06 11:40:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:46,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424993499] [2021-01-06 11:40:46,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:46,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:46,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91264604] [2021-01-06 11:40:46,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:46,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:46,523 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2021-01-06 11:40:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:47,091 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2021-01-06 11:40:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:47,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:40:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:47,094 INFO L225 Difference]: With dead ends: 503 [2021-01-06 11:40:47,094 INFO L226 Difference]: Without dead ends: 272 [2021-01-06 11:40:47,095 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:40:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-01-06 11:40:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-01-06 11:40:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2021-01-06 11:40:47,105 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2021-01-06 11:40:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:47,105 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2021-01-06 11:40:47,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2021-01-06 11:40:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:40:47,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:47,107 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:47,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:40:47,107 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2021-01-06 11:40:47,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:47,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984002532] [2021-01-06 11:40:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:47,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984002532] [2021-01-06 11:40:47,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:47,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:47,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182844333] [2021-01-06 11:40:47,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:47,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:47,211 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2021-01-06 11:40:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:47,766 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2021-01-06 11:40:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:47,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:40:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:47,769 INFO L225 Difference]: With dead ends: 502 [2021-01-06 11:40:47,769 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:40:47,770 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:40:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:40:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-01-06 11:40:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2021-01-06 11:40:47,779 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2021-01-06 11:40:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:47,779 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2021-01-06 11:40:47,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2021-01-06 11:40:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:40:47,781 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:47,781 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:47,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:40:47,781 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2021-01-06 11:40:47,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:47,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74606523] [2021-01-06 11:40:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:47,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74606523] [2021-01-06 11:40:47,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:47,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:47,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652676136] [2021-01-06 11:40:47,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:47,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:47,855 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2021-01-06 11:40:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:48,589 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2021-01-06 11:40:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:48,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:40:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:48,592 INFO L225 Difference]: With dead ends: 530 [2021-01-06 11:40:48,592 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:40:48,594 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:40:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:40:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-01-06 11:40:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2021-01-06 11:40:48,605 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2021-01-06 11:40:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:48,605 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2021-01-06 11:40:48,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2021-01-06 11:40:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:40:48,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:48,607 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:48,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:40:48,607 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2021-01-06 11:40:48,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:48,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476000366] [2021-01-06 11:40:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:48,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476000366] [2021-01-06 11:40:48,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:48,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:48,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479701515] [2021-01-06 11:40:48,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:48,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:48,677 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2021-01-06 11:40:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:49,283 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2021-01-06 11:40:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:49,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:40:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:49,286 INFO L225 Difference]: With dead ends: 502 [2021-01-06 11:40:49,287 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:40:49,288 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:40:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:40:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-01-06 11:40:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2021-01-06 11:40:49,297 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2021-01-06 11:40:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:49,298 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2021-01-06 11:40:49,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2021-01-06 11:40:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:40:49,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:49,299 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:49,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:40:49,299 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2021-01-06 11:40:49,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:49,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012317266] [2021-01-06 11:40:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:49,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012317266] [2021-01-06 11:40:49,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:49,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:49,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806573684] [2021-01-06 11:40:49,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:49,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:49,386 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2021-01-06 11:40:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:50,117 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2021-01-06 11:40:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:50,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:40:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:50,120 INFO L225 Difference]: With dead ends: 530 [2021-01-06 11:40:50,120 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:40:50,121 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:40:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:40:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-01-06 11:40:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2021-01-06 11:40:50,130 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2021-01-06 11:40:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:50,130 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2021-01-06 11:40:50,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2021-01-06 11:40:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:40:50,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:50,132 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:50,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:40:50,132 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2021-01-06 11:40:50,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:50,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974344369] [2021-01-06 11:40:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:50,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974344369] [2021-01-06 11:40:50,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:50,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:50,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207929801] [2021-01-06 11:40:50,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:50,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:50,210 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2021-01-06 11:40:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:50,750 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2021-01-06 11:40:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:50,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:40:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:50,753 INFO L225 Difference]: With dead ends: 502 [2021-01-06 11:40:50,753 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:40:50,754 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:40:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:40:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-01-06 11:40:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2021-01-06 11:40:50,763 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2021-01-06 11:40:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:50,764 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2021-01-06 11:40:50,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2021-01-06 11:40:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:40:50,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:50,765 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:50,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:40:50,766 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:50,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2021-01-06 11:40:50,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:50,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792250112] [2021-01-06 11:40:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:50,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792250112] [2021-01-06 11:40:50,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:50,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:50,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964629136] [2021-01-06 11:40:50,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:50,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:50,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:50,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:50,883 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2021-01-06 11:40:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:51,617 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2021-01-06 11:40:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:51,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2021-01-06 11:40:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:51,620 INFO L225 Difference]: With dead ends: 530 [2021-01-06 11:40:51,620 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:40:51,621 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:40:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:40:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-01-06 11:40:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2021-01-06 11:40:51,631 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2021-01-06 11:40:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:51,631 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2021-01-06 11:40:51,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2021-01-06 11:40:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:40:51,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:51,633 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:51,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:40:51,633 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2021-01-06 11:40:51,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:51,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900276394] [2021-01-06 11:40:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:51,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900276394] [2021-01-06 11:40:51,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:51,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:51,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139475087] [2021-01-06 11:40:51,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:51,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:51,705 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2021-01-06 11:40:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:52,239 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2021-01-06 11:40:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:52,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2021-01-06 11:40:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:52,241 INFO L225 Difference]: With dead ends: 502 [2021-01-06 11:40:52,242 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:40:52,242 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:40:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:40:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2021-01-06 11:40:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2021-01-06 11:40:52,251 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2021-01-06 11:40:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:52,251 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2021-01-06 11:40:52,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2021-01-06 11:40:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 11:40:52,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:52,253 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:52,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:40:52,253 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2021-01-06 11:40:52,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:52,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947125453] [2021-01-06 11:40:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:52,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947125453] [2021-01-06 11:40:52,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:52,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:52,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463983904] [2021-01-06 11:40:52,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:52,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:52,328 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2021-01-06 11:40:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:53,025 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2021-01-06 11:40:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:53,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 11:40:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:53,029 INFO L225 Difference]: With dead ends: 520 [2021-01-06 11:40:53,029 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:40:53,030 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:40:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:40:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2021-01-06 11:40:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2021-01-06 11:40:53,040 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2021-01-06 11:40:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:53,040 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2021-01-06 11:40:53,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2021-01-06 11:40:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 11:40:53,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:53,042 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:53,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:40:53,042 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2021-01-06 11:40:53,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:53,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376709033] [2021-01-06 11:40:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:53,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376709033] [2021-01-06 11:40:53,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:53,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:53,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377342492] [2021-01-06 11:40:53,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:53,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:53,138 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2021-01-06 11:40:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:53,639 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2021-01-06 11:40:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:53,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 11:40:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:53,642 INFO L225 Difference]: With dead ends: 492 [2021-01-06 11:40:53,642 INFO L226 Difference]: Without dead ends: 261 [2021-01-06 11:40:53,642 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:40:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-01-06 11:40:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2021-01-06 11:40:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2021-01-06 11:40:53,651 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2021-01-06 11:40:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:53,651 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2021-01-06 11:40:53,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2021-01-06 11:40:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:40:53,652 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:53,652 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:53,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:40:53,653 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2021-01-06 11:40:53,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:53,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441118863] [2021-01-06 11:40:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:40:53,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441118863] [2021-01-06 11:40:53,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:53,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:40:53,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55729198] [2021-01-06 11:40:53,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:40:53,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:53,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:40:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:40:53,727 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2021-01-06 11:40:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:54,400 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2021-01-06 11:40:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:40:54,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-06 11:40:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:54,404 INFO L225 Difference]: With dead ends: 520 [2021-01-06 11:40:54,404 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:40:54,405 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:40:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:40:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2021-01-06 11:40:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 11:40:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2021-01-06 11:40:54,414 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2021-01-06 11:40:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:54,415 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2021-01-06 11:40:54,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:40:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2021-01-06 11:40:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:40:54,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:54,416 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:54,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:40:54,416 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2021-01-06 11:40:54,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:54,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958445266] [2021-01-06 11:40:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:40:54,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958445266] [2021-01-06 11:40:54,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:54,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:40:54,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003082343] [2021-01-06 11:40:54,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:40:54,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:40:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:40:54,487 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2021-01-06 11:40:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:54,571 INFO L93 Difference]: Finished difference Result 708 states and 1057 transitions. [2021-01-06 11:40:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:40:54,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:40:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:54,575 INFO L225 Difference]: With dead ends: 708 [2021-01-06 11:40:54,575 INFO L226 Difference]: Without dead ends: 477 [2021-01-06 11:40:54,576 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:40:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-01-06 11:40:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2021-01-06 11:40:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2021-01-06 11:40:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 706 transitions. [2021-01-06 11:40:54,594 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 706 transitions. Word has length 106 [2021-01-06 11:40:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:54,594 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 706 transitions. [2021-01-06 11:40:54,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:40:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 706 transitions. [2021-01-06 11:40:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:40:54,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:54,597 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:54,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:40:54,597 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -629836579, now seen corresponding path program 1 times [2021-01-06 11:40:54,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:54,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732418894] [2021-01-06 11:40:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:40:54,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732418894] [2021-01-06 11:40:54,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:54,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:40:54,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812704106] [2021-01-06 11:40:54,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:40:54,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:40:54,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:40:54,672 INFO L87 Difference]: Start difference. First operand 477 states and 706 transitions. Second operand 3 states. [2021-01-06 11:40:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:54,731 INFO L93 Difference]: Finished difference Result 962 states and 1427 transitions. [2021-01-06 11:40:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:40:54,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:40:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:54,735 INFO L225 Difference]: With dead ends: 962 [2021-01-06 11:40:54,735 INFO L226 Difference]: Without dead ends: 504 [2021-01-06 11:40:54,736 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:40:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-01-06 11:40:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2021-01-06 11:40:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2021-01-06 11:40:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 741 transitions. [2021-01-06 11:40:54,752 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 741 transitions. Word has length 106 [2021-01-06 11:40:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:54,752 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 741 transitions. [2021-01-06 11:40:54,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:40:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 741 transitions. [2021-01-06 11:40:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:40:54,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:54,754 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:54,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:40:54,754 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1216112801, now seen corresponding path program 1 times [2021-01-06 11:40:54,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:54,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494928123] [2021-01-06 11:40:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:40:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:40:54,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494928123] [2021-01-06 11:40:54,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:40:54,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:40:54,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726057905] [2021-01-06 11:40:54,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:40:54,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:40:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:40:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:40:54,800 INFO L87 Difference]: Start difference. First operand 504 states and 741 transitions. Second operand 3 states. [2021-01-06 11:40:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:40:54,833 INFO L93 Difference]: Finished difference Result 991 states and 1463 transitions. [2021-01-06 11:40:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:40:54,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:40:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:40:54,837 INFO L225 Difference]: With dead ends: 991 [2021-01-06 11:40:54,837 INFO L226 Difference]: Without dead ends: 506 [2021-01-06 11:40:54,838 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:40:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-01-06 11:40:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-01-06 11:40:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2021-01-06 11:40:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 743 transitions. [2021-01-06 11:40:54,855 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 743 transitions. Word has length 106 [2021-01-06 11:40:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:40:54,855 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 743 transitions. [2021-01-06 11:40:54,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:40:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 743 transitions. [2021-01-06 11:40:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-06 11:40:54,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:40:54,857 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:40:54,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:40:54,857 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:40:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:40:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2021-01-06 11:40:54,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:40:54,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872764590] [2021-01-06 11:40:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:40:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:40:54,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:40:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:40:55,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:40:55,192 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:40:55,193 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:40:55,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:40:55,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:40:55 BoogieIcfgContainer [2021-01-06 11:40:55,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:40:55,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:40:55,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:40:55,398 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:40:55,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:40:26" (3/4) ... [2021-01-06 11:40:55,403 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:40:55,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:40:55,405 INFO L168 Benchmark]: Toolchain (without parser) took 31636.88 ms. Allocated memory was 160.4 MB in the beginning and 370.1 MB in the end (delta: 209.7 MB). Free memory was 134.2 MB in the beginning and 214.8 MB in the end (delta: -80.6 MB). Peak memory consumption was 130.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:40:55,405 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 160.4 MB. Free memory is still 140.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:40:55,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1038.62 ms. Allocated memory is still 160.4 MB. Free memory was 134.0 MB in the beginning and 137.9 MB in the end (delta: -3.9 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:40:55,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 200.18 ms. Allocated memory is still 160.4 MB. Free memory was 137.9 MB in the beginning and 133.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:40:55,406 INFO L168 Benchmark]: Boogie Preprocessor took 164.80 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 126.4 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:40:55,407 INFO L168 Benchmark]: RCFGBuilder took 1671.54 ms. Allocated memory is still 160.4 MB. Free memory was 126.4 MB in the beginning and 119.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:40:55,407 INFO L168 Benchmark]: TraceAbstraction took 28538.08 ms. Allocated memory was 160.4 MB in the beginning and 370.1 MB in the end (delta: 209.7 MB). Free memory was 119.0 MB in the beginning and 215.3 MB in the end (delta: -96.3 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:40:55,408 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 370.1 MB. Free memory was 215.3 MB in the beginning and 214.8 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:40:55,410 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.30 ms. Allocated memory is still 160.4 MB. Free memory is still 140.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1038.62 ms. Allocated memory is still 160.4 MB. Free memory was 134.0 MB in the beginning and 137.9 MB in the end (delta: -3.9 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 200.18 ms. Allocated memory is still 160.4 MB. Free memory was 137.9 MB in the beginning and 133.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 164.80 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 126.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1671.54 ms. Allocated memory is still 160.4 MB. Free memory was 126.4 MB in the beginning and 119.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28538.08 ms. Allocated memory was 160.4 MB in the beginning and 370.1 MB in the end (delta: 209.7 MB). Free memory was 119.0 MB in the beginning and 215.3 MB in the end (delta: -96.3 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. * Witness Printer took 5.16 ms. Allocated memory is still 370.1 MB. Free memory was 215.3 MB in the beginning and 214.8 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1705]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1557] EXPR s->session [L1557] EXPR s->s3 [L1557] EXPR (s->s3)->tmp.new_cipher [L1557] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1558] COND FALSE !(! tmp___9) [L1564] ret = __VERIFIER_nondet_int() [L1565] COND TRUE blastFlag == 2 [L1566] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1570] COND FALSE !(ret <= 0) [L1575] s->state = 8672 [L1576] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1577] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={6:0}] [L1705] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.2s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7515 SDtfs, 2112 SDslu, 10973 SDs, 0 SdLazy, 6885 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 763149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...