/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.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:46:55,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:46:55,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:46:55,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:46:55,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:46:55,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:46:55,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:46:55,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:46:55,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:46:55,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:46:55,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:46:55,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:46:55,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:46:55,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:46:55,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:46:55,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:46:55,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:46:55,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:46:55,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:46:55,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:46:55,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:46:55,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:46:55,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:46:55,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:46:55,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:46:55,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:46:55,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:46:55,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:46:55,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:46:55,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:46:55,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:46:55,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:46:55,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:46:55,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:46:55,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:46:55,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:46:55,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:46:55,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:46:55,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:46:55,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:46:55,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:46:55,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:46:55,908 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:46:55,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:46:55,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:46:55,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:46:55,911 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:46:55,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:46:55,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:46:55,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:46:55,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:46:55,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:46:55,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:46:55,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:46:55,913 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:46:55,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:46:55,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:46:55,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:46:55,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:46:55,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:46:55,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:46:55,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:46:55,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:46:55,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:46:55,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:46:55,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:46:55,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:46:55,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:46:56,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:46:56,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:46:56,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:46:56,364 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:46:56,366 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:46:56,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-12-23 01:46:56,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/965302093/02cc92e81ad04f088341540c3064e09c/FLAGc65d74e93 [2020-12-23 01:46:57,286 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:46:57,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-12-23 01:46:57,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/965302093/02cc92e81ad04f088341540c3064e09c/FLAGc65d74e93 [2020-12-23 01:46:57,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/965302093/02cc92e81ad04f088341540c3064e09c [2020-12-23 01:46:57,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:46:57,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:46:57,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:57,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:46:57,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:46:57,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:57" (1/1) ... [2020-12-23 01:46:57,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c98015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:57, skipping insertion in model container [2020-12-23 01:46:57,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:57" (1/1) ... [2020-12-23 01:46:57,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:46:57,643 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: lhs: VariableLHS[~tmp~2,] 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[~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: 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[~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[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: 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: 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[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:58,222 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.07.i.cil-2.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:58,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:58,253 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: lhs: VariableLHS[~tmp~2,] 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[~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: 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[~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[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: 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: 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[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:58,539 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.07.i.cil-2.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:58,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:58,596 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:46:58,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58 WrapperNode [2020-12-23 01:46:58,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:58,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:58,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:46:58,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:46:58,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:58,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:46:58,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:46:58,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:46:58,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 01:46:58,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:46:58,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:46:58,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:46:58,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:46:58,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:46:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:46:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:46:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:46:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:46:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:46:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:46:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:46:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:46:58,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:46:59,281 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:47:00,454 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:47:00,454 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:47:00,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:47:00,465 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:47:00,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00 BoogieIcfgContainer [2020-12-23 01:47:00,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:47:00,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:47:00,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:47:00,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:47:00,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:46:57" (1/3) ... [2020-12-23 01:47:00,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e18ad25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:00, skipping insertion in model container [2020-12-23 01:47:00,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (2/3) ... [2020-12-23 01:47:00,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e18ad25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:00, skipping insertion in model container [2020-12-23 01:47:00,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00" (3/3) ... [2020-12-23 01:47:00,477 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2020-12-23 01:47:00,484 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:47:00,490 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:47:00,510 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:47:00,538 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:47:00,539 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:47:00,539 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:47:00,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:47:00,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:47:00,539 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:47:00,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:47:00,539 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:47:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-12-23 01:47:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 01:47:00,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:00,569 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] [2020-12-23 01:47:00,570 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2020-12-23 01:47:00,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:00,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169528435] [2020-12-23 01:47:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:01,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169528435] [2020-12-23 01:47:01,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:01,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:01,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290677223] [2020-12-23 01:47:01,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:01,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:01,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:01,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:01,104 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2020-12-23 01:47:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:01,908 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2020-12-23 01:47:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:01,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 01:47:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:01,925 INFO L225 Difference]: With dead ends: 323 [2020-12-23 01:47:01,925 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 01:47:01,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 01:47:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-12-23 01:47:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2020-12-23 01:47:01,995 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2020-12-23 01:47:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:01,995 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2020-12-23 01:47:01,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2020-12-23 01:47:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 01:47:01,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:02,000 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] [2020-12-23 01:47:02,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:47:02,000 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2020-12-23 01:47:02,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:02,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995792018] [2020-12-23 01:47:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:02,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995792018] [2020-12-23 01:47:02,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:02,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:02,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597318114] [2020-12-23 01:47:02,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:02,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:02,200 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2020-12-23 01:47:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:02,809 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2020-12-23 01:47:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:02,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-23 01:47:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:02,817 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:47:02,817 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 01:47:02,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 01:47:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-12-23 01:47:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2020-12-23 01:47:02,854 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2020-12-23 01:47:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:02,854 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2020-12-23 01:47:02,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2020-12-23 01:47:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:02,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:02,859 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] [2020-12-23 01:47:02,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:47:02,860 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2020-12-23 01:47:02,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:02,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987169003] [2020-12-23 01:47:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:02,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987169003] [2020-12-23 01:47:02,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:02,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:02,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789127666] [2020-12-23 01:47:03,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:03,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:03,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:03,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:03,005 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2020-12-23 01:47:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:03,551 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2020-12-23 01:47:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:03,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:03,559 INFO L225 Difference]: With dead ends: 289 [2020-12-23 01:47:03,566 INFO L226 Difference]: Without dead ends: 162 [2020-12-23 01:47:03,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 [2020-12-23 01:47:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-23 01:47:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2020-12-23 01:47:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2020-12-23 01:47:03,593 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2020-12-23 01:47:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:03,593 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2020-12-23 01:47:03,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2020-12-23 01:47:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:03,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:03,597 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] [2020-12-23 01:47:03,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:47:03,601 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2020-12-23 01:47:03,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:03,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818845532] [2020-12-23 01:47:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:03,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818845532] [2020-12-23 01:47:03,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:03,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:03,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551482827] [2020-12-23 01:47:03,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:03,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:03,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:03,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:03,788 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2020-12-23 01:47:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:04,303 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2020-12-23 01:47:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:04,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:04,306 INFO L225 Difference]: With dead ends: 287 [2020-12-23 01:47:04,306 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:47:04,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:47:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-12-23 01:47:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2020-12-23 01:47:04,318 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2020-12-23 01:47:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:04,318 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2020-12-23 01:47:04,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2020-12-23 01:47:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:04,322 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:04,322 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] [2020-12-23 01:47:04,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:47:04,322 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2020-12-23 01:47:04,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:04,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603855265] [2020-12-23 01:47:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:04,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603855265] [2020-12-23 01:47:04,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:04,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:04,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294081047] [2020-12-23 01:47:04,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:04,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:04,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:04,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:04,411 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2020-12-23 01:47:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:04,944 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2020-12-23 01:47:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:04,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:04,947 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:04,947 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:04,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2020-12-23 01:47:04,957 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2020-12-23 01:47:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:04,957 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2020-12-23 01:47:04,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2020-12-23 01:47:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:04,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:04,960 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] [2020-12-23 01:47:04,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:47:04,960 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2020-12-23 01:47:04,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:04,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443549272] [2020-12-23 01:47:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:05,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443549272] [2020-12-23 01:47:05,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:05,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:05,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377626796] [2020-12-23 01:47:05,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:05,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:05,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:05,112 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2020-12-23 01:47:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:05,620 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2020-12-23 01:47:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:05,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:05,623 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:05,623 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:05,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2020-12-23 01:47:05,637 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2020-12-23 01:47:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:05,638 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2020-12-23 01:47:05,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2020-12-23 01:47:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:47:05,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:05,649 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] [2020-12-23 01:47:05,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:47:05,651 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2020-12-23 01:47:05,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:05,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129137197] [2020-12-23 01:47:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:05,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129137197] [2020-12-23 01:47:05,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:05,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:05,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405065021] [2020-12-23 01:47:05,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:05,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:05,752 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2020-12-23 01:47:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:06,271 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2020-12-23 01:47:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:06,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-23 01:47:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:06,274 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:06,275 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:06,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2020-12-23 01:47:06,285 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2020-12-23 01:47:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:06,286 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2020-12-23 01:47:06,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-12-23 01:47:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 01:47:06,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:06,287 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] [2020-12-23 01:47:06,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:47:06,288 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2020-12-23 01:47:06,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:06,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752348106] [2020-12-23 01:47:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:06,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752348106] [2020-12-23 01:47:06,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:06,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:06,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048567979] [2020-12-23 01:47:06,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:06,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:06,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:06,365 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2020-12-23 01:47:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:06,896 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2020-12-23 01:47:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:06,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 01:47:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:06,899 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:06,899 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:06,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2020-12-23 01:47:06,906 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2020-12-23 01:47:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2020-12-23 01:47:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2020-12-23 01:47:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 01:47:06,908 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:06,908 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] [2020-12-23 01:47:06,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:47:06,909 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2020-12-23 01:47:06,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:06,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444964625] [2020-12-23 01:47:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:06,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444964625] [2020-12-23 01:47:06,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:06,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:06,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480329155] [2020-12-23 01:47:06,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:06,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:06,986 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2020-12-23 01:47:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:07,441 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2020-12-23 01:47:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:07,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 01:47:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:07,444 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:47:07,444 INFO L226 Difference]: Without dead ends: 149 [2020-12-23 01:47:07,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-12-23 01:47:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2020-12-23 01:47:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2020-12-23 01:47:07,452 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2020-12-23 01:47:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:07,452 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2020-12-23 01:47:07,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2020-12-23 01:47:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 01:47:07,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:07,454 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] [2020-12-23 01:47:07,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:47:07,454 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2020-12-23 01:47:07,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:07,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457289618] [2020-12-23 01:47:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:07,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457289618] [2020-12-23 01:47:07,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:07,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:07,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190063799] [2020-12-23 01:47:07,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:07,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:07,530 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2020-12-23 01:47:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:08,093 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2020-12-23 01:47:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:08,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 01:47:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:08,096 INFO L225 Difference]: With dead ends: 316 [2020-12-23 01:47:08,097 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 01:47:08,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 01:47:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-12-23 01:47:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2020-12-23 01:47:08,105 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2020-12-23 01:47:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:08,105 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2020-12-23 01:47:08,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2020-12-23 01:47:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 01:47:08,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:08,107 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] [2020-12-23 01:47:08,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:47:08,107 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:08,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2020-12-23 01:47:08,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:08,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101992811] [2020-12-23 01:47:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:08,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101992811] [2020-12-23 01:47:08,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:08,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:08,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437299452] [2020-12-23 01:47:08,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:08,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:08,206 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2020-12-23 01:47:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:08,724 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2020-12-23 01:47:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:08,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 01:47:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:08,727 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:47:08,727 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 01:47:08,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 01:47:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-12-23 01:47:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2020-12-23 01:47:08,735 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2020-12-23 01:47:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:08,736 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2020-12-23 01:47:08,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2020-12-23 01:47:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:08,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:08,737 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] [2020-12-23 01:47:08,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:47:08,738 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2020-12-23 01:47:08,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:08,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462421002] [2020-12-23 01:47:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:08,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462421002] [2020-12-23 01:47:08,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:08,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:08,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088362791] [2020-12-23 01:47:08,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:08,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:08,826 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2020-12-23 01:47:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:09,365 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2020-12-23 01:47:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:09,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:09,367 INFO L225 Difference]: With dead ends: 337 [2020-12-23 01:47:09,368 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 01:47:09,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 01:47:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2020-12-23 01:47:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2020-12-23 01:47:09,375 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2020-12-23 01:47:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:09,376 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2020-12-23 01:47:09,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2020-12-23 01:47:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:09,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:09,377 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] [2020-12-23 01:47:09,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:47:09,377 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2020-12-23 01:47:09,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:09,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019341326] [2020-12-23 01:47:09,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:09,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019341326] [2020-12-23 01:47:09,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:09,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:09,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292804895] [2020-12-23 01:47:09,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:09,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:09,476 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2020-12-23 01:47:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:10,018 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2020-12-23 01:47:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:10,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:10,021 INFO L225 Difference]: With dead ends: 335 [2020-12-23 01:47:10,021 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 01:47:10,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 01:47:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2020-12-23 01:47:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2020-12-23 01:47:10,029 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2020-12-23 01:47:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:10,029 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2020-12-23 01:47:10,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2020-12-23 01:47:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:10,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:10,030 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] [2020-12-23 01:47:10,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:47:10,031 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:10,031 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2020-12-23 01:47:10,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:10,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644198963] [2020-12-23 01:47:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:10,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644198963] [2020-12-23 01:47:10,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:10,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:10,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926436048] [2020-12-23 01:47:10,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:10,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:10,096 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2020-12-23 01:47:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:10,593 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2020-12-23 01:47:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:10,595 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:10,596 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:10,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2020-12-23 01:47:10,602 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2020-12-23 01:47:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:10,603 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2020-12-23 01:47:10,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2020-12-23 01:47:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:10,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:10,604 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] [2020-12-23 01:47:10,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:47:10,604 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2020-12-23 01:47:10,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:10,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641941263] [2020-12-23 01:47:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:10,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641941263] [2020-12-23 01:47:10,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:10,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:10,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288676057] [2020-12-23 01:47:10,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:10,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:10,665 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2020-12-23 01:47:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:11,142 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2020-12-23 01:47:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:11,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:11,145 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:11,145 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:11,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2020-12-23 01:47:11,152 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2020-12-23 01:47:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:11,152 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-12-23 01:47:11,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2020-12-23 01:47:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:47:11,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:11,154 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] [2020-12-23 01:47:11,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:47:11,154 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:11,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2020-12-23 01:47:11,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:11,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396839232] [2020-12-23 01:47:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:11,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396839232] [2020-12-23 01:47:11,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:11,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:11,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793391994] [2020-12-23 01:47:11,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:11,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:11,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:11,220 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2020-12-23 01:47:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:11,690 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2020-12-23 01:47:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:11,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 01:47:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:11,692 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:11,693 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:11,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2020-12-23 01:47:11,699 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2020-12-23 01:47:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:11,700 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-12-23 01:47:11,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2020-12-23 01:47:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 01:47:11,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:11,701 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] [2020-12-23 01:47:11,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:47:11,701 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2020-12-23 01:47:11,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:11,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844578190] [2020-12-23 01:47:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:11,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844578190] [2020-12-23 01:47:11,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:11,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:11,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591347827] [2020-12-23 01:47:11,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:11,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:11,765 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2020-12-23 01:47:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:12,290 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2020-12-23 01:47:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:12,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 01:47:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:12,295 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:12,295 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:12,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2020-12-23 01:47:12,304 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2020-12-23 01:47:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:12,304 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2020-12-23 01:47:12,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2020-12-23 01:47:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 01:47:12,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:12,306 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] [2020-12-23 01:47:12,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:47:12,306 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2020-12-23 01:47:12,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:12,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818039643] [2020-12-23 01:47:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:12,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818039643] [2020-12-23 01:47:12,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:12,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:12,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611041976] [2020-12-23 01:47:12,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:12,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:12,382 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2020-12-23 01:47:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:12,864 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2020-12-23 01:47:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:12,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-23 01:47:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:12,867 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:47:12,868 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 01:47:12,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 01:47:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2020-12-23 01:47:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2020-12-23 01:47:12,876 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2020-12-23 01:47:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:12,876 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2020-12-23 01:47:12,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2020-12-23 01:47:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:47:12,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:12,877 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] [2020-12-23 01:47:12,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:47:12,877 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2020-12-23 01:47:12,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:12,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278541162] [2020-12-23 01:47:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:12,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278541162] [2020-12-23 01:47:12,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:12,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:12,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696033060] [2020-12-23 01:47:12,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:12,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:12,974 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2020-12-23 01:47:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:13,870 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2020-12-23 01:47:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:13,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:47:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:13,874 INFO L225 Difference]: With dead ends: 422 [2020-12-23 01:47:13,874 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 01:47:13,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 01:47:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2020-12-23 01:47:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-23 01:47:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2020-12-23 01:47:13,882 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2020-12-23 01:47:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:13,883 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2020-12-23 01:47:13,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2020-12-23 01:47:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:47:13,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:13,884 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] [2020-12-23 01:47:13,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:47:13,885 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2020-12-23 01:47:13,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:13,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000669403] [2020-12-23 01:47:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:14,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000669403] [2020-12-23 01:47:14,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:14,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:14,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988529888] [2020-12-23 01:47:14,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:14,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:14,003 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2020-12-23 01:47:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:14,602 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2020-12-23 01:47:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:14,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:47:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:14,605 INFO L225 Difference]: With dead ends: 427 [2020-12-23 01:47:14,605 INFO L226 Difference]: Without dead ends: 248 [2020-12-23 01:47:14,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-12-23 01:47:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2020-12-23 01:47:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-12-23 01:47:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2020-12-23 01:47:14,613 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2020-12-23 01:47:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:14,613 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-12-23 01:47:14,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2020-12-23 01:47:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:47:14,615 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:14,615 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] [2020-12-23 01:47:14,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:47:14,615 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2020-12-23 01:47:14,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:14,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190677693] [2020-12-23 01:47:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:14,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190677693] [2020-12-23 01:47:14,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:14,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:14,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364414934] [2020-12-23 01:47:14,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:14,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:14,701 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2020-12-23 01:47:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:15,434 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2020-12-23 01:47:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:15,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:47:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:15,436 INFO L225 Difference]: With dead ends: 492 [2020-12-23 01:47:15,437 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:47:15,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:47:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2020-12-23 01:47:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-12-23 01:47:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2020-12-23 01:47:15,445 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2020-12-23 01:47:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:15,446 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2020-12-23 01:47:15,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2020-12-23 01:47:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 01:47:15,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:15,447 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] [2020-12-23 01:47:15,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:47:15,447 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2020-12-23 01:47:15,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:15,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973531331] [2020-12-23 01:47:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:15,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973531331] [2020-12-23 01:47:15,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:15,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:15,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196626074] [2020-12-23 01:47:15,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:15,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:15,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:15,547 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2020-12-23 01:47:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:16,339 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2020-12-23 01:47:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:16,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 01:47:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:16,342 INFO L225 Difference]: With dead ends: 493 [2020-12-23 01:47:16,342 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:47:16,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:47:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2020-12-23 01:47:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-12-23 01:47:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2020-12-23 01:47:16,352 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2020-12-23 01:47:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:16,352 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2020-12-23 01:47:16,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2020-12-23 01:47:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 01:47:16,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:16,354 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] [2020-12-23 01:47:16,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:47:16,354 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2020-12-23 01:47:16,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:16,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430375455] [2020-12-23 01:47:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:16,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430375455] [2020-12-23 01:47:16,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:16,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:16,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428553321] [2020-12-23 01:47:16,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:16,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:16,469 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2020-12-23 01:47:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:17,168 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2020-12-23 01:47:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:17,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 01:47:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:17,172 INFO L225 Difference]: With dead ends: 497 [2020-12-23 01:47:17,173 INFO L226 Difference]: Without dead ends: 283 [2020-12-23 01:47:17,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-23 01:47:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2020-12-23 01:47:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2020-12-23 01:47:17,182 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2020-12-23 01:47:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:17,183 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2020-12-23 01:47:17,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2020-12-23 01:47:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 01:47:17,185 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:17,185 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] [2020-12-23 01:47:17,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:47:17,186 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2020-12-23 01:47:17,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:17,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003299416] [2020-12-23 01:47:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:17,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003299416] [2020-12-23 01:47:17,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:17,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:17,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123509641] [2020-12-23 01:47:17,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:17,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:17,282 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2020-12-23 01:47:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:18,048 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2020-12-23 01:47:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:18,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-12-23 01:47:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:18,051 INFO L225 Difference]: With dead ends: 498 [2020-12-23 01:47:18,051 INFO L226 Difference]: Without dead ends: 283 [2020-12-23 01:47:18,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-23 01:47:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2020-12-23 01:47:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2020-12-23 01:47:18,060 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2020-12-23 01:47:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:18,060 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2020-12-23 01:47:18,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2020-12-23 01:47:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 01:47:18,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:18,062 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] [2020-12-23 01:47:18,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:47:18,063 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2020-12-23 01:47:18,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:18,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446163374] [2020-12-23 01:47:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:18,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446163374] [2020-12-23 01:47:18,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:18,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:18,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399653067] [2020-12-23 01:47:18,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:18,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:18,153 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2020-12-23 01:47:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:18,787 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2020-12-23 01:47:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:18,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-12-23 01:47:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:18,790 INFO L225 Difference]: With dead ends: 475 [2020-12-23 01:47:18,790 INFO L226 Difference]: Without dead ends: 260 [2020-12-23 01:47:18,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-12-23 01:47:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2020-12-23 01:47:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2020-12-23 01:47:18,801 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2020-12-23 01:47:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:18,801 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2020-12-23 01:47:18,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2020-12-23 01:47:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:18,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:18,803 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] [2020-12-23 01:47:18,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:47:18,803 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2020-12-23 01:47:18,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:18,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950018624] [2020-12-23 01:47:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:18,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950018624] [2020-12-23 01:47:18,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:18,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:18,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75568361] [2020-12-23 01:47:18,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:18,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:18,898 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2020-12-23 01:47:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:19,648 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2020-12-23 01:47:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:19,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:47:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:19,651 INFO L225 Difference]: With dead ends: 497 [2020-12-23 01:47:19,651 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 01:47:19,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 01:47:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2020-12-23 01:47:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2020-12-23 01:47:19,661 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2020-12-23 01:47:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:19,661 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2020-12-23 01:47:19,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2020-12-23 01:47:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:19,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:19,663 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] [2020-12-23 01:47:19,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:47:19,664 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2020-12-23 01:47:19,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:19,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792403129] [2020-12-23 01:47:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:19,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792403129] [2020-12-23 01:47:19,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:19,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:19,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837345503] [2020-12-23 01:47:19,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:19,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:19,751 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2020-12-23 01:47:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:20,418 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2020-12-23 01:47:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:20,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:47:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:20,421 INFO L225 Difference]: With dead ends: 495 [2020-12-23 01:47:20,421 INFO L226 Difference]: Without dead ends: 280 [2020-12-23 01:47:20,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-23 01:47:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2020-12-23 01:47:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2020-12-23 01:47:20,429 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2020-12-23 01:47:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:20,429 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2020-12-23 01:47:20,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2020-12-23 01:47:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:20,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:20,431 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] [2020-12-23 01:47:20,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:47:20,431 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2020-12-23 01:47:20,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:20,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538435154] [2020-12-23 01:47:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:20,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538435154] [2020-12-23 01:47:20,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:20,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:20,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202871680] [2020-12-23 01:47:20,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:20,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:20,522 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2020-12-23 01:47:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:21,187 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2020-12-23 01:47:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:21,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:47:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:21,190 INFO L225 Difference]: With dead ends: 494 [2020-12-23 01:47:21,190 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 01:47:21,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 01:47:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2020-12-23 01:47:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:47:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2020-12-23 01:47:21,197 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2020-12-23 01:47:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:21,197 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2020-12-23 01:47:21,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2020-12-23 01:47:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:21,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:21,198 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] [2020-12-23 01:47:21,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:47:21,199 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2020-12-23 01:47:21,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:21,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895525787] [2020-12-23 01:47:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 01:47:21,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895525787] [2020-12-23 01:47:21,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:21,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:47:21,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786808963] [2020-12-23 01:47:21,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:47:21,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:47:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:21,292 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2020-12-23 01:47:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:22,019 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2020-12-23 01:47:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:47:22,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 01:47:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:22,022 INFO L225 Difference]: With dead ends: 470 [2020-12-23 01:47:22,022 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:47:22,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:47:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:47:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2020-12-23 01:47:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2020-12-23 01:47:22,030 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2020-12-23 01:47:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:22,030 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2020-12-23 01:47:22,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:47:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2020-12-23 01:47:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:22,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:22,032 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] [2020-12-23 01:47:22,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:47:22,032 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2020-12-23 01:47:22,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:22,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787631477] [2020-12-23 01:47:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:22,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787631477] [2020-12-23 01:47:22,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:22,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:22,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983562425] [2020-12-23 01:47:22,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:22,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:22,103 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2020-12-23 01:47:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:22,632 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2020-12-23 01:47:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:22,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:47:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:22,637 INFO L225 Difference]: With dead ends: 512 [2020-12-23 01:47:22,637 INFO L226 Difference]: Without dead ends: 277 [2020-12-23 01:47:22,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-12-23 01:47:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2020-12-23 01:47:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2020-12-23 01:47:22,646 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2020-12-23 01:47:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:22,647 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2020-12-23 01:47:22,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2020-12-23 01:47:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:47:22,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:22,648 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] [2020-12-23 01:47:22,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:47:22,648 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2020-12-23 01:47:22,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:22,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203726555] [2020-12-23 01:47:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:22,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203726555] [2020-12-23 01:47:22,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:22,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:22,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35374289] [2020-12-23 01:47:22,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:22,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:22,726 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2020-12-23 01:47:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:23,320 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2020-12-23 01:47:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:23,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:47:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:23,323 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:47:23,323 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:47:23,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:47:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:47:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2020-12-23 01:47:23,332 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2020-12-23 01:47:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:23,332 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2020-12-23 01:47:23,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2020-12-23 01:47:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 01:47:23,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:23,334 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] [2020-12-23 01:47:23,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:47:23,334 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2020-12-23 01:47:23,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:23,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945715504] [2020-12-23 01:47:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:23,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945715504] [2020-12-23 01:47:23,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:23,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:23,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463464342] [2020-12-23 01:47:23,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:23,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:23,406 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2020-12-23 01:47:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:24,114 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2020-12-23 01:47:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:24,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 01:47:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:24,117 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:47:24,117 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:47:24,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:47:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-12-23 01:47:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2020-12-23 01:47:24,130 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2020-12-23 01:47:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:24,130 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2020-12-23 01:47:24,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2020-12-23 01:47:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 01:47:24,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:24,132 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] [2020-12-23 01:47:24,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:47:24,132 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2020-12-23 01:47:24,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:24,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701969618] [2020-12-23 01:47:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:24,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701969618] [2020-12-23 01:47:24,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:24,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:24,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977016654] [2020-12-23 01:47:24,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:24,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:24,213 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2020-12-23 01:47:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:24,767 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2020-12-23 01:47:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:24,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 01:47:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:24,771 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:47:24,771 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:47:24,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:47:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:47:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2020-12-23 01:47:24,781 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2020-12-23 01:47:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:24,781 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2020-12-23 01:47:24,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2020-12-23 01:47:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 01:47:24,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:24,782 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] [2020-12-23 01:47:24,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:47:24,783 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2020-12-23 01:47:24,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:24,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787971458] [2020-12-23 01:47:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:24,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787971458] [2020-12-23 01:47:24,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:24,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:24,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394739731] [2020-12-23 01:47:24,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:24,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:24,860 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2020-12-23 01:47:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:25,581 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2020-12-23 01:47:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:25,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 01:47:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:25,584 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:47:25,584 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:47:25,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:47:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-12-23 01:47:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2020-12-23 01:47:25,593 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2020-12-23 01:47:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:25,593 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2020-12-23 01:47:25,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2020-12-23 01:47:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 01:47:25,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:25,595 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] [2020-12-23 01:47:25,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:47:25,595 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2020-12-23 01:47:25,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:25,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364717511] [2020-12-23 01:47:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:25,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364717511] [2020-12-23 01:47:25,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:25,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:25,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954124356] [2020-12-23 01:47:25,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:25,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:25,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:25,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:25,682 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2020-12-23 01:47:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:26,242 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2020-12-23 01:47:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:26,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 01:47:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:26,245 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:47:26,245 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:47:26,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:47:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:47:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2020-12-23 01:47:26,255 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2020-12-23 01:47:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:26,255 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2020-12-23 01:47:26,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2020-12-23 01:47:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 01:47:26,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:26,257 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] [2020-12-23 01:47:26,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:47:26,258 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2020-12-23 01:47:26,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:26,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417067419] [2020-12-23 01:47:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:26,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417067419] [2020-12-23 01:47:26,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:26,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:26,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440029949] [2020-12-23 01:47:26,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:26,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:26,359 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2020-12-23 01:47:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:27,097 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2020-12-23 01:47:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:27,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-12-23 01:47:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:27,101 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:47:27,101 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:47:27,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:47:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-12-23 01:47:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2020-12-23 01:47:27,112 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2020-12-23 01:47:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:27,113 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2020-12-23 01:47:27,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2020-12-23 01:47:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 01:47:27,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:27,114 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] [2020-12-23 01:47:27,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:47:27,115 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2020-12-23 01:47:27,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:27,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143300087] [2020-12-23 01:47:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:27,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143300087] [2020-12-23 01:47:27,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:27,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:27,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678067546] [2020-12-23 01:47:27,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:27,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:27,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:27,201 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2020-12-23 01:47:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:27,767 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2020-12-23 01:47:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:27,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-12-23 01:47:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:27,770 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:47:27,770 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:47:27,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:47:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:47:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2020-12-23 01:47:27,780 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2020-12-23 01:47:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:27,781 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2020-12-23 01:47:27,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2020-12-23 01:47:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 01:47:27,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:27,782 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] [2020-12-23 01:47:27,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:47:27,783 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2020-12-23 01:47:27,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:27,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785652644] [2020-12-23 01:47:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:27,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785652644] [2020-12-23 01:47:27,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:27,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:27,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684154063] [2020-12-23 01:47:27,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:27,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:27,859 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2020-12-23 01:47:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:28,569 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2020-12-23 01:47:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:28,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 01:47:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:28,572 INFO L225 Difference]: With dead ends: 524 [2020-12-23 01:47:28,572 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:47:28,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:47:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2020-12-23 01:47:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2020-12-23 01:47:28,584 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2020-12-23 01:47:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:28,584 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2020-12-23 01:47:28,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2020-12-23 01:47:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 01:47:28,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:28,586 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] [2020-12-23 01:47:28,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:47:28,586 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2020-12-23 01:47:28,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:28,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035171378] [2020-12-23 01:47:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:28,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035171378] [2020-12-23 01:47:28,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:28,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:28,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511211266] [2020-12-23 01:47:28,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:28,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:28,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:28,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:28,673 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2020-12-23 01:47:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:29,243 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2020-12-23 01:47:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:29,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 01:47:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:29,246 INFO L225 Difference]: With dead ends: 501 [2020-12-23 01:47:29,246 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 01:47:29,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 01:47:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2020-12-23 01:47:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2020-12-23 01:47:29,255 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2020-12-23 01:47:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:29,255 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2020-12-23 01:47:29,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2020-12-23 01:47:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:47:29,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:29,257 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] [2020-12-23 01:47:29,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:47:29,257 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2020-12-23 01:47:29,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:29,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211604155] [2020-12-23 01:47:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:29,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211604155] [2020-12-23 01:47:29,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:29,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:29,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761229419] [2020-12-23 01:47:29,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:29,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:29,351 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2020-12-23 01:47:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,029 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2020-12-23 01:47:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:30,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:47:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,032 INFO L225 Difference]: With dead ends: 524 [2020-12-23 01:47:30,032 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:47:30,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:47:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2020-12-23 01:47:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:47:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2020-12-23 01:47:30,041 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2020-12-23 01:47:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,041 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2020-12-23 01:47:30,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2020-12-23 01:47:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:47:30,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,043 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] [2020-12-23 01:47:30,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:47:30,043 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2020-12-23 01:47:30,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464454251] [2020-12-23 01:47:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 01:47:30,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464454251] [2020-12-23 01:47:30,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:30,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037541545] [2020-12-23 01:47:30,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:30,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,114 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2020-12-23 01:47:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,245 INFO L93 Difference]: Finished difference Result 717 states and 1067 transitions. [2020-12-23 01:47:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:30,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:47:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,249 INFO L225 Difference]: With dead ends: 717 [2020-12-23 01:47:30,249 INFO L226 Difference]: Without dead ends: 482 [2020-12-23 01:47:30,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-12-23 01:47:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-12-23 01:47:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-12-23 01:47:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 708 transitions. [2020-12-23 01:47:30,266 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 708 transitions. Word has length 96 [2020-12-23 01:47:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,267 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 708 transitions. [2020-12-23 01:47:30,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 708 transitions. [2020-12-23 01:47:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:47:30,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,269 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] [2020-12-23 01:47:30,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:47:30,269 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 149915310, now seen corresponding path program 1 times [2020-12-23 01:47:30,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187888486] [2020-12-23 01:47:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 01:47:30,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187888486] [2020-12-23 01:47:30,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:30,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971239803] [2020-12-23 01:47:30,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:30,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,323 INFO L87 Difference]: Start difference. First operand 482 states and 708 transitions. Second operand 3 states. [2020-12-23 01:47:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,403 INFO L93 Difference]: Finished difference Result 972 states and 1431 transitions. [2020-12-23 01:47:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:30,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:47:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,407 INFO L225 Difference]: With dead ends: 972 [2020-12-23 01:47:30,407 INFO L226 Difference]: Without dead ends: 509 [2020-12-23 01:47:30,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-12-23 01:47:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2020-12-23 01:47:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2020-12-23 01:47:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 743 transitions. [2020-12-23 01:47:30,425 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 743 transitions. Word has length 96 [2020-12-23 01:47:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,426 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 743 transitions. [2020-12-23 01:47:30,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 743 transitions. [2020-12-23 01:47:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:47:30,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,436 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] [2020-12-23 01:47:30,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 01:47:30,437 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash 176980912, now seen corresponding path program 1 times [2020-12-23 01:47:30,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632409110] [2020-12-23 01:47:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-23 01:47:30,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632409110] [2020-12-23 01:47:30,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:30,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637089483] [2020-12-23 01:47:30,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:30,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,484 INFO L87 Difference]: Start difference. First operand 509 states and 743 transitions. Second operand 3 states. [2020-12-23 01:47:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,539 INFO L93 Difference]: Finished difference Result 1001 states and 1467 transitions. [2020-12-23 01:47:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:30,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:47:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,543 INFO L225 Difference]: With dead ends: 1001 [2020-12-23 01:47:30,543 INFO L226 Difference]: Without dead ends: 511 [2020-12-23 01:47:30,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-23 01:47:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2020-12-23 01:47:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-12-23 01:47:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2020-12-23 01:47:30,562 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2020-12-23 01:47:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,562 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2020-12-23 01:47:30,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2020-12-23 01:47:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:47:30,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,564 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] [2020-12-23 01:47:30,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 01:47:30,564 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2020-12-23 01:47:30,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678464112] [2020-12-23 01:47:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:30,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678464112] [2020-12-23 01:47:30,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:30,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806757594] [2020-12-23 01:47:30,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:30,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,634 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2020-12-23 01:47:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,741 INFO L93 Difference]: Finished difference Result 1236 states and 1817 transitions. [2020-12-23 01:47:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:30,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 01:47:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,746 INFO L225 Difference]: With dead ends: 1236 [2020-12-23 01:47:30,746 INFO L226 Difference]: Without dead ends: 746 [2020-12-23 01:47:30,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-12-23 01:47:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2020-12-23 01:47:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-12-23 01:47:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1093 transitions. [2020-12-23 01:47:30,773 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1093 transitions. Word has length 98 [2020-12-23 01:47:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,774 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1093 transitions. [2020-12-23 01:47:30,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1093 transitions. [2020-12-23 01:47:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 01:47:30,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,776 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:30,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 01:47:30,776 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2020-12-23 01:47:30,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628839225] [2020-12-23 01:47:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:30,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628839225] [2020-12-23 01:47:30,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:30,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443071233] [2020-12-23 01:47:30,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:30,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:30,844 INFO L87 Difference]: Start difference. First operand 744 states and 1093 transitions. Second operand 3 states. [2020-12-23 01:47:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,991 INFO L93 Difference]: Finished difference Result 1702 states and 2511 transitions. [2020-12-23 01:47:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:30,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 01:47:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,997 INFO L225 Difference]: With dead ends: 1702 [2020-12-23 01:47:30,997 INFO L226 Difference]: Without dead ends: 979 [2020-12-23 01:47:30,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-12-23 01:47:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 977. [2020-12-23 01:47:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-12-23 01:47:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1427 transitions. [2020-12-23 01:47:31,032 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1427 transitions. Word has length 104 [2020-12-23 01:47:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:31,033 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1427 transitions. [2020-12-23 01:47:31,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1427 transitions. [2020-12-23 01:47:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:47:31,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:31,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:31,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 01:47:31,036 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2020-12-23 01:47:31,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:31,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948706070] [2020-12-23 01:47:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:31,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948706070] [2020-12-23 01:47:31,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:31,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:31,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301214634] [2020-12-23 01:47:31,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:31,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:31,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:31,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:31,113 INFO L87 Difference]: Start difference. First operand 977 states and 1427 transitions. Second operand 3 states. [2020-12-23 01:47:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:31,221 INFO L93 Difference]: Finished difference Result 2166 states and 3178 transitions. [2020-12-23 01:47:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:31,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-23 01:47:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:31,228 INFO L225 Difference]: With dead ends: 2166 [2020-12-23 01:47:31,228 INFO L226 Difference]: Without dead ends: 1210 [2020-12-23 01:47:31,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-12-23 01:47:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2020-12-23 01:47:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2020-12-23 01:47:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1772 transitions. [2020-12-23 01:47:31,267 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1772 transitions. Word has length 121 [2020-12-23 01:47:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:31,268 INFO L481 AbstractCegarLoop]: Abstraction has 1210 states and 1772 transitions. [2020-12-23 01:47:31,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1772 transitions. [2020-12-23 01:47:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 01:47:31,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:31,270 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:31,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 01:47:31,271 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2020-12-23 01:47:31,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:31,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991359994] [2020-12-23 01:47:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:31,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991359994] [2020-12-23 01:47:31,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:31,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:31,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957556172] [2020-12-23 01:47:31,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:31,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:31,366 INFO L87 Difference]: Start difference. First operand 1210 states and 1772 transitions. Second operand 3 states. [2020-12-23 01:47:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:31,469 INFO L93 Difference]: Finished difference Result 1447 states and 2117 transitions. [2020-12-23 01:47:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:31,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2020-12-23 01:47:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:31,476 INFO L225 Difference]: With dead ends: 1447 [2020-12-23 01:47:31,476 INFO L226 Difference]: Without dead ends: 1445 [2020-12-23 01:47:31,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-12-23 01:47:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1443. [2020-12-23 01:47:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-12-23 01:47:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2114 transitions. [2020-12-23 01:47:31,524 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2114 transitions. Word has length 127 [2020-12-23 01:47:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:31,524 INFO L481 AbstractCegarLoop]: Abstraction has 1443 states and 2114 transitions. [2020-12-23 01:47:31,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2114 transitions. [2020-12-23 01:47:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:47:31,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:31,529 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:31,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 01:47:31,529 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2020-12-23 01:47:31,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:31,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962351848] [2020-12-23 01:47:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:32,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962351848] [2020-12-23 01:47:32,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410663388] [2020-12-23 01:47:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:47:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:32,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 01:47:32,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:47:33,168 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,169 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2020-12-23 01:47:33,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,251 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2020-12-23 01:47:33,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2020-12-23 01:47:33,313 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:47:33,406 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,506 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:33,506 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:47:33,510 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,541 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,541 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2020-12-23 01:47:33,640 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:33,641 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:33,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,661 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:33,809 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:33,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:33,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:33,847 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2020-12-23 01:47:33,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2020-12-23 01:47:33,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:33,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,919 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:33,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:33,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:33,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2020-12-23 01:47:33,990 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:34,018 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,018 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2020-12-23 01:47:34,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:34,116 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 01:47:34,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:34,139 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2020-12-23 01:47:34,259 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:34,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:34,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:34,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:34,349 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:34,350 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:34,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:34,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,368 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:34,476 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2020-12-23 01:47:34,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:34,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2020-12-23 01:47:34,487 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:34,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:34,836 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-12-23 01:47:34,837 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2020-12-23 01:47:34,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2020-12-23 01:47:34,884 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:34,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 01:47:34,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:34,901 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:34,908 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:34,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:34,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2020-12-23 01:47:34,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 01:47:34,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:34,932 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:34,935 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:34,936 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:34,947 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:34,987 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2020-12-23 01:47:34,989 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:34,990 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2020-12-23 01:47:35,086 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2020-12-23 01:47:35,091 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:35,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:35,523 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2020-12-23 01:47:35,524 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2020-12-23 01:47:35,525 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2020-12-23 01:47:35,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2020-12-23 01:47:35,534 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:35,539 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:35,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:35,571 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:35,571 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2020-12-23 01:47:35,828 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2020-12-23 01:47:35,835 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 01:47:35,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:35,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:35,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:35,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:35,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:35,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:35,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:36,170 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-12-23 01:47:36,171 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2020-12-23 01:47:36,171 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2020-12-23 01:47:36,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 01:47:36,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 01:47:36,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 01:47:36,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:36,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:47:36,186 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:36,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:47:36,187 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:36,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:47:36,188 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:47:36,189 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:47:36,191 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,202 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:36,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:36,229 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2020-12-23 01:47:36,315 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_180|], 20=[|v_#memory_$Pointer$.base_171|]} [2020-12-23 01:47:36,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2020-12-23 01:47:36,325 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:36,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2020-12-23 01:47:36,365 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:36,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:36,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:36,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:36,516 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-12-23 01:47:36,517 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,517 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2020-12-23 01:47:36,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:47:36,527 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:36,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:47:36,529 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:36,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:47:36,530 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:47:36,531 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:47:36,532 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,538 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,540 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,542 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,543 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,544 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,547 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,550 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:36,551 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,552 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,553 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:36,559 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:47:36,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:36,562 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,566 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,567 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,570 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,572 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:47:36,573 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,574 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:36,579 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,582 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,585 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:36,586 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:36,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:36,590 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,591 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,592 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,594 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,595 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,599 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,602 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,606 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:36,611 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,612 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,616 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,618 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,619 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,620 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,624 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,627 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,628 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,634 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,635 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,636 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,640 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,643 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,644 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,647 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:36,648 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,651 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-23 01:47:36,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:36,653 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,654 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:36,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:36,658 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,659 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-23 01:47:36,660 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:36,661 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:36,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:36,665 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:36,668 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:36,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:36,682 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2020-12-23 01:47:36,757 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 01:47:36,758 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 01:47:36,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:36,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:36,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:36,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-12-23 01:47:37,039 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:47:37,040 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 01:47:37,046 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:37,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:37,056 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:37,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2020-12-23 01:47:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 130 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:37,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:47:37,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-12-23 01:47:37,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627325646] [2020-12-23 01:47:37,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 01:47:37,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 01:47:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-12-23 01:47:37,445 INFO L87 Difference]: Start difference. First operand 1443 states and 2114 transitions. Second operand 17 states. [2020-12-23 01:47:46,128 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-12-23 01:47:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:48,107 INFO L93 Difference]: Finished difference Result 7061 states and 10434 transitions. [2020-12-23 01:47:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 01:47:48,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 164 [2020-12-23 01:47:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:48,139 INFO L225 Difference]: With dead ends: 7061 [2020-12-23 01:47:48,139 INFO L226 Difference]: Without dead ends: 5639 [2020-12-23 01:47:48,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-12-23 01:47:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2020-12-23 01:47:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3127. [2020-12-23 01:47:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-12-23 01:47:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4737 transitions. [2020-12-23 01:47:48,332 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4737 transitions. Word has length 164 [2020-12-23 01:47:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:48,333 INFO L481 AbstractCegarLoop]: Abstraction has 3127 states and 4737 transitions. [2020-12-23 01:47:48,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 01:47:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4737 transitions. [2020-12-23 01:47:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 01:47:48,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:48,341 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:48,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-12-23 01:47:48,556 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2020-12-23 01:47:48,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:48,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989595324] [2020-12-23 01:47:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:48,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989595324] [2020-12-23 01:47:48,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:48,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:48,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691974802] [2020-12-23 01:47:48,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:48,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:48,703 INFO L87 Difference]: Start difference. First operand 3127 states and 4737 transitions. Second operand 4 states. [2020-12-23 01:47:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:49,520 INFO L93 Difference]: Finished difference Result 6929 states and 10530 transitions. [2020-12-23 01:47:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:49,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-12-23 01:47:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:49,537 INFO L225 Difference]: With dead ends: 6929 [2020-12-23 01:47:49,537 INFO L226 Difference]: Without dead ends: 3823 [2020-12-23 01:47:49,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2020-12-23 01:47:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3463. [2020-12-23 01:47:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2020-12-23 01:47:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5325 transitions. [2020-12-23 01:47:49,681 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5325 transitions. Word has length 170 [2020-12-23 01:47:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:49,681 INFO L481 AbstractCegarLoop]: Abstraction has 3463 states and 5325 transitions. [2020-12-23 01:47:49,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5325 transitions. [2020-12-23 01:47:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 01:47:49,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:49,691 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:49,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 01:47:49,691 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2020-12-23 01:47:49,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:49,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643759254] [2020-12-23 01:47:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-12-23 01:47:49,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643759254] [2020-12-23 01:47:49,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:49,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:49,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971978413] [2020-12-23 01:47:49,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:49,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:49,853 INFO L87 Difference]: Start difference. First operand 3463 states and 5325 transitions. Second operand 4 states. [2020-12-23 01:47:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:50,793 INFO L93 Difference]: Finished difference Result 8047 states and 12373 transitions. [2020-12-23 01:47:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:50,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2020-12-23 01:47:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:50,808 INFO L225 Difference]: With dead ends: 8047 [2020-12-23 01:47:50,809 INFO L226 Difference]: Without dead ends: 4605 [2020-12-23 01:47:50,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2020-12-23 01:47:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 3931. [2020-12-23 01:47:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3931 states. [2020-12-23 01:47:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 6177 transitions. [2020-12-23 01:47:51,015 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 6177 transitions. Word has length 178 [2020-12-23 01:47:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:51,016 INFO L481 AbstractCegarLoop]: Abstraction has 3931 states and 6177 transitions. [2020-12-23 01:47:51,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 6177 transitions. [2020-12-23 01:47:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:47:51,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:51,026 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:51,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 01:47:51,026 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2020-12-23 01:47:51,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:51,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882381772] [2020-12-23 01:47:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-12-23 01:47:51,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882381772] [2020-12-23 01:47:51,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:51,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:51,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761810217] [2020-12-23 01:47:51,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:51,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:51,175 INFO L87 Difference]: Start difference. First operand 3931 states and 6177 transitions. Second operand 4 states. [2020-12-23 01:47:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:52,232 INFO L93 Difference]: Finished difference Result 8465 states and 13150 transitions. [2020-12-23 01:47:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:52,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-12-23 01:47:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:52,247 INFO L225 Difference]: With dead ends: 8465 [2020-12-23 01:47:52,247 INFO L226 Difference]: Without dead ends: 4555 [2020-12-23 01:47:52,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2020-12-23 01:47:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 3811. [2020-12-23 01:47:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2020-12-23 01:47:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 5949 transitions. [2020-12-23 01:47:52,407 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 5949 transitions. Word has length 179 [2020-12-23 01:47:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:52,408 INFO L481 AbstractCegarLoop]: Abstraction has 3811 states and 5949 transitions. [2020-12-23 01:47:52,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 5949 transitions. [2020-12-23 01:47:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:47:52,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:52,419 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:52,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-23 01:47:52,419 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2020-12-23 01:47:52,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:52,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930879753] [2020-12-23 01:47:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-12-23 01:47:52,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930879753] [2020-12-23 01:47:52,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:52,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:47:52,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044026112] [2020-12-23 01:47:52,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:47:52,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:52,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:47:52,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:52,627 INFO L87 Difference]: Start difference. First operand 3811 states and 5949 transitions. Second operand 5 states. [2020-12-23 01:47:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:53,688 INFO L93 Difference]: Finished difference Result 9115 states and 14237 transitions. [2020-12-23 01:47:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:53,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2020-12-23 01:47:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:53,701 INFO L225 Difference]: With dead ends: 9115 [2020-12-23 01:47:53,701 INFO L226 Difference]: Without dead ends: 5325 [2020-12-23 01:47:53,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:47:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2020-12-23 01:47:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4285. [2020-12-23 01:47:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2020-12-23 01:47:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6807 transitions. [2020-12-23 01:47:53,859 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6807 transitions. Word has length 179 [2020-12-23 01:47:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:53,860 INFO L481 AbstractCegarLoop]: Abstraction has 4285 states and 6807 transitions. [2020-12-23 01:47:53,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:47:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6807 transitions. [2020-12-23 01:47:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:47:53,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:53,868 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:53,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-23 01:47:53,868 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2020-12-23 01:47:53,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:53,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803564570] [2020-12-23 01:47:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-23 01:47:54,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803564570] [2020-12-23 01:47:54,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:54,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:54,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337565618] [2020-12-23 01:47:54,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:54,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:54,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:54,042 INFO L87 Difference]: Start difference. First operand 4285 states and 6807 transitions. Second operand 4 states. [2020-12-23 01:47:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:55,001 INFO L93 Difference]: Finished difference Result 7439 states and 11734 transitions. [2020-12-23 01:47:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:55,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-12-23 01:47:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:55,015 INFO L225 Difference]: With dead ends: 7439 [2020-12-23 01:47:55,015 INFO L226 Difference]: Without dead ends: 5243 [2020-12-23 01:47:55,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2020-12-23 01:47:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4405. [2020-12-23 01:47:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4405 states. [2020-12-23 01:47:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6977 transitions. [2020-12-23 01:47:55,220 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6977 transitions. Word has length 179 [2020-12-23 01:47:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:55,220 INFO L481 AbstractCegarLoop]: Abstraction has 4405 states and 6977 transitions. [2020-12-23 01:47:55,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6977 transitions. [2020-12-23 01:47:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 01:47:55,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:55,229 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:55,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-23 01:47:55,229 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:55,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2020-12-23 01:47:55,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:55,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668613756] [2020-12-23 01:47:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-23 01:47:55,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668613756] [2020-12-23 01:47:55,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:55,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:55,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146543779] [2020-12-23 01:47:55,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:55,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:55,329 INFO L87 Difference]: Start difference. First operand 4405 states and 6977 transitions. Second operand 4 states. [2020-12-23 01:47:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:56,286 INFO L93 Difference]: Finished difference Result 7499 states and 11809 transitions. [2020-12-23 01:47:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:56,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-12-23 01:47:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:56,299 INFO L225 Difference]: With dead ends: 7499 [2020-12-23 01:47:56,299 INFO L226 Difference]: Without dead ends: 5243 [2020-12-23 01:47:56,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2020-12-23 01:47:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4415. [2020-12-23 01:47:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4415 states. [2020-12-23 01:47:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 6987 transitions. [2020-12-23 01:47:56,507 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 6987 transitions. Word has length 180 [2020-12-23 01:47:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:56,507 INFO L481 AbstractCegarLoop]: Abstraction has 4415 states and 6987 transitions. [2020-12-23 01:47:56,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 6987 transitions. [2020-12-23 01:47:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 01:47:56,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:56,515 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:56,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-23 01:47:56,516 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:56,516 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2020-12-23 01:47:56,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:56,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760804647] [2020-12-23 01:47:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-12-23 01:47:56,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760804647] [2020-12-23 01:47:56,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:56,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:47:56,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315150505] [2020-12-23 01:47:56,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:47:56,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:47:56,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:56,682 INFO L87 Difference]: Start difference. First operand 4415 states and 6987 transitions. Second operand 5 states. [2020-12-23 01:47:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:57,782 INFO L93 Difference]: Finished difference Result 9987 states and 15767 transitions. [2020-12-23 01:47:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:57,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-12-23 01:47:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:57,793 INFO L225 Difference]: With dead ends: 9987 [2020-12-23 01:47:57,793 INFO L226 Difference]: Without dead ends: 5593 [2020-12-23 01:47:57,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:47:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2020-12-23 01:47:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 4283. [2020-12-23 01:47:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2020-12-23 01:47:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 6807 transitions. [2020-12-23 01:47:57,977 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 6807 transitions. Word has length 180 [2020-12-23 01:47:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:57,977 INFO L481 AbstractCegarLoop]: Abstraction has 4283 states and 6807 transitions. [2020-12-23 01:47:57,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:47:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 6807 transitions. [2020-12-23 01:47:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-23 01:47:57,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:57,987 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:57,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-23 01:47:57,987 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2020-12-23 01:47:57,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:57,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154698034] [2020-12-23 01:47:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-23 01:47:58,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154698034] [2020-12-23 01:47:58,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:58,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:58,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400968764] [2020-12-23 01:47:58,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:58,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:58,104 INFO L87 Difference]: Start difference. First operand 4283 states and 6807 transitions. Second operand 4 states. [2020-12-23 01:47:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:59,034 INFO L93 Difference]: Finished difference Result 7264 states and 11471 transitions. [2020-12-23 01:47:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:59,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-12-23 01:47:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:59,041 INFO L225 Difference]: With dead ends: 7264 [2020-12-23 01:47:59,041 INFO L226 Difference]: Without dead ends: 5069 [2020-12-23 01:47:59,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2020-12-23 01:47:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 4293. [2020-12-23 01:47:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4293 states. [2020-12-23 01:47:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 6817 transitions. [2020-12-23 01:47:59,223 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 6817 transitions. Word has length 181 [2020-12-23 01:47:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:59,223 INFO L481 AbstractCegarLoop]: Abstraction has 4293 states and 6817 transitions. [2020-12-23 01:47:59,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 6817 transitions. [2020-12-23 01:47:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 01:47:59,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:59,232 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:59,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-23 01:47:59,232 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2020-12-23 01:47:59,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:59,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834967201] [2020-12-23 01:47:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-23 01:47:59,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834967201] [2020-12-23 01:47:59,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:59,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:59,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266660898] [2020-12-23 01:47:59,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:59,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:59,337 INFO L87 Difference]: Start difference. First operand 4293 states and 6817 transitions. Second operand 4 states. [2020-12-23 01:48:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:00,270 INFO L93 Difference]: Finished difference Result 7219 states and 11406 transitions. [2020-12-23 01:48:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:00,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2020-12-23 01:48:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:00,276 INFO L225 Difference]: With dead ends: 7219 [2020-12-23 01:48:00,276 INFO L226 Difference]: Without dead ends: 5019 [2020-12-23 01:48:00,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2020-12-23 01:48:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4303. [2020-12-23 01:48:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6827 transitions. [2020-12-23 01:48:00,456 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6827 transitions. Word has length 182 [2020-12-23 01:48:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:00,457 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6827 transitions. [2020-12-23 01:48:00,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6827 transitions. [2020-12-23 01:48:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 01:48:00,465 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:00,465 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:00,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-23 01:48:00,466 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2020-12-23 01:48:00,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:00,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230967457] [2020-12-23 01:48:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:00,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230967457] [2020-12-23 01:48:00,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:00,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:00,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701625622] [2020-12-23 01:48:00,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:00,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:00,574 INFO L87 Difference]: Start difference. First operand 4303 states and 6827 transitions. Second operand 4 states. [2020-12-23 01:48:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:01,452 INFO L93 Difference]: Finished difference Result 8933 states and 14098 transitions. [2020-12-23 01:48:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:01,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2020-12-23 01:48:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:01,458 INFO L225 Difference]: With dead ends: 8933 [2020-12-23 01:48:01,458 INFO L226 Difference]: Without dead ends: 4651 [2020-12-23 01:48:01,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-12-23 01:48:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2020-12-23 01:48:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6815 transitions. [2020-12-23 01:48:01,624 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6815 transitions. Word has length 184 [2020-12-23 01:48:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:01,625 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6815 transitions. [2020-12-23 01:48:01,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6815 transitions. [2020-12-23 01:48:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 01:48:01,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:01,633 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:01,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-23 01:48:01,633 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2020-12-23 01:48:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:01,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820867211] [2020-12-23 01:48:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:01,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820867211] [2020-12-23 01:48:01,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:01,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:01,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004087051] [2020-12-23 01:48:01,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:01,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:01,738 INFO L87 Difference]: Start difference. First operand 4303 states and 6815 transitions. Second operand 4 states. [2020-12-23 01:48:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:02,556 INFO L93 Difference]: Finished difference Result 6856 states and 10757 transitions. [2020-12-23 01:48:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:02,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2020-12-23 01:48:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:02,561 INFO L225 Difference]: With dead ends: 6856 [2020-12-23 01:48:02,561 INFO L226 Difference]: Without dead ends: 4651 [2020-12-23 01:48:02,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-12-23 01:48:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2020-12-23 01:48:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6803 transitions. [2020-12-23 01:48:02,695 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6803 transitions. Word has length 185 [2020-12-23 01:48:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:02,695 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6803 transitions. [2020-12-23 01:48:02,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6803 transitions. [2020-12-23 01:48:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 01:48:02,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:02,703 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:02,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-23 01:48:02,703 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2020-12-23 01:48:02,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:02,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601487161] [2020-12-23 01:48:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:02,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601487161] [2020-12-23 01:48:02,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:02,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:02,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283389728] [2020-12-23 01:48:02,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:02,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:02,818 INFO L87 Difference]: Start difference. First operand 4303 states and 6803 transitions. Second operand 4 states. [2020-12-23 01:48:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:03,595 INFO L93 Difference]: Finished difference Result 6856 states and 10739 transitions. [2020-12-23 01:48:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:03,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-12-23 01:48:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:03,602 INFO L225 Difference]: With dead ends: 6856 [2020-12-23 01:48:03,602 INFO L226 Difference]: Without dead ends: 4651 [2020-12-23 01:48:03,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-12-23 01:48:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2020-12-23 01:48:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6791 transitions. [2020-12-23 01:48:03,752 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6791 transitions. Word has length 186 [2020-12-23 01:48:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:03,752 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6791 transitions. [2020-12-23 01:48:03,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6791 transitions. [2020-12-23 01:48:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-23 01:48:03,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:03,758 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:03,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-12-23 01:48:03,759 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2020-12-23 01:48:03,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:03,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166512093] [2020-12-23 01:48:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:03,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166512093] [2020-12-23 01:48:03,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:03,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:03,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847368380] [2020-12-23 01:48:03,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:03,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:03,869 INFO L87 Difference]: Start difference. First operand 4303 states and 6791 transitions. Second operand 4 states. [2020-12-23 01:48:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:04,648 INFO L93 Difference]: Finished difference Result 6856 states and 10721 transitions. [2020-12-23 01:48:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:04,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2020-12-23 01:48:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:04,654 INFO L225 Difference]: With dead ends: 6856 [2020-12-23 01:48:04,655 INFO L226 Difference]: Without dead ends: 4651 [2020-12-23 01:48:04,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-12-23 01:48:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2020-12-23 01:48:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6779 transitions. [2020-12-23 01:48:04,811 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6779 transitions. Word has length 187 [2020-12-23 01:48:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:04,811 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6779 transitions. [2020-12-23 01:48:04,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6779 transitions. [2020-12-23 01:48:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-23 01:48:04,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:04,819 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:04,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-12-23 01:48:04,819 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2020-12-23 01:48:04,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:04,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687659713] [2020-12-23 01:48:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:04,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687659713] [2020-12-23 01:48:04,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:04,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:04,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505043452] [2020-12-23 01:48:04,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:04,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:04,928 INFO L87 Difference]: Start difference. First operand 4303 states and 6779 transitions. Second operand 4 states. [2020-12-23 01:48:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:05,681 INFO L93 Difference]: Finished difference Result 6796 states and 10631 transitions. [2020-12-23 01:48:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:05,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2020-12-23 01:48:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:05,687 INFO L225 Difference]: With dead ends: 6796 [2020-12-23 01:48:05,687 INFO L226 Difference]: Without dead ends: 4591 [2020-12-23 01:48:05,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-12-23 01:48:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4303. [2020-12-23 01:48:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2020-12-23 01:48:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6767 transitions. [2020-12-23 01:48:05,794 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6767 transitions. Word has length 188 [2020-12-23 01:48:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:05,794 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6767 transitions. [2020-12-23 01:48:05,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6767 transitions. [2020-12-23 01:48:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-23 01:48:05,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:05,798 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:05,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-12-23 01:48:05,798 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2020-12-23 01:48:05,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:05,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507181518] [2020-12-23 01:48:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-12-23 01:48:05,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507181518] [2020-12-23 01:48:05,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:05,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:05,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042413545] [2020-12-23 01:48:05,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:05,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:05,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:05,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:05,989 INFO L87 Difference]: Start difference. First operand 4303 states and 6767 transitions. Second operand 4 states. [2020-12-23 01:48:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:07,119 INFO L93 Difference]: Finished difference Result 9301 states and 14604 transitions. [2020-12-23 01:48:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:07,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-12-23 01:48:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:07,128 INFO L225 Difference]: With dead ends: 9301 [2020-12-23 01:48:07,128 INFO L226 Difference]: Without dead ends: 5019 [2020-12-23 01:48:07,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2020-12-23 01:48:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4313. [2020-12-23 01:48:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2020-12-23 01:48:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6777 transitions. [2020-12-23 01:48:07,310 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6777 transitions. Word has length 192 [2020-12-23 01:48:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:07,311 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6777 transitions. [2020-12-23 01:48:07,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6777 transitions. [2020-12-23 01:48:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-23 01:48:07,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:07,316 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:07,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-12-23 01:48:07,317 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:07,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2020-12-23 01:48:07,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:07,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604863603] [2020-12-23 01:48:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:07,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604863603] [2020-12-23 01:48:07,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:07,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:07,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245933027] [2020-12-23 01:48:07,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:07,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:07,458 INFO L87 Difference]: Start difference. First operand 4313 states and 6777 transitions. Second operand 4 states. [2020-12-23 01:48:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:08,225 INFO L93 Difference]: Finished difference Result 8893 states and 13926 transitions. [2020-12-23 01:48:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:08,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-12-23 01:48:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:08,232 INFO L225 Difference]: With dead ends: 8893 [2020-12-23 01:48:08,232 INFO L226 Difference]: Without dead ends: 4601 [2020-12-23 01:48:08,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-12-23 01:48:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4313. [2020-12-23 01:48:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2020-12-23 01:48:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6765 transitions. [2020-12-23 01:48:08,348 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6765 transitions. Word has length 192 [2020-12-23 01:48:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:08,348 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6765 transitions. [2020-12-23 01:48:08,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6765 transitions. [2020-12-23 01:48:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-23 01:48:08,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:08,353 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:08,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-12-23 01:48:08,354 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2020-12-23 01:48:08,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:08,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881460975] [2020-12-23 01:48:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:08,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881460975] [2020-12-23 01:48:08,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:08,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:08,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785396127] [2020-12-23 01:48:08,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:08,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:08,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:08,472 INFO L87 Difference]: Start difference. First operand 4313 states and 6765 transitions. Second operand 4 states. [2020-12-23 01:48:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:09,342 INFO L93 Difference]: Finished difference Result 8893 states and 13902 transitions. [2020-12-23 01:48:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:09,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-12-23 01:48:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:09,348 INFO L225 Difference]: With dead ends: 8893 [2020-12-23 01:48:09,348 INFO L226 Difference]: Without dead ends: 4601 [2020-12-23 01:48:09,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-12-23 01:48:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4313. [2020-12-23 01:48:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2020-12-23 01:48:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6753 transitions. [2020-12-23 01:48:09,567 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6753 transitions. Word has length 192 [2020-12-23 01:48:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:09,568 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6753 transitions. [2020-12-23 01:48:09,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6753 transitions. [2020-12-23 01:48:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:09,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:09,574 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:09,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-12-23 01:48:09,574 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 323502751, now seen corresponding path program 1 times [2020-12-23 01:48:09,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:09,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492408903] [2020-12-23 01:48:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-12-23 01:48:09,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492408903] [2020-12-23 01:48:09,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:09,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:09,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408295869] [2020-12-23 01:48:09,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:09,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:09,701 INFO L87 Difference]: Start difference. First operand 4313 states and 6753 transitions. Second operand 4 states. [2020-12-23 01:48:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:10,671 INFO L93 Difference]: Finished difference Result 9291 states and 14536 transitions. [2020-12-23 01:48:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:10,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-12-23 01:48:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:10,678 INFO L225 Difference]: With dead ends: 9291 [2020-12-23 01:48:10,678 INFO L226 Difference]: Without dead ends: 4999 [2020-12-23 01:48:10,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2020-12-23 01:48:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4323. [2020-12-23 01:48:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4323 states. [2020-12-23 01:48:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 6763 transitions. [2020-12-23 01:48:10,803 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 6763 transitions. Word has length 193 [2020-12-23 01:48:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:10,804 INFO L481 AbstractCegarLoop]: Abstraction has 4323 states and 6763 transitions. [2020-12-23 01:48:10,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 6763 transitions. [2020-12-23 01:48:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:10,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:10,808 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:10,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-12-23 01:48:10,808 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2020-12-23 01:48:10,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:10,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572400039] [2020-12-23 01:48:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-12-23 01:48:10,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572400039] [2020-12-23 01:48:10,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:10,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:10,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831440946] [2020-12-23 01:48:10,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:10,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:10,956 INFO L87 Difference]: Start difference. First operand 4323 states and 6763 transitions. Second operand 4 states. [2020-12-23 01:48:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:11,892 INFO L93 Difference]: Finished difference Result 7630 states and 11871 transitions. [2020-12-23 01:48:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:11,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-12-23 01:48:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:11,898 INFO L225 Difference]: With dead ends: 7630 [2020-12-23 01:48:11,899 INFO L226 Difference]: Without dead ends: 5415 [2020-12-23 01:48:11,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2020-12-23 01:48:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 4467. [2020-12-23 01:48:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2020-12-23 01:48:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 6967 transitions. [2020-12-23 01:48:12,023 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 6967 transitions. Word has length 193 [2020-12-23 01:48:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:12,023 INFO L481 AbstractCegarLoop]: Abstraction has 4467 states and 6967 transitions. [2020-12-23 01:48:12,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 6967 transitions. [2020-12-23 01:48:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:12,027 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:12,027 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:12,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-12-23 01:48:12,028 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2020-12-23 01:48:12,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:12,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727560013] [2020-12-23 01:48:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:12,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:12,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:12,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:48:12,348 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:48:12,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-12-23 01:48:12,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:48:12 BoogieIcfgContainer [2020-12-23 01:48:12,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:48:12,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:48:12,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:48:12,652 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:48:12,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00" (3/4) ... [2020-12-23 01:48:12,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:48:12,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:48:12,658 INFO L168 Benchmark]: Toolchain (without parser) took 75135.02 ms. Allocated memory was 151.0 MB in the beginning and 744.5 MB in the end (delta: 593.5 MB). Free memory was 123.7 MB in the beginning and 679.5 MB in the end (delta: -555.8 MB). Peak memory consumption was 39.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,659 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:12,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1068.49 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 122.9 MB in the end (delta: 574.5 kB). Peak memory consumption was 28.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.16 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 118.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,660 INFO L168 Benchmark]: Boogie Preprocessor took 83.18 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 111.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,663 INFO L168 Benchmark]: RCFGBuilder took 1620.17 ms. Allocated memory is still 151.0 MB. Free memory was 111.4 MB in the beginning and 91.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,663 INFO L168 Benchmark]: TraceAbstraction took 72181.90 ms. Allocated memory was 151.0 MB in the beginning and 744.5 MB in the end (delta: 593.5 MB). Free memory was 90.5 MB in the beginning and 680.0 MB in the end (delta: -589.5 MB). Peak memory consumption was 346.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:12,665 INFO L168 Benchmark]: Witness Printer took 5.53 ms. Allocated memory is still 744.5 MB. Free memory was 680.0 MB in the beginning and 679.5 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:12,669 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1068.49 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 122.9 MB in the end (delta: 574.5 kB). Peak memory consumption was 28.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 164.16 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 118.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.18 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 111.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1620.17 ms. Allocated memory is still 151.0 MB. Free memory was 111.4 MB in the beginning and 91.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 72181.90 ms. Allocated memory was 151.0 MB in the beginning and 744.5 MB in the end (delta: 593.5 MB). Free memory was 90.5 MB in the beginning and 680.0 MB in the end (delta: -589.5 MB). Peak memory consumption was 346.3 MB. Max. memory is 8.0 GB. * Witness Printer took 5.53 ms. Allocated memory is still 744.5 MB. Free memory was 680.0 MB in the beginning and 679.5 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1728]: 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)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1572] EXPR s->session [L1572] EXPR s->s3 [L1572] EXPR (s->s3)->tmp.new_cipher [L1572] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1573] COND FALSE !(! tmp___9) [L1579] ret = __VERIFIER_nondet_int() [L1580] COND TRUE blastFlag == 2 [L1581] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1593] COND FALSE !(ret <= 0) [L1598] s->state = 8672 [L1599] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1600] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1609] ret = __VERIFIER_nondet_int() [L1610] COND TRUE blastFlag == 3 [L1611] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8448 [L1621] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1621] COND TRUE s->hit [L1622] EXPR s->s3 [L1622] (s->s3)->tmp.next_state = 8640 [L1626] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 TRUE s->state == 8640 [L1552] ret = __VERIFIER_nondet_int() [L1553] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L1728] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 71.8s, OverallIterations: 68, TraceHistogramMax: 7, AutomataDifference: 53.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14505 SDtfs, 5635 SDslu, 22825 SDs, 0 SdLazy, 15457 SolverSat, 950 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 296 SyntacticMatches, 33 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4467occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 67 MinimizatonAttempts, 15479 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 7682 NumberOfCodeBlocks, 7682 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7421 ConstructedInterpolants, 80 QuantifiedInterpolants, 4203943 SizeOfPredicates, 13 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 68 InterpolantComputations, 66 PerfectInterpolantSequences, 7636/7940 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...