/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.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:47:43,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:47:43,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:47:43,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:47:43,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:47:43,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:47:43,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:47:43,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:47:43,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:47:43,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:47:43,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:47:43,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:47:43,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:47:43,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:47:43,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:47:43,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:47:43,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:47:43,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:47:43,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:47:43,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:47:43,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:47:43,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:47:43,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:47:43,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:47:43,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:47:43,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:47:43,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:47:43,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:47:43,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:47:43,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:47:43,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:47:43,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:47:43,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:47:43,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:47:43,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:47:43,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:47:43,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:47:43,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:47:43,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:47:43,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:47:43,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:47:43,428 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:47:43,496 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:47:43,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:47:43,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:47:43,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:47:43,502 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:47:43,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:47:43,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:47:43,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:47:43,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:47:43,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:47:43,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:47:43,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:47:43,505 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:47:43,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:47:43,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:47:43,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:47:43,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:47:43,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:47:43,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:47:43,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:47:43,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:47:43,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:47:43,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:47:43,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:47:43,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:47:43,508 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:47:43,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:47:43,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:47:44,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:47:44,004 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:47:44,005 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:47:44,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2020-12-23 01:47:44,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01aa21356/d87b2975a5ba4f169a38be913c0a151e/FLAGefa9bb999 [2020-12-23 01:47:44,945 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:47:44,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2020-12-23 01:47:44,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01aa21356/d87b2975a5ba4f169a38be913c0a151e/FLAGefa9bb999 [2020-12-23 01:47:45,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01aa21356/d87b2975a5ba4f169a38be913c0a151e [2020-12-23 01:47:45,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:47:45,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:47:45,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:47:45,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:47:45,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:47:45,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:47:45" (1/1) ... [2020-12-23 01:47:45,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d6fe06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:45, skipping insertion in model container [2020-12-23 01:47:45,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:47:45" (1/1) ... [2020-12-23 01:47:45,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:47:45,261 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: 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: 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[#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:47:45,802 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.09.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:47:45,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:47:45,857 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: 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: 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[#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:47:46,188 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.09.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:47:46,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:47:46,231 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:47:46,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46 WrapperNode [2020-12-23 01:47:46,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:47:46,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:47:46,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:47:46,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:47:46,242 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:47:46" (1/1) ... [2020-12-23 01:47:46,269 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:47:46" (1/1) ... [2020-12-23 01:47:46,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:47:46,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:47:46,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:47:46,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:47:46,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (1/1) ... [2020-12-23 01:47:46,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:47:46,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:47:46,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:47:46,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:47:46,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (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:47:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:47:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:47:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:47:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:47:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:47:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:47:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:47:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:47:46,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:47:46,883 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:47:47,839 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:47:47,840 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:47:47,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:47:47,852 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:47:47,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:47 BoogieIcfgContainer [2020-12-23 01:47:47,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:47:47,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:47:47,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:47:47,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:47:47,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:47:45" (1/3) ... [2020-12-23 01:47:47,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331d5fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:47, skipping insertion in model container [2020-12-23 01:47:47,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:47:46" (2/3) ... [2020-12-23 01:47:47,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331d5fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:47, skipping insertion in model container [2020-12-23 01:47:47,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:47" (3/3) ... [2020-12-23 01:47:47,865 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2020-12-23 01:47:47,873 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:47:47,880 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:47:47,901 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:47:47,934 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:47:47,934 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:47:47,934 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:47:47,934 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:47:47,934 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:47:47,935 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:47:47,935 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:47:47,935 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:47:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-12-23 01:47:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 01:47:47,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:47,968 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:47,969 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2020-12-23 01:47:47,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:47,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799568385] [2020-12-23 01:47:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:48,488 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:48,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799568385] [2020-12-23 01:47:48,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:48,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:48,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288273275] [2020-12-23 01:47:48,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:48,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:48,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:48,527 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2020-12-23 01:47:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:49,309 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2020-12-23 01:47:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:49,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-23 01:47:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:49,331 INFO L225 Difference]: With dead ends: 323 [2020-12-23 01:47:49,332 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 01:47:49,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 01:47:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-12-23 01:47:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2020-12-23 01:47:49,424 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2020-12-23 01:47:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:49,425 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2020-12-23 01:47:49,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2020-12-23 01:47:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 01:47:49,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:49,430 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:49,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:47:49,432 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2020-12-23 01:47:49,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:49,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416334316] [2020-12-23 01:47:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:49,700 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:49,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416334316] [2020-12-23 01:47:49,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:49,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:49,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605538143] [2020-12-23 01:47:49,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:49,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:49,710 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2020-12-23 01:47:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:50,218 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2020-12-23 01:47:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:50,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-23 01:47:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:50,222 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:47:50,222 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 01:47:50,226 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:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 01:47:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-12-23 01:47:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2020-12-23 01:47:50,255 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2020-12-23 01:47:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:50,255 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2020-12-23 01:47:50,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2020-12-23 01:47:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:50,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:50,258 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:50,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:47:50,260 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2020-12-23 01:47:50,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:50,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673564393] [2020-12-23 01:47:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:50,421 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:50,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673564393] [2020-12-23 01:47:50,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:50,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:50,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111423399] [2020-12-23 01:47:50,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:50,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:50,425 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2020-12-23 01:47:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:50,904 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2020-12-23 01:47:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:50,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:50,907 INFO L225 Difference]: With dead ends: 289 [2020-12-23 01:47:50,907 INFO L226 Difference]: Without dead ends: 162 [2020-12-23 01:47:50,908 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:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-23 01:47:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2020-12-23 01:47:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2020-12-23 01:47:50,920 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2020-12-23 01:47:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:50,920 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2020-12-23 01:47:50,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2020-12-23 01:47:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:50,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:50,923 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:50,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:47:50,923 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2020-12-23 01:47:50,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:50,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547385503] [2020-12-23 01:47:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:51,004 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:51,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547385503] [2020-12-23 01:47:51,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:51,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:51,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798122496] [2020-12-23 01:47:51,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:51,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:51,007 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2020-12-23 01:47:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:51,459 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2020-12-23 01:47:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:51,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:51,463 INFO L225 Difference]: With dead ends: 287 [2020-12-23 01:47:51,463 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:47:51,465 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:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:47:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-12-23 01:47:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2020-12-23 01:47:51,481 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2020-12-23 01:47:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:51,482 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2020-12-23 01:47:51,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2020-12-23 01:47:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:51,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:51,489 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:51,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:47:51,490 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2020-12-23 01:47:51,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:51,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461648857] [2020-12-23 01:47:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:51,654 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:51,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461648857] [2020-12-23 01:47:51,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:51,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:51,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727418336] [2020-12-23 01:47:51,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:51,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:51,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:51,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:51,658 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2020-12-23 01:47:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:52,060 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2020-12-23 01:47:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:52,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:52,063 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:52,063 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:52,064 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:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2020-12-23 01:47:52,073 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2020-12-23 01:47:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:52,074 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2020-12-23 01:47:52,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2020-12-23 01:47:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 01:47:52,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:52,076 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:52,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:47:52,077 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2020-12-23 01:47:52,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:52,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339002084] [2020-12-23 01:47:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:52,164 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:52,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339002084] [2020-12-23 01:47:52,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:52,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:52,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815711569] [2020-12-23 01:47:52,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:52,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:52,168 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2020-12-23 01:47:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:52,577 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2020-12-23 01:47:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:52,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 01:47:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:52,579 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:52,579 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:52,580 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:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2020-12-23 01:47:52,588 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2020-12-23 01:47:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:52,588 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2020-12-23 01:47:52,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2020-12-23 01:47:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:47:52,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:52,590 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:52,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:47:52,591 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2020-12-23 01:47:52,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:52,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300498198] [2020-12-23 01:47:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:52,667 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:52,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300498198] [2020-12-23 01:47:52,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:52,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:52,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697076878] [2020-12-23 01:47:52,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:52,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:52,671 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2020-12-23 01:47:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:53,046 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2020-12-23 01:47:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:53,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-23 01:47:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:53,048 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:53,048 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:53,049 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:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2020-12-23 01:47:53,055 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2020-12-23 01:47:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:53,056 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2020-12-23 01:47:53,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-12-23 01:47:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 01:47:53,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:53,058 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:53,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:47:53,058 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2020-12-23 01:47:53,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:53,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999028803] [2020-12-23 01:47:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:53,125 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:53,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999028803] [2020-12-23 01:47:53,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:53,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:53,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584953760] [2020-12-23 01:47:53,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:53,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:53,128 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2020-12-23 01:47:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:53,506 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2020-12-23 01:47:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:53,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 01:47:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:53,510 INFO L225 Difference]: With dead ends: 286 [2020-12-23 01:47:53,510 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 01:47:53,511 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:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 01:47:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-12-23 01:47:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2020-12-23 01:47:53,517 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2020-12-23 01:47:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:53,518 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2020-12-23 01:47:53,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2020-12-23 01:47:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 01:47:53,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:53,519 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:53,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:47:53,520 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2020-12-23 01:47:53,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:53,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440859723] [2020-12-23 01:47:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:53,581 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:53,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440859723] [2020-12-23 01:47:53,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:53,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:53,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719449351] [2020-12-23 01:47:53,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:53,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:53,585 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2020-12-23 01:47:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:53,934 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2020-12-23 01:47:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:53,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 01:47:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:53,937 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:47:53,937 INFO L226 Difference]: Without dead ends: 149 [2020-12-23 01:47:53,938 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:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-12-23 01:47:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2020-12-23 01:47:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 01:47:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2020-12-23 01:47:53,944 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2020-12-23 01:47:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:53,944 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2020-12-23 01:47:53,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2020-12-23 01:47:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 01:47:53,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:53,946 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:53,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:47:53,946 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2020-12-23 01:47:53,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:53,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305811534] [2020-12-23 01:47:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:54,016 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:54,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305811534] [2020-12-23 01:47:54,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:54,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:54,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192567486] [2020-12-23 01:47:54,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:54,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:54,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:54,019 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2020-12-23 01:47:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:54,440 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2020-12-23 01:47:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:54,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 01:47:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:54,443 INFO L225 Difference]: With dead ends: 316 [2020-12-23 01:47:54,443 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 01:47:54,444 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:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 01:47:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-12-23 01:47:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2020-12-23 01:47:54,452 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2020-12-23 01:47:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:54,453 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2020-12-23 01:47:54,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2020-12-23 01:47:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 01:47:54,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:54,455 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:54,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:47:54,455 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2020-12-23 01:47:54,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:54,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909618016] [2020-12-23 01:47:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:54,528 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:54,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909618016] [2020-12-23 01:47:54,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:54,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:54,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547336390] [2020-12-23 01:47:54,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:54,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:54,531 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2020-12-23 01:47:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:54,934 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2020-12-23 01:47:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:54,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 01:47:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:54,936 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:47:54,936 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 01:47:54,937 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:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 01:47:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-12-23 01:47:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2020-12-23 01:47:54,952 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2020-12-23 01:47:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:54,952 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2020-12-23 01:47:54,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2020-12-23 01:47:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:54,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:54,954 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:54,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:47:54,954 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:54,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2020-12-23 01:47:54,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:54,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451641425] [2020-12-23 01:47:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:55,066 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:55,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451641425] [2020-12-23 01:47:55,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:55,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:55,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716198457] [2020-12-23 01:47:55,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:55,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:55,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:55,071 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2020-12-23 01:47:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:55,517 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2020-12-23 01:47:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:55,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:55,520 INFO L225 Difference]: With dead ends: 337 [2020-12-23 01:47:55,520 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 01:47:55,521 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,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 01:47:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2020-12-23 01:47:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2020-12-23 01:47:55,529 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2020-12-23 01:47:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:55,529 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2020-12-23 01:47:55,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2020-12-23 01:47:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:55,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:55,531 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:55,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:47:55,531 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2020-12-23 01:47:55,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:55,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192506279] [2020-12-23 01:47:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:55,634 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:55,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192506279] [2020-12-23 01:47:55,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:55,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:55,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388786075] [2020-12-23 01:47:55,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:55,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:55,637 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2020-12-23 01:47:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:56,012 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2020-12-23 01:47:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:56,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:56,014 INFO L225 Difference]: With dead ends: 335 [2020-12-23 01:47:56,014 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 01:47:56,016 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,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 01:47:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2020-12-23 01:47:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2020-12-23 01:47:56,022 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2020-12-23 01:47:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:56,022 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2020-12-23 01:47:56,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2020-12-23 01:47:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:56,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:56,024 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:56,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:47:56,025 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2020-12-23 01:47:56,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:56,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043187652] [2020-12-23 01:47:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:56,102 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:56,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043187652] [2020-12-23 01:47:56,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:56,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:56,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442807159] [2020-12-23 01:47:56,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:56,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:56,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:56,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:56,105 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2020-12-23 01:47:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:56,508 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2020-12-23 01:47:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:56,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:56,511 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:56,511 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:56,512 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,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2020-12-23 01:47:56,519 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2020-12-23 01:47:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:56,520 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2020-12-23 01:47:56,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2020-12-23 01:47:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:47:56,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:56,521 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:56,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:47:56,522 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2020-12-23 01:47:56,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:56,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716239414] [2020-12-23 01:47:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:56,583 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:56,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716239414] [2020-12-23 01:47:56,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:56,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:56,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695335904] [2020-12-23 01:47:56,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:56,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:56,586 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2020-12-23 01:47:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:56,968 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2020-12-23 01:47:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:56,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 01:47:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:56,970 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:56,970 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:56,971 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,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2020-12-23 01:47:56,978 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2020-12-23 01:47:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:56,978 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-12-23 01:47:56,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2020-12-23 01:47:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:47:56,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:56,979 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:56,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:47:56,980 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2020-12-23 01:47:56,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:56,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976153273] [2020-12-23 01:47:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:57,039 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:57,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976153273] [2020-12-23 01:47:57,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:57,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:57,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682626295] [2020-12-23 01:47:57,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:57,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:57,042 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2020-12-23 01:47:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:57,494 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2020-12-23 01:47:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:57,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 01:47:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:57,497 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:57,497 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:57,498 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:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2020-12-23 01:47:57,504 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2020-12-23 01:47:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:57,504 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-12-23 01:47:57,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2020-12-23 01:47:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 01:47:57,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:57,506 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:57,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:47:57,506 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2020-12-23 01:47:57,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:57,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977033637] [2020-12-23 01:47:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:57,566 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:57,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977033637] [2020-12-23 01:47:57,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:57,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:57,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297265478] [2020-12-23 01:47:57,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:57,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:57,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:57,570 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2020-12-23 01:47:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:57,987 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2020-12-23 01:47:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:57,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 01:47:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:57,990 INFO L225 Difference]: With dead ends: 334 [2020-12-23 01:47:57,990 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 01:47:57,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 01:47:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-12-23 01:47:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2020-12-23 01:47:57,998 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2020-12-23 01:47:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:57,998 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2020-12-23 01:47:57,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2020-12-23 01:47:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 01:47:57,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:58,000 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:58,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:47:58,000 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2020-12-23 01:47:58,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:58,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020371046] [2020-12-23 01:47:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:58,069 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:58,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020371046] [2020-12-23 01:47:58,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:58,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:58,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718723439] [2020-12-23 01:47:58,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:58,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:58,072 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2020-12-23 01:47:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:58,446 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2020-12-23 01:47:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:58,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-23 01:47:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:58,459 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:47:58,460 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 01:47:58,461 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:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 01:47:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2020-12-23 01:47:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:47:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2020-12-23 01:47:58,467 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2020-12-23 01:47:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:58,467 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2020-12-23 01:47:58,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2020-12-23 01:47:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:47:58,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:58,469 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:58,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:47:58,470 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2020-12-23 01:47:58,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:58,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731598665] [2020-12-23 01:47:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:58,562 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:58,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731598665] [2020-12-23 01:47:58,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:58,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:58,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680415507] [2020-12-23 01:47:58,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:58,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:58,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:58,565 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2020-12-23 01:47:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:59,224 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2020-12-23 01:47:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:59,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:47:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:59,235 INFO L225 Difference]: With dead ends: 424 [2020-12-23 01:47:59,235 INFO L226 Difference]: Without dead ends: 275 [2020-12-23 01:47:59,236 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:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-12-23 01:47:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2020-12-23 01:47:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-23 01:47:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2020-12-23 01:47:59,244 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2020-12-23 01:47:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:59,249 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2020-12-23 01:47:59,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2020-12-23 01:47:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:47:59,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:59,251 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:59,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:47:59,251 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2020-12-23 01:47:59,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:59,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876547046] [2020-12-23 01:47:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:59,366 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:59,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876547046] [2020-12-23 01:47:59,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:59,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:59,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164574253] [2020-12-23 01:47:59,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:59,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:59,369 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2020-12-23 01:47:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:59,902 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2020-12-23 01:47:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:59,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:47:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:59,904 INFO L225 Difference]: With dead ends: 427 [2020-12-23 01:47:59,905 INFO L226 Difference]: Without dead ends: 248 [2020-12-23 01:47:59,906 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:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-12-23 01:47:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2020-12-23 01:47:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-12-23 01:47:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2020-12-23 01:47:59,912 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2020-12-23 01:47:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:59,912 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-12-23 01:47:59,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2020-12-23 01:47:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:47:59,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:59,914 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:59,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:47:59,914 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2020-12-23 01:47:59,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:59,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90987073] [2020-12-23 01:47:59,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:59,991 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:59,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90987073] [2020-12-23 01:47:59,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:59,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:59,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845357798] [2020-12-23 01:47:59,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:59,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:59,994 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2020-12-23 01:48:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:00,570 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2020-12-23 01:48:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:00,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:48:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:00,573 INFO L225 Difference]: With dead ends: 494 [2020-12-23 01:48:00,574 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 01:48:00,575 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:48:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 01:48:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2020-12-23 01:48:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-12-23 01:48:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2020-12-23 01:48:00,587 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2020-12-23 01:48:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:00,588 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2020-12-23 01:48:00,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2020-12-23 01:48:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 01:48:00,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:00,590 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:48:00,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:48:00,590 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2020-12-23 01:48:00,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:00,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471888659] [2020-12-23 01:48:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:00,733 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:48:00,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471888659] [2020-12-23 01:48:00,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:00,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:00,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346913288] [2020-12-23 01:48:00,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:00,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:00,737 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2020-12-23 01:48:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:01,428 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2020-12-23 01:48:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:01,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 01:48:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:01,432 INFO L225 Difference]: With dead ends: 495 [2020-12-23 01:48:01,432 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 01:48:01,433 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:48:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 01:48:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2020-12-23 01:48:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-12-23 01:48:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2020-12-23 01:48:01,443 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2020-12-23 01:48:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:01,443 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2020-12-23 01:48:01,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2020-12-23 01:48:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 01:48:01,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:01,445 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:48:01,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:48:01,446 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2020-12-23 01:48:01,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:01,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159010554] [2020-12-23 01:48:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:01,543 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:48:01,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159010554] [2020-12-23 01:48:01,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:01,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:01,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447428905] [2020-12-23 01:48:01,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:01,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:01,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:01,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:01,546 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2020-12-23 01:48:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:02,085 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2020-12-23 01:48:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:02,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 01:48:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:02,088 INFO L225 Difference]: With dead ends: 499 [2020-12-23 01:48:02,088 INFO L226 Difference]: Without dead ends: 285 [2020-12-23 01:48:02,089 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:48:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-23 01:48:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2020-12-23 01:48:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2020-12-23 01:48:02,098 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2020-12-23 01:48:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:02,098 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2020-12-23 01:48:02,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2020-12-23 01:48:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 01:48:02,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:02,100 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:48:02,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:48:02,100 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2020-12-23 01:48:02,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:02,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215152052] [2020-12-23 01:48:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:02,175 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:48:02,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215152052] [2020-12-23 01:48:02,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:02,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:02,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95960150] [2020-12-23 01:48:02,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:02,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:02,178 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2020-12-23 01:48:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:02,880 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2020-12-23 01:48:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:02,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-12-23 01:48:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:02,883 INFO L225 Difference]: With dead ends: 500 [2020-12-23 01:48:02,883 INFO L226 Difference]: Without dead ends: 285 [2020-12-23 01:48:02,883 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:48:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-23 01:48:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2020-12-23 01:48:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2020-12-23 01:48:02,892 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2020-12-23 01:48:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:02,892 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2020-12-23 01:48:02,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2020-12-23 01:48:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 01:48:02,893 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:02,894 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:48:02,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:48:02,894 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2020-12-23 01:48:02,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:02,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110113608] [2020-12-23 01:48:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:02,974 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:48:02,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110113608] [2020-12-23 01:48:02,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:02,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:02,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812322423] [2020-12-23 01:48:02,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:02,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:02,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:02,977 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2020-12-23 01:48:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:03,442 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2020-12-23 01:48:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:03,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-12-23 01:48:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:03,444 INFO L225 Difference]: With dead ends: 475 [2020-12-23 01:48:03,444 INFO L226 Difference]: Without dead ends: 260 [2020-12-23 01:48:03,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:48:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-12-23 01:48:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2020-12-23 01:48:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2020-12-23 01:48:03,452 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2020-12-23 01:48:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:03,452 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2020-12-23 01:48:03,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2020-12-23 01:48:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:03,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:03,454 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:48:03,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:48:03,454 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2020-12-23 01:48:03,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:03,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656054011] [2020-12-23 01:48:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:03,527 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:48:03,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656054011] [2020-12-23 01:48:03,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:03,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:03,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120458707] [2020-12-23 01:48:03,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:03,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:03,530 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2020-12-23 01:48:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:04,115 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2020-12-23 01:48:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:04,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:48:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:04,118 INFO L225 Difference]: With dead ends: 499 [2020-12-23 01:48:04,118 INFO L226 Difference]: Without dead ends: 284 [2020-12-23 01:48:04,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:48:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-23 01:48:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2020-12-23 01:48:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2020-12-23 01:48:04,128 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2020-12-23 01:48:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:04,128 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2020-12-23 01:48:04,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2020-12-23 01:48:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:04,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:04,130 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:48:04,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:48:04,130 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2020-12-23 01:48:04,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:04,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556904011] [2020-12-23 01:48:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:04,207 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:48:04,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556904011] [2020-12-23 01:48:04,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:04,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:04,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780761102] [2020-12-23 01:48:04,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:04,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:04,209 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2020-12-23 01:48:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:04,724 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2020-12-23 01:48:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:04,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:48:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:04,727 INFO L225 Difference]: With dead ends: 497 [2020-12-23 01:48:04,727 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 01:48:04,728 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:48:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 01:48:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2020-12-23 01:48:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2020-12-23 01:48:04,736 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2020-12-23 01:48:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:04,737 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2020-12-23 01:48:04,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2020-12-23 01:48:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:04,738 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:04,738 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:48:04,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:48:04,739 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2020-12-23 01:48:04,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:04,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345707865] [2020-12-23 01:48:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:04,815 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:48:04,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345707865] [2020-12-23 01:48:04,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:04,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:04,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604295027] [2020-12-23 01:48:04,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:04,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:04,818 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2020-12-23 01:48:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:05,341 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2020-12-23 01:48:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:05,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:48:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:05,345 INFO L225 Difference]: With dead ends: 496 [2020-12-23 01:48:05,345 INFO L226 Difference]: Without dead ends: 281 [2020-12-23 01:48:05,346 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:48:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-23 01:48:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2020-12-23 01:48:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-23 01:48:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2020-12-23 01:48:05,354 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2020-12-23 01:48:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:05,354 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2020-12-23 01:48:05,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2020-12-23 01:48:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:05,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:05,356 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:48:05,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:48:05,356 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2020-12-23 01:48:05,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:05,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353861056] [2020-12-23 01:48:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:05,462 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:48:05,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353861056] [2020-12-23 01:48:05,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:05,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:05,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695292123] [2020-12-23 01:48:05,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:05,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:05,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:05,464 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2020-12-23 01:48:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:06,084 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2020-12-23 01:48:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:48:06,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 01:48:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:06,087 INFO L225 Difference]: With dead ends: 470 [2020-12-23 01:48:06,087 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:48:06,088 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:48:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:48:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2020-12-23 01:48:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2020-12-23 01:48:06,097 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2020-12-23 01:48:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:06,097 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2020-12-23 01:48:06,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2020-12-23 01:48:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:06,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:06,099 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:48:06,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:48:06,099 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2020-12-23 01:48:06,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:06,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359911302] [2020-12-23 01:48:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:06,167 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:48:06,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359911302] [2020-12-23 01:48:06,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:06,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:06,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605197178] [2020-12-23 01:48:06,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:06,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:06,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:06,170 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2020-12-23 01:48:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:06,566 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2020-12-23 01:48:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:06,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:48:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:06,569 INFO L225 Difference]: With dead ends: 512 [2020-12-23 01:48:06,570 INFO L226 Difference]: Without dead ends: 277 [2020-12-23 01:48:06,571 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:48:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-12-23 01:48:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2020-12-23 01:48:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2020-12-23 01:48:06,581 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2020-12-23 01:48:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:06,581 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2020-12-23 01:48:06,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2020-12-23 01:48:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 01:48:06,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:06,583 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:48:06,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:48:06,584 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2020-12-23 01:48:06,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:06,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725703535] [2020-12-23 01:48:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:06,681 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:48:06,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725703535] [2020-12-23 01:48:06,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:06,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:06,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786628684] [2020-12-23 01:48:06,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:06,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:06,683 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2020-12-23 01:48:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:07,116 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2020-12-23 01:48:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:07,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 01:48:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:07,119 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:48:07,119 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:48:07,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:48:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:48:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2020-12-23 01:48:07,130 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2020-12-23 01:48:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:07,131 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2020-12-23 01:48:07,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2020-12-23 01:48:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 01:48:07,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:07,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:48:07,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:48:07,133 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2020-12-23 01:48:07,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:07,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916020141] [2020-12-23 01:48:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:07,206 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:48:07,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916020141] [2020-12-23 01:48:07,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:07,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:07,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249592856] [2020-12-23 01:48:07,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:07,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:07,209 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2020-12-23 01:48:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:07,742 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2020-12-23 01:48:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:07,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 01:48:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:07,746 INFO L225 Difference]: With dead ends: 536 [2020-12-23 01:48:07,746 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:48:07,747 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:48:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:48:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2020-12-23 01:48:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2020-12-23 01:48:07,757 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2020-12-23 01:48:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:07,757 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2020-12-23 01:48:07,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2020-12-23 01:48:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 01:48:07,759 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:07,759 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:48:07,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:48:07,759 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2020-12-23 01:48:07,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:07,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896787207] [2020-12-23 01:48:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:07,832 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:48:07,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896787207] [2020-12-23 01:48:07,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:07,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:07,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090336325] [2020-12-23 01:48:07,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:07,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:07,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:07,835 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2020-12-23 01:48:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:08,340 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2020-12-23 01:48:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:08,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 01:48:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:08,342 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:48:08,342 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:48:08,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:48:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:48:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:48:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2020-12-23 01:48:08,353 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2020-12-23 01:48:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:08,354 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2020-12-23 01:48:08,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2020-12-23 01:48:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 01:48:08,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:08,356 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:48:08,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:48:08,356 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2020-12-23 01:48:08,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:08,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573214827] [2020-12-23 01:48:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:08,439 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:48:08,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573214827] [2020-12-23 01:48:08,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:08,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:08,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968081139] [2020-12-23 01:48:08,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:08,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:08,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:08,441 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2020-12-23 01:48:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:09,018 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2020-12-23 01:48:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:09,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 01:48:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:09,021 INFO L225 Difference]: With dead ends: 536 [2020-12-23 01:48:09,021 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:48:09,022 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:48:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:48:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2020-12-23 01:48:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2020-12-23 01:48:09,032 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2020-12-23 01:48:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:09,032 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2020-12-23 01:48:09,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2020-12-23 01:48:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 01:48:09,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:09,034 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:48:09,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:48:09,034 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2020-12-23 01:48:09,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:09,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302705620] [2020-12-23 01:48:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:09,105 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:48:09,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302705620] [2020-12-23 01:48:09,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:09,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:09,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797706356] [2020-12-23 01:48:09,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:09,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:09,108 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2020-12-23 01:48:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:09,614 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2020-12-23 01:48:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:09,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 01:48:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:09,618 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:48:09,618 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:48:09,619 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:48:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:48:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:48:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2020-12-23 01:48:09,626 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2020-12-23 01:48:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:09,626 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2020-12-23 01:48:09,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2020-12-23 01:48:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 01:48:09,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:09,627 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:48:09,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:48:09,628 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2020-12-23 01:48:09,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:09,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776404924] [2020-12-23 01:48:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:09,721 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:48:09,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776404924] [2020-12-23 01:48:09,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:09,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:09,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383526887] [2020-12-23 01:48:09,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:09,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:09,724 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2020-12-23 01:48:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:10,280 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2020-12-23 01:48:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:10,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-12-23 01:48:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:10,283 INFO L225 Difference]: With dead ends: 536 [2020-12-23 01:48:10,283 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:48:10,284 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:48:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:48:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2020-12-23 01:48:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2020-12-23 01:48:10,292 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2020-12-23 01:48:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:10,293 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2020-12-23 01:48:10,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2020-12-23 01:48:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 01:48:10,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:10,294 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:48:10,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:48:10,294 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2020-12-23 01:48:10,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:10,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029156320] [2020-12-23 01:48:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:10,366 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:48:10,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029156320] [2020-12-23 01:48:10,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:10,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:10,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677044066] [2020-12-23 01:48:10,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:10,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:10,368 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2020-12-23 01:48:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:10,837 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2020-12-23 01:48:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:10,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-12-23 01:48:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:10,842 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:48:10,842 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 01:48:10,843 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:48:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 01:48:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-12-23 01:48:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2020-12-23 01:48:10,854 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2020-12-23 01:48:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:10,854 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2020-12-23 01:48:10,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2020-12-23 01:48:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 01:48:10,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:10,856 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:48:10,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:48:10,856 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2020-12-23 01:48:10,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:10,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910106460] [2020-12-23 01:48:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:10,936 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:48:10,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910106460] [2020-12-23 01:48:10,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:10,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:10,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19085911] [2020-12-23 01:48:10,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:10,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:10,940 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2020-12-23 01:48:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:11,456 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2020-12-23 01:48:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:11,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 01:48:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:11,458 INFO L225 Difference]: With dead ends: 526 [2020-12-23 01:48:11,459 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 01:48:11,459 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:48:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 01:48:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2020-12-23 01:48:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2020-12-23 01:48:11,468 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2020-12-23 01:48:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:11,469 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2020-12-23 01:48:11,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2020-12-23 01:48:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 01:48:11,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:11,470 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:48:11,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:48:11,470 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2020-12-23 01:48:11,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:11,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336442017] [2020-12-23 01:48:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:11,556 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:48:11,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336442017] [2020-12-23 01:48:11,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:11,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:11,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731165012] [2020-12-23 01:48:11,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:11,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:11,558 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2020-12-23 01:48:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:11,949 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2020-12-23 01:48:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:11,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 01:48:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:11,952 INFO L225 Difference]: With dead ends: 501 [2020-12-23 01:48:11,952 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 01:48:11,953 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:48:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 01:48:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2020-12-23 01:48:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2020-12-23 01:48:11,966 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2020-12-23 01:48:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:11,966 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2020-12-23 01:48:11,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2020-12-23 01:48:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:48:11,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:11,968 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:48:11,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:48:11,968 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2020-12-23 01:48:11,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:11,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033093225] [2020-12-23 01:48:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:12,050 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:48:12,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033093225] [2020-12-23 01:48:12,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:12,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:12,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136159330] [2020-12-23 01:48:12,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:12,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:12,052 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2020-12-23 01:48:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:12,574 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2020-12-23 01:48:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:12,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:48:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:12,583 INFO L225 Difference]: With dead ends: 526 [2020-12-23 01:48:12,583 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 01:48:12,584 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:48:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 01:48:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2020-12-23 01:48:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 01:48:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2020-12-23 01:48:12,593 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2020-12-23 01:48:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:12,594 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2020-12-23 01:48:12,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2020-12-23 01:48:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:48:12,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:12,595 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:48:12,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:48:12,596 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2020-12-23 01:48:12,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:12,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883593217] [2020-12-23 01:48:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:12,667 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:48:12,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883593217] [2020-12-23 01:48:12,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:12,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:12,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845267238] [2020-12-23 01:48:12,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:12,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:12,670 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2020-12-23 01:48:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:12,759 INFO L93 Difference]: Finished difference Result 719 states and 1071 transitions. [2020-12-23 01:48:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:12,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:48:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:12,761 INFO L225 Difference]: With dead ends: 719 [2020-12-23 01:48:12,762 INFO L226 Difference]: Without dead ends: 484 [2020-12-23 01:48:12,762 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:48:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-12-23 01:48:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2020-12-23 01:48:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-12-23 01:48:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 710 transitions. [2020-12-23 01:48:12,779 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 710 transitions. Word has length 96 [2020-12-23 01:48:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:12,780 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 710 transitions. [2020-12-23 01:48:12,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 710 transitions. [2020-12-23 01:48:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:48:12,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:12,782 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:48:12,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:48:12,783 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash 149915310, now seen corresponding path program 1 times [2020-12-23 01:48:12,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:12,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53788392] [2020-12-23 01:48:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:12,858 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:48:12,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53788392] [2020-12-23 01:48:12,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:12,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:12,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683252441] [2020-12-23 01:48:12,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:12,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:12,861 INFO L87 Difference]: Start difference. First operand 484 states and 710 transitions. Second operand 3 states. [2020-12-23 01:48:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:12,928 INFO L93 Difference]: Finished difference Result 976 states and 1435 transitions. [2020-12-23 01:48:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:12,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:48:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:12,932 INFO L225 Difference]: With dead ends: 976 [2020-12-23 01:48:12,932 INFO L226 Difference]: Without dead ends: 511 [2020-12-23 01:48:12,934 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:48:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-23 01:48:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2020-12-23 01:48:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-12-23 01:48:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2020-12-23 01:48:12,954 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2020-12-23 01:48:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:12,954 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2020-12-23 01:48:12,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2020-12-23 01:48:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:48:12,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:12,956 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:48:12,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 01:48:12,957 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash 176980912, now seen corresponding path program 1 times [2020-12-23 01:48:12,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:12,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027118176] [2020-12-23 01:48:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:12,998 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:48:12,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027118176] [2020-12-23 01:48:12,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:12,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:12,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27452577] [2020-12-23 01:48:13,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:13,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:13,000 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2020-12-23 01:48:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:13,041 INFO L93 Difference]: Finished difference Result 1005 states and 1471 transitions. [2020-12-23 01:48:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:13,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 01:48:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:13,044 INFO L225 Difference]: With dead ends: 1005 [2020-12-23 01:48:13,044 INFO L226 Difference]: Without dead ends: 513 [2020-12-23 01:48:13,045 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:48:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-12-23 01:48:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-12-23 01:48:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-12-23 01:48:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 747 transitions. [2020-12-23 01:48:13,064 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 747 transitions. Word has length 96 [2020-12-23 01:48:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:13,065 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 747 transitions. [2020-12-23 01:48:13,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 747 transitions. [2020-12-23 01:48:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:48:13,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:13,067 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:48:13,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 01:48:13,067 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2020-12-23 01:48:13,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:13,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951846226] [2020-12-23 01:48:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:13,144 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:48:13,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951846226] [2020-12-23 01:48:13,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:13,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:13,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303404553] [2020-12-23 01:48:13,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:13,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:13,147 INFO L87 Difference]: Start difference. First operand 513 states and 747 transitions. Second operand 3 states. [2020-12-23 01:48:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:13,245 INFO L93 Difference]: Finished difference Result 1240 states and 1821 transitions. [2020-12-23 01:48:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:13,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 01:48:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:13,252 INFO L225 Difference]: With dead ends: 1240 [2020-12-23 01:48:13,252 INFO L226 Difference]: Without dead ends: 748 [2020-12-23 01:48:13,253 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:48:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-12-23 01:48:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2020-12-23 01:48:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-12-23 01:48:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2020-12-23 01:48:13,289 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 98 [2020-12-23 01:48:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:13,289 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2020-12-23 01:48:13,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2020-12-23 01:48:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 01:48:13,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:13,292 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:48:13,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 01:48:13,293 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:13,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2020-12-23 01:48:13,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:13,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833555764] [2020-12-23 01:48:13,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:13,381 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:48:13,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833555764] [2020-12-23 01:48:13,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:13,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:13,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266186674] [2020-12-23 01:48:13,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:13,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:13,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:13,384 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 3 states. [2020-12-23 01:48:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:13,511 INFO L93 Difference]: Finished difference Result 1706 states and 2515 transitions. [2020-12-23 01:48:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:13,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 01:48:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:13,519 INFO L225 Difference]: With dead ends: 1706 [2020-12-23 01:48:13,520 INFO L226 Difference]: Without dead ends: 981 [2020-12-23 01:48:13,521 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:48:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2020-12-23 01:48:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2020-12-23 01:48:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2020-12-23 01:48:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2020-12-23 01:48:13,562 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 104 [2020-12-23 01:48:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:13,562 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2020-12-23 01:48:13,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2020-12-23 01:48:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:48:13,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:13,565 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:48:13,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 01:48:13,565 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2020-12-23 01:48:13,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:13,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114061844] [2020-12-23 01:48:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:13,661 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:48:13,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114061844] [2020-12-23 01:48:13,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:13,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:13,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72530576] [2020-12-23 01:48:13,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:13,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:13,663 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand 3 states. [2020-12-23 01:48:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:13,746 INFO L93 Difference]: Finished difference Result 2170 states and 3182 transitions. [2020-12-23 01:48:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:13,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-23 01:48:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:13,753 INFO L225 Difference]: With dead ends: 2170 [2020-12-23 01:48:13,753 INFO L226 Difference]: Without dead ends: 1212 [2020-12-23 01:48:13,754 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:48:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-12-23 01:48:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2020-12-23 01:48:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2020-12-23 01:48:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1774 transitions. [2020-12-23 01:48:13,793 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1774 transitions. Word has length 121 [2020-12-23 01:48:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:13,793 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 1774 transitions. [2020-12-23 01:48:13,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1774 transitions. [2020-12-23 01:48:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 01:48:13,796 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:13,797 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:48:13,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 01:48:13,797 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2020-12-23 01:48:13,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:13,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818236679] [2020-12-23 01:48:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:13,876 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:48:13,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818236679] [2020-12-23 01:48:13,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:13,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:48:13,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716096534] [2020-12-23 01:48:13,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:48:13,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:48:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:48:13,878 INFO L87 Difference]: Start difference. First operand 1212 states and 1774 transitions. Second operand 3 states. [2020-12-23 01:48:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:13,955 INFO L93 Difference]: Finished difference Result 1449 states and 2119 transitions. [2020-12-23 01:48:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:48:13,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2020-12-23 01:48:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:13,963 INFO L225 Difference]: With dead ends: 1449 [2020-12-23 01:48:13,963 INFO L226 Difference]: Without dead ends: 1447 [2020-12-23 01:48:13,964 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:48:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-12-23 01:48:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2020-12-23 01:48:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2020-12-23 01:48:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2116 transitions. [2020-12-23 01:48:14,013 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2116 transitions. Word has length 127 [2020-12-23 01:48:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:14,014 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2116 transitions. [2020-12-23 01:48:14,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:48:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2116 transitions. [2020-12-23 01:48:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:48:14,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:14,018 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:48:14,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 01:48:14,018 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2020-12-23 01:48:14,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:14,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640803460] [2020-12-23 01:48:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:14,658 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:48:14,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640803460] [2020-12-23 01:48:14,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390407140] [2020-12-23 01:48:14,659 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:48:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:14,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 01:48:14,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:48:15,222 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,223 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:48:15,251 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,333 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:48:15,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,385 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:48:15,388 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,460 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:48:15,463 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,532 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:15,533 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:48:15,536 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,554 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:48:15,555 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2020-12-23 01:48:15,626 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:15,627 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:48:15,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,642 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:48:15,772 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:15,772 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:48:15,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,792 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:48:15,833 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:48:15,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,854 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:48:15,855 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,911 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:48:15,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:15,970 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:48:15,974 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:15,996 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:15,996 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2020-12-23 01:48:16,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:16,095 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:48:16,097 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:16,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2020-12-23 01:48:16,196 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:16,196 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:48:16,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:16,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:48:16,267 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:16,267 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:48:16,271 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:16,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,284 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:48:16,370 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2020-12-23 01:48:16,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:16,378 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:48:16,381 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:48:16,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:16,625 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-12-23 01:48:16,626 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2020-12-23 01:48:16,627 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:48:16,643 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:16,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 01:48:16,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:48:16,655 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:48:16,657 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:16,659 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:16,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2020-12-23 01:48:16,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 01:48:16,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:48:16,671 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:48:16,673 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:16,675 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:16,685 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:16,713 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2020-12-23 01:48:16,715 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:48:16,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2020-12-23 01:48:16,810 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2020-12-23 01:48:16,814 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:48:16,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,091 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2020-12-23 01:48:17,093 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2020-12-23 01:48:17,094 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:48:17,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2020-12-23 01:48:17,100 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,103 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:17,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,121 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:48:17,121 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2020-12-23 01:48:17,310 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2020-12-23 01:48:17,316 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:48:17,317 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:17,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,560 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-12-23 01:48:17,561 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2020-12-23 01:48:17,562 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:48:17,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 01:48:17,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 01:48:17,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 01:48:17,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:48:17,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:48:17,577 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:48:17,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:48:17,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:17,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:48:17,579 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:48:17,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:48:17,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,593 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:17,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,613 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:48:17,613 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2020-12-23 01:48:17,714 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:48:17,721 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:48:17,723 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:48:17,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,751 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:48:17,754 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:17,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:17,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:17,841 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:48:17,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:48:17,855 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:48:17,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:48:17,856 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:17,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:48:17,859 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:48:17,861 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:48:17,862 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,877 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,880 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,881 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,888 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,889 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,890 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,893 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,895 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:17,896 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,903 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,914 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:48:17,920 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:48:17,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:48:17,923 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,924 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,929 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,931 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,945 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,947 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:48:17,949 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,950 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,952 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,954 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:17,960 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,962 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,964 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,966 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:48:17,968 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:48:17,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:48:17,972 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:17,973 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,975 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:17,977 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,977 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,981 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,983 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,984 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,986 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:17,989 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:17,996 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:17,997 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,001 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,004 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:18,005 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,006 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,009 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,011 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:18,019 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,022 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:18,023 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,024 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,031 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:18,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,034 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:48:18,035 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,037 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-23 01:48:18,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:18,039 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:18,040 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:48:18,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:18,044 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,046 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-23 01:48:18,047 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:48:18,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:48:18,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:18,053 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:48:18,058 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:48:18,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:18,067 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:48:18,068 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2020-12-23 01:48:18,128 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 01:48:18,129 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:48:18,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:18,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:18,142 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:48:18,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-12-23 01:48:18,402 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:48:18,403 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:48:18,407 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:18,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:18,414 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:48:18,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2020-12-23 01:48:18,786 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:48:18,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:48:18,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2020-12-23 01:48:18,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444697620] [2020-12-23 01:48:18,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 01:48:18,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 01:48:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-12-23 01:48:18,788 INFO L87 Difference]: Start difference. First operand 1445 states and 2116 transitions. Second operand 16 states. [2020-12-23 01:48:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:26,917 INFO L93 Difference]: Finished difference Result 7079 states and 10455 transitions. [2020-12-23 01:48:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 01:48:26,918 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2020-12-23 01:48:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:26,948 INFO L225 Difference]: With dead ends: 7079 [2020-12-23 01:48:26,948 INFO L226 Difference]: Without dead ends: 5655 [2020-12-23 01:48:26,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2020-12-23 01:48:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2020-12-23 01:48:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 3131. [2020-12-23 01:48:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-12-23 01:48:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4741 transitions. [2020-12-23 01:48:27,141 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4741 transitions. Word has length 164 [2020-12-23 01:48:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:27,141 INFO L481 AbstractCegarLoop]: Abstraction has 3131 states and 4741 transitions. [2020-12-23 01:48:27,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 01:48:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4741 transitions. [2020-12-23 01:48:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-23 01:48:27,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:27,148 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, 1, 1] [2020-12-23 01:48:27,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-12-23 01:48:27,362 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2020-12-23 01:48:27,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:27,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132723733] [2020-12-23 01:48:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:27,491 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:48:27,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132723733] [2020-12-23 01:48:27,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:27,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:27,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795568181] [2020-12-23 01:48:27,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:27,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:27,495 INFO L87 Difference]: Start difference. First operand 3131 states and 4741 transitions. Second operand 4 states. [2020-12-23 01:48:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:28,117 INFO L93 Difference]: Finished difference Result 6937 states and 10538 transitions. [2020-12-23 01:48:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:28,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2020-12-23 01:48:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:28,139 INFO L225 Difference]: With dead ends: 6937 [2020-12-23 01:48:28,139 INFO L226 Difference]: Without dead ends: 3827 [2020-12-23 01:48:28,144 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:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2020-12-23 01:48:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3467. [2020-12-23 01:48:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3467 states. [2020-12-23 01:48:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 5329 transitions. [2020-12-23 01:48:28,289 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 5329 transitions. Word has length 172 [2020-12-23 01:48:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:28,290 INFO L481 AbstractCegarLoop]: Abstraction has 3467 states and 5329 transitions. [2020-12-23 01:48:28,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5329 transitions. [2020-12-23 01:48:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 01:48:28,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:28,328 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:48:28,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 01:48:28,328 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1013795468, now seen corresponding path program 1 times [2020-12-23 01:48:28,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:28,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869997727] [2020-12-23 01:48:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:28,496 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:48:28,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869997727] [2020-12-23 01:48:28,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:28,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:28,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827630122] [2020-12-23 01:48:28,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:28,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:28,498 INFO L87 Difference]: Start difference. First operand 3467 states and 5329 transitions. Second operand 4 states. [2020-12-23 01:48:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:29,255 INFO L93 Difference]: Finished difference Result 8079 states and 12411 transitions. [2020-12-23 01:48:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:29,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2020-12-23 01:48:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:29,285 INFO L225 Difference]: With dead ends: 8079 [2020-12-23 01:48:29,286 INFO L226 Difference]: Without dead ends: 4633 [2020-12-23 01:48:29,290 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:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2020-12-23 01:48:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 3935. [2020-12-23 01:48:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3935 states. [2020-12-23 01:48:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 6181 transitions. [2020-12-23 01:48:29,448 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 6181 transitions. Word has length 178 [2020-12-23 01:48:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:29,448 INFO L481 AbstractCegarLoop]: Abstraction has 3935 states and 6181 transitions. [2020-12-23 01:48:29,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 6181 transitions. [2020-12-23 01:48:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:48:29,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:29,457 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:48:29,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 01:48:29,457 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1355851254, now seen corresponding path program 1 times [2020-12-23 01:48:29,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:29,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440564505] [2020-12-23 01:48:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:29,622 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:48:29,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440564505] [2020-12-23 01:48:29,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:29,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:29,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562255853] [2020-12-23 01:48:29,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:29,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:29,624 INFO L87 Difference]: Start difference. First operand 3935 states and 6181 transitions. Second operand 4 states. [2020-12-23 01:48:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:30,371 INFO L93 Difference]: Finished difference Result 8497 states and 13188 transitions. [2020-12-23 01:48:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:30,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-12-23 01:48:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:30,383 INFO L225 Difference]: With dead ends: 8497 [2020-12-23 01:48:30,383 INFO L226 Difference]: Without dead ends: 4583 [2020-12-23 01:48:30,388 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:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2020-12-23 01:48:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3815. [2020-12-23 01:48:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2020-12-23 01:48:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 5953 transitions. [2020-12-23 01:48:30,527 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 5953 transitions. Word has length 179 [2020-12-23 01:48:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:30,529 INFO L481 AbstractCegarLoop]: Abstraction has 3815 states and 5953 transitions. [2020-12-23 01:48:30,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 5953 transitions. [2020-12-23 01:48:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:48:30,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:30,538 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:48:30,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-23 01:48:30,538 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -350011293, now seen corresponding path program 1 times [2020-12-23 01:48:30,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:30,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127172130] [2020-12-23 01:48:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:30,730 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:48:30,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127172130] [2020-12-23 01:48:30,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:30,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:30,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528505029] [2020-12-23 01:48:30,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:30,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:30,732 INFO L87 Difference]: Start difference. First operand 3815 states and 5953 transitions. Second operand 5 states. [2020-12-23 01:48:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:31,518 INFO L93 Difference]: Finished difference Result 9147 states and 14275 transitions. [2020-12-23 01:48:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:31,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2020-12-23 01:48:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:31,529 INFO L225 Difference]: With dead ends: 9147 [2020-12-23 01:48:31,529 INFO L226 Difference]: Without dead ends: 5353 [2020-12-23 01:48:31,534 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:48:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2020-12-23 01:48:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 4289. [2020-12-23 01:48:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4289 states. [2020-12-23 01:48:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6811 transitions. [2020-12-23 01:48:31,689 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6811 transitions. Word has length 179 [2020-12-23 01:48:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:31,689 INFO L481 AbstractCegarLoop]: Abstraction has 4289 states and 6811 transitions. [2020-12-23 01:48:31,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6811 transitions. [2020-12-23 01:48:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:48:31,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:31,699 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:48:31,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-23 01:48:31,699 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1053443609, now seen corresponding path program 2 times [2020-12-23 01:48:31,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:31,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905090987] [2020-12-23 01:48:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:31,832 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:48:31,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905090987] [2020-12-23 01:48:31,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:31,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:31,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899257626] [2020-12-23 01:48:31,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:31,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:31,834 INFO L87 Difference]: Start difference. First operand 4289 states and 6811 transitions. Second operand 4 states. [2020-12-23 01:48:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:32,589 INFO L93 Difference]: Finished difference Result 7465 states and 11766 transitions. [2020-12-23 01:48:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:32,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-12-23 01:48:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:32,603 INFO L225 Difference]: With dead ends: 7465 [2020-12-23 01:48:32,603 INFO L226 Difference]: Without dead ends: 5267 [2020-12-23 01:48:32,607 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:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2020-12-23 01:48:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 4409. [2020-12-23 01:48:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2020-12-23 01:48:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6981 transitions. [2020-12-23 01:48:32,772 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6981 transitions. Word has length 179 [2020-12-23 01:48:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:32,772 INFO L481 AbstractCegarLoop]: Abstraction has 4409 states and 6981 transitions. [2020-12-23 01:48:32,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6981 transitions. [2020-12-23 01:48:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 01:48:32,780 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:32,781 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:48:32,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-23 01:48:32,781 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1144686980, now seen corresponding path program 1 times [2020-12-23 01:48:32,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:32,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746241611] [2020-12-23 01:48:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:32,914 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:48:32,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746241611] [2020-12-23 01:48:32,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:32,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:32,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527514168] [2020-12-23 01:48:32,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:32,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:32,916 INFO L87 Difference]: Start difference. First operand 4409 states and 6981 transitions. Second operand 4 states. [2020-12-23 01:48:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:33,727 INFO L93 Difference]: Finished difference Result 7525 states and 11841 transitions. [2020-12-23 01:48:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:33,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-12-23 01:48:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:33,741 INFO L225 Difference]: With dead ends: 7525 [2020-12-23 01:48:33,741 INFO L226 Difference]: Without dead ends: 5267 [2020-12-23 01:48:33,745 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:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2020-12-23 01:48:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 4419. [2020-12-23 01:48:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2020-12-23 01:48:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 6991 transitions. [2020-12-23 01:48:33,915 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 6991 transitions. Word has length 180 [2020-12-23 01:48:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:33,915 INFO L481 AbstractCegarLoop]: Abstraction has 4419 states and 6991 transitions. [2020-12-23 01:48:33,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 6991 transitions. [2020-12-23 01:48:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 01:48:33,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:33,924 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:48:33,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-23 01:48:33,924 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2027514623, now seen corresponding path program 1 times [2020-12-23 01:48:33,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:33,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737369894] [2020-12-23 01:48:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:34,076 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:48:34,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737369894] [2020-12-23 01:48:34,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:34,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:34,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413835246] [2020-12-23 01:48:34,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:34,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:34,078 INFO L87 Difference]: Start difference. First operand 4419 states and 6991 transitions. Second operand 5 states. [2020-12-23 01:48:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:34,940 INFO L93 Difference]: Finished difference Result 10019 states and 15805 transitions. [2020-12-23 01:48:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:34,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-12-23 01:48:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:34,949 INFO L225 Difference]: With dead ends: 10019 [2020-12-23 01:48:34,950 INFO L226 Difference]: Without dead ends: 5621 [2020-12-23 01:48:34,955 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:48:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2020-12-23 01:48:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 4287. [2020-12-23 01:48:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2020-12-23 01:48:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6811 transitions. [2020-12-23 01:48:35,134 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6811 transitions. Word has length 180 [2020-12-23 01:48:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:35,135 INFO L481 AbstractCegarLoop]: Abstraction has 4287 states and 6811 transitions. [2020-12-23 01:48:35,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6811 transitions. [2020-12-23 01:48:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-23 01:48:35,143 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:35,144 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:48:35,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-23 01:48:35,144 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2046397566, now seen corresponding path program 1 times [2020-12-23 01:48:35,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:35,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817856726] [2020-12-23 01:48:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:35,242 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:48:35,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817856726] [2020-12-23 01:48:35,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:35,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:35,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556007191] [2020-12-23 01:48:35,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:35,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:35,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:35,244 INFO L87 Difference]: Start difference. First operand 4287 states and 6811 transitions. Second operand 4 states. [2020-12-23 01:48:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:35,997 INFO L93 Difference]: Finished difference Result 7290 states and 11503 transitions. [2020-12-23 01:48:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:35,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-12-23 01:48:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:36,002 INFO L225 Difference]: With dead ends: 7290 [2020-12-23 01:48:36,002 INFO L226 Difference]: Without dead ends: 5093 [2020-12-23 01:48:36,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2020-12-23 01:48:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4297. [2020-12-23 01:48:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2020-12-23 01:48:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6821 transitions. [2020-12-23 01:48:36,165 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6821 transitions. Word has length 181 [2020-12-23 01:48:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:36,165 INFO L481 AbstractCegarLoop]: Abstraction has 4297 states and 6821 transitions. [2020-12-23 01:48:36,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6821 transitions. [2020-12-23 01:48:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 01:48:36,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:36,173 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:48:36,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-23 01:48:36,173 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1992179255, now seen corresponding path program 1 times [2020-12-23 01:48:36,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:36,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662781538] [2020-12-23 01:48:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:36,267 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:48:36,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662781538] [2020-12-23 01:48:36,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:36,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:36,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289691564] [2020-12-23 01:48:36,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:36,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:36,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:36,269 INFO L87 Difference]: Start difference. First operand 4297 states and 6821 transitions. Second operand 4 states. [2020-12-23 01:48:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:36,953 INFO L93 Difference]: Finished difference Result 7245 states and 11438 transitions. [2020-12-23 01:48:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:36,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2020-12-23 01:48:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:36,959 INFO L225 Difference]: With dead ends: 7245 [2020-12-23 01:48:36,959 INFO L226 Difference]: Without dead ends: 5043 [2020-12-23 01:48:36,962 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:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2020-12-23 01:48:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 4307. [2020-12-23 01:48:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6831 transitions. [2020-12-23 01:48:37,191 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6831 transitions. Word has length 182 [2020-12-23 01:48:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:37,191 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6831 transitions. [2020-12-23 01:48:37,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6831 transitions. [2020-12-23 01:48:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 01:48:37,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:37,199 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, 1, 1] [2020-12-23 01:48:37,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-23 01:48:37,200 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2020-12-23 01:48:37,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:37,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230425265] [2020-12-23 01:48:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:37,299 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:37,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230425265] [2020-12-23 01:48:37,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:37,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:37,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509951520] [2020-12-23 01:48:37,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:37,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:37,301 INFO L87 Difference]: Start difference. First operand 4307 states and 6831 transitions. Second operand 4 states. [2020-12-23 01:48:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:37,926 INFO L93 Difference]: Finished difference Result 8941 states and 14106 transitions. [2020-12-23 01:48:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:37,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-12-23 01:48:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:37,931 INFO L225 Difference]: With dead ends: 8941 [2020-12-23 01:48:37,931 INFO L226 Difference]: Without dead ends: 4655 [2020-12-23 01:48:37,935 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:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2020-12-23 01:48:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4307. [2020-12-23 01:48:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6819 transitions. [2020-12-23 01:48:38,091 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6819 transitions. Word has length 186 [2020-12-23 01:48:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:38,091 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6819 transitions. [2020-12-23 01:48:38,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6819 transitions. [2020-12-23 01:48:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-23 01:48:38,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:38,098 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, 1, 1] [2020-12-23 01:48:38,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-23 01:48:38,099 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2020-12-23 01:48:38,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:38,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589674967] [2020-12-23 01:48:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:38,241 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:38,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589674967] [2020-12-23 01:48:38,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:38,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:38,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258567253] [2020-12-23 01:48:38,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:38,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:38,243 INFO L87 Difference]: Start difference. First operand 4307 states and 6819 transitions. Second operand 4 states. [2020-12-23 01:48:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:38,916 INFO L93 Difference]: Finished difference Result 6862 states and 10763 transitions. [2020-12-23 01:48:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:38,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2020-12-23 01:48:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:38,923 INFO L225 Difference]: With dead ends: 6862 [2020-12-23 01:48:38,923 INFO L226 Difference]: Without dead ends: 4655 [2020-12-23 01:48:38,927 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:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2020-12-23 01:48:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4307. [2020-12-23 01:48:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6807 transitions. [2020-12-23 01:48:39,081 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6807 transitions. Word has length 187 [2020-12-23 01:48:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:39,081 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6807 transitions. [2020-12-23 01:48:39,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6807 transitions. [2020-12-23 01:48:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-23 01:48:39,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:39,089 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, 1, 1] [2020-12-23 01:48:39,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-23 01:48:39,089 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2020-12-23 01:48:39,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:39,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102606572] [2020-12-23 01:48:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:39,187 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:39,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102606572] [2020-12-23 01:48:39,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:39,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:39,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857036717] [2020-12-23 01:48:39,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:39,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:39,189 INFO L87 Difference]: Start difference. First operand 4307 states and 6807 transitions. Second operand 4 states. [2020-12-23 01:48:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:39,824 INFO L93 Difference]: Finished difference Result 6862 states and 10745 transitions. [2020-12-23 01:48:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:39,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2020-12-23 01:48:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:39,830 INFO L225 Difference]: With dead ends: 6862 [2020-12-23 01:48:39,830 INFO L226 Difference]: Without dead ends: 4655 [2020-12-23 01:48:39,833 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:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2020-12-23 01:48:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4307. [2020-12-23 01:48:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6795 transitions. [2020-12-23 01:48:40,003 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6795 transitions. Word has length 188 [2020-12-23 01:48:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:40,003 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6795 transitions. [2020-12-23 01:48:40,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6795 transitions. [2020-12-23 01:48:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-23 01:48:40,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:40,011 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, 1, 1] [2020-12-23 01:48:40,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-12-23 01:48:40,011 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2020-12-23 01:48:40,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:40,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038182236] [2020-12-23 01:48:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:40,119 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:40,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038182236] [2020-12-23 01:48:40,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:40,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:40,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315684080] [2020-12-23 01:48:40,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:40,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:40,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:40,121 INFO L87 Difference]: Start difference. First operand 4307 states and 6795 transitions. Second operand 4 states. [2020-12-23 01:48:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:40,862 INFO L93 Difference]: Finished difference Result 6862 states and 10727 transitions. [2020-12-23 01:48:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:40,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2020-12-23 01:48:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:40,870 INFO L225 Difference]: With dead ends: 6862 [2020-12-23 01:48:40,870 INFO L226 Difference]: Without dead ends: 4655 [2020-12-23 01:48:40,874 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:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2020-12-23 01:48:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4307. [2020-12-23 01:48:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6783 transitions. [2020-12-23 01:48:41,042 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6783 transitions. Word has length 189 [2020-12-23 01:48:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:41,042 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6783 transitions. [2020-12-23 01:48:41,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6783 transitions. [2020-12-23 01:48:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-23 01:48:41,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:41,054 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, 1, 1] [2020-12-23 01:48:41,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-12-23 01:48:41,055 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2020-12-23 01:48:41,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:41,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855470682] [2020-12-23 01:48:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:41,166 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:41,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855470682] [2020-12-23 01:48:41,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:41,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:41,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863850723] [2020-12-23 01:48:41,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:41,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:41,169 INFO L87 Difference]: Start difference. First operand 4307 states and 6783 transitions. Second operand 4 states. [2020-12-23 01:48:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:41,813 INFO L93 Difference]: Finished difference Result 6802 states and 10637 transitions. [2020-12-23 01:48:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:41,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2020-12-23 01:48:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:41,818 INFO L225 Difference]: With dead ends: 6802 [2020-12-23 01:48:41,818 INFO L226 Difference]: Without dead ends: 4595 [2020-12-23 01:48:41,821 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:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2020-12-23 01:48:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4307. [2020-12-23 01:48:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4307 states. [2020-12-23 01:48:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4307 states to 4307 states and 6771 transitions. [2020-12-23 01:48:41,921 INFO L78 Accepts]: Start accepts. Automaton has 4307 states and 6771 transitions. Word has length 190 [2020-12-23 01:48:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:41,921 INFO L481 AbstractCegarLoop]: Abstraction has 4307 states and 6771 transitions. [2020-12-23 01:48:41,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4307 states and 6771 transitions. [2020-12-23 01:48:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-23 01:48:41,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:41,925 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:41,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-12-23 01:48:41,926 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 396872042, now seen corresponding path program 1 times [2020-12-23 01:48:41,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:41,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385871240] [2020-12-23 01:48:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:42,036 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:42,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385871240] [2020-12-23 01:48:42,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:42,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:42,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940113139] [2020-12-23 01:48:42,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:42,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:42,038 INFO L87 Difference]: Start difference. First operand 4307 states and 6771 transitions. Second operand 4 states. [2020-12-23 01:48:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:42,767 INFO L93 Difference]: Finished difference Result 9329 states and 14638 transitions. [2020-12-23 01:48:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:42,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-12-23 01:48:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:42,773 INFO L225 Difference]: With dead ends: 9329 [2020-12-23 01:48:42,773 INFO L226 Difference]: Without dead ends: 5043 [2020-12-23 01:48:42,777 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:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2020-12-23 01:48:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 4317. [2020-12-23 01:48:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2020-12-23 01:48:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6781 transitions. [2020-12-23 01:48:42,986 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6781 transitions. Word has length 192 [2020-12-23 01:48:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:42,987 INFO L481 AbstractCegarLoop]: Abstraction has 4317 states and 6781 transitions. [2020-12-23 01:48:42,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6781 transitions. [2020-12-23 01:48:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:42,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:42,992 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:42,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-12-23 01:48:42,993 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1321764193, now seen corresponding path program 1 times [2020-12-23 01:48:42,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:42,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129765422] [2020-12-23 01:48:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:43,158 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:43,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129765422] [2020-12-23 01:48:43,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:43,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:43,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589074824] [2020-12-23 01:48:43,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:43,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:43,160 INFO L87 Difference]: Start difference. First operand 4317 states and 6781 transitions. Second operand 4 states. [2020-12-23 01:48:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:43,840 INFO L93 Difference]: Finished difference Result 9319 states and 14618 transitions. [2020-12-23 01:48:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:43,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-12-23 01:48:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:43,847 INFO L225 Difference]: With dead ends: 9319 [2020-12-23 01:48:43,847 INFO L226 Difference]: Without dead ends: 5023 [2020-12-23 01:48:43,852 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:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2020-12-23 01:48:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4327. [2020-12-23 01:48:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2020-12-23 01:48:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 6791 transitions. [2020-12-23 01:48:43,962 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 6791 transitions. Word has length 193 [2020-12-23 01:48:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:43,962 INFO L481 AbstractCegarLoop]: Abstraction has 4327 states and 6791 transitions. [2020-12-23 01:48:43,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 6791 transitions. [2020-12-23 01:48:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:43,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:43,967 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:43,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-12-23 01:48:43,968 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash -166759969, now seen corresponding path program 1 times [2020-12-23 01:48:43,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:43,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25596373] [2020-12-23 01:48:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:44,074 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:44,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25596373] [2020-12-23 01:48:44,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:44,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:44,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97550106] [2020-12-23 01:48:44,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:44,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:44,076 INFO L87 Difference]: Start difference. First operand 4327 states and 6791 transitions. Second operand 4 states. [2020-12-23 01:48:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:44,894 INFO L93 Difference]: Finished difference Result 7660 states and 11943 transitions. [2020-12-23 01:48:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:44,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-12-23 01:48:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:44,901 INFO L225 Difference]: With dead ends: 7660 [2020-12-23 01:48:44,901 INFO L226 Difference]: Without dead ends: 5443 [2020-12-23 01:48:44,904 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:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2020-12-23 01:48:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 4471. [2020-12-23 01:48:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2020-12-23 01:48:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6995 transitions. [2020-12-23 01:48:45,105 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6995 transitions. Word has length 193 [2020-12-23 01:48:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:45,105 INFO L481 AbstractCegarLoop]: Abstraction has 4471 states and 6995 transitions. [2020-12-23 01:48:45,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6995 transitions. [2020-12-23 01:48:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:45,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:45,112 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:45,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-12-23 01:48:45,112 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash -512641310, now seen corresponding path program 1 times [2020-12-23 01:48:45,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:45,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7673966] [2020-12-23 01:48:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:45,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:45,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:45,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:48:45,531 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:48:45,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-12-23 01:48:45,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:48:45 BoogieIcfgContainer [2020-12-23 01:48:45,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:48:45,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:48:45,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:48:45,733 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:48:45,733 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:47" (3/4) ... [2020-12-23 01:48:45,736 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:48:45,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:48:45,737 INFO L168 Benchmark]: Toolchain (without parser) took 60604.27 ms. Allocated memory was 159.4 MB in the beginning and 795.9 MB in the end (delta: 636.5 MB). Free memory was 132.6 MB in the beginning and 484.4 MB in the end (delta: -351.8 MB). Peak memory consumption was 285.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,738 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 159.4 MB. Free memory is still 135.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:45,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1094.70 ms. Allocated memory is still 159.4 MB. Free memory was 132.4 MB in the beginning and 133.2 MB in the end (delta: -727.3 kB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.19 ms. Allocated memory is still 159.4 MB. Free memory was 133.2 MB in the beginning and 128.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,739 INFO L168 Benchmark]: Boogie Preprocessor took 133.97 ms. Allocated memory is still 159.4 MB. Free memory was 128.5 MB in the beginning and 121.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,739 INFO L168 Benchmark]: RCFGBuilder took 1389.53 ms. Allocated memory was 159.4 MB in the beginning and 203.4 MB in the end (delta: 44.0 MB). Free memory was 121.7 MB in the beginning and 158.4 MB in the end (delta: -36.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,740 INFO L168 Benchmark]: TraceAbstraction took 57875.22 ms. Allocated memory was 203.4 MB in the beginning and 795.9 MB in the end (delta: 592.4 MB). Free memory was 158.4 MB in the beginning and 484.4 MB in the end (delta: -326.0 MB). Peak memory consumption was 265.9 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:45,740 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 795.9 MB. Free memory is still 484.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:45,742 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.19 ms. Allocated memory is still 159.4 MB. Free memory is still 135.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1094.70 ms. Allocated memory is still 159.4 MB. Free memory was 132.4 MB in the beginning and 133.2 MB in the end (delta: -727.3 kB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 94.19 ms. Allocated memory is still 159.4 MB. Free memory was 133.2 MB in the beginning and 128.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 133.97 ms. Allocated memory is still 159.4 MB. Free memory was 128.5 MB in the beginning and 121.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1389.53 ms. Allocated memory was 159.4 MB in the beginning and 203.4 MB in the end (delta: 44.0 MB). Free memory was 121.7 MB in the beginning and 158.4 MB in the end (delta: -36.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57875.22 ms. Allocated memory was 203.4 MB in the beginning and 795.9 MB in the end (delta: 592.4 MB). Free memory was 158.4 MB in the beginning and 484.4 MB in the end (delta: -326.0 MB). Peak memory consumption was 265.9 MB. Max. memory is 8.0 GB. * Witness Printer took 4.07 ms. Allocated memory is still 795.9 MB. Free memory is still 484.4 MB. 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}] [L1585] COND FALSE !(ret <= 0) [L1590] s->state = 8672 [L1591] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1592] 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 [L1601] ret = __VERIFIER_nondet_int() [L1602] COND TRUE blastFlag == 3 [L1603] 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: 57.6s, OverallIterations: 66, TraceHistogramMax: 7, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14058 SDtfs, 5391 SDslu, 22171 SDs, 0 SdLazy, 14976 SolverSat, 829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 292 SyntacticMatches, 33 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4471occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 65 MinimizatonAttempts, 15181 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 7310 NumberOfCodeBlocks, 7310 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7051 ConstructedInterpolants, 80 QuantifiedInterpolants, 3810036 SizeOfPredicates, 13 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 66 InterpolantComputations, 64 PerfectInterpolantSequences, 6938/7242 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...