/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.13.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:42:53,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:42:53,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:42:53,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:42:53,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:42:53,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:42:53,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:42:53,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:42:53,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:42:53,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:42:53,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:42:53,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:42:53,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:42:53,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:42:53,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:42:53,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:42:53,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:42:53,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:42:53,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:42:53,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:42:53,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:42:53,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:42:53,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:42:53,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:42:53,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:42:53,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:42:53,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:42:53,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:42:53,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:42:53,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:42:53,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:42:53,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:42:53,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:42:53,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:42:53,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:42:53,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:42:53,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:42:53,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:42:53,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:42:53,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:42:53,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:42:53,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:42:53,615 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:42:53,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:42:53,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:42:53,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:42:53,618 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:42:53,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:42:53,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:42:53,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:42:53,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:42:53,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:42:53,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:42:53,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:42:53,620 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:42:53,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:42:53,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:42:53,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:42:53,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:42:53,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:42:53,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:42:53,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:42:53,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:42:53,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:42:53,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:42:53,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:42:53,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:42:53,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:42:54,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:42:54,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:42:54,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:42:54,118 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:42:54,120 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:42:54,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.13.i.cil-1.c [2021-01-06 11:42:54,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/057d3516b/affef4a9c4604832be0c035937ec92e3/FLAGc8a5153c2 [2021-01-06 11:42:55,096 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:42:55,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.13.i.cil-1.c [2021-01-06 11:42:55,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/057d3516b/affef4a9c4604832be0c035937ec92e3/FLAGc8a5153c2 [2021-01-06 11:42:55,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/057d3516b/affef4a9c4604832be0c035937ec92e3 [2021-01-06 11:42:55,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:42:55,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:42:55,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:42:55,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:42:55,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:42:55,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:42:55" (1/1) ... [2021-01-06 11:42:55,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240629ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:55, skipping insertion in model container [2021-01-06 11:42:55,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:42:55" (1/1) ... [2021-01-06 11:42:55,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:42:55,440 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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:42:55,950 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.13.i.cil-1.c[73174,73187] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:42:55,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:42:55,988 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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:42:56,225 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.13.i.cil-1.c[73174,73187] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:42:56,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:42:56,257 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:42:56,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56 WrapperNode [2021-01-06 11:42:56,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:42:56,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:42:56,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:42:56,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:42:56,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:42:56,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:42:56,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:42:56,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:42:56,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... [2021-01-06 11:42:56,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:42:56,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:42:56,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:42:56,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:42:56,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:42:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:42:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:42:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:42:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:42:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:42:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:42:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:42:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:42:56,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:42:56,954 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:42:57,874 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:42:57,875 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:42:57,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:42:57,885 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:42:57,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:42:57 BoogieIcfgContainer [2021-01-06 11:42:57,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:42:57,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:42:57,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:42:57,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:42:57,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:42:55" (1/3) ... [2021-01-06 11:42:57,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba4be81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:42:57, skipping insertion in model container [2021-01-06 11:42:57,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:56" (2/3) ... [2021-01-06 11:42:57,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba4be81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:42:57, skipping insertion in model container [2021-01-06 11:42:57,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:42:57" (3/3) ... [2021-01-06 11:42:57,897 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2021-01-06 11:42:57,903 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:42:57,909 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:42:57,929 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:42:57,958 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:42:57,959 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:42:57,959 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:42:57,959 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:42:57,959 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:42:57,960 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:42:57,960 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:42:57,960 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:42:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 11:42:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:42:57,988 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:57,989 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] [2021-01-06 11:42:57,990 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2021-01-06 11:42:58,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:58,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814180591] [2021-01-06 11:42:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:58,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814180591] [2021-01-06 11:42:58,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:58,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:58,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018800040] [2021-01-06 11:42:58,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:58,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:58,503 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2021-01-06 11:42:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:59,155 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2021-01-06 11:42:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:59,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:42:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:59,171 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:42:59,171 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:42:59,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:42:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:42:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2021-01-06 11:42:59,230 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2021-01-06 11:42:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:59,231 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2021-01-06 11:42:59,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2021-01-06 11:42:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:42:59,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:59,234 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] [2021-01-06 11:42:59,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:42:59,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2021-01-06 11:42:59,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:59,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420359460] [2021-01-06 11:42:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:59,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420359460] [2021-01-06 11:42:59,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:59,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:59,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95216731] [2021-01-06 11:42:59,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:59,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:59,427 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2021-01-06 11:42:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:59,866 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2021-01-06 11:42:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:59,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-01-06 11:42:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:59,869 INFO L225 Difference]: With dead ends: 290 [2021-01-06 11:42:59,869 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:42:59,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:42:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:42:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2021-01-06 11:42:59,883 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2021-01-06 11:42:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:59,883 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2021-01-06 11:42:59,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2021-01-06 11:42:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:42:59,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:59,886 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] [2021-01-06 11:42:59,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:42:59,887 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2021-01-06 11:42:59,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:59,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001125239] [2021-01-06 11:42:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:59,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001125239] [2021-01-06 11:42:59,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:59,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:59,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10213567] [2021-01-06 11:42:59,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:59,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:59,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:59,993 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2021-01-06 11:43:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:00,428 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2021-01-06 11:43:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:00,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:43:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:00,434 INFO L225 Difference]: With dead ends: 289 [2021-01-06 11:43:00,434 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 11:43:00,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 11:43:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-01-06 11:43:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2021-01-06 11:43:00,456 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2021-01-06 11:43:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:00,457 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2021-01-06 11:43:00,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2021-01-06 11:43:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:43:00,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:00,464 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] [2021-01-06 11:43:00,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:43:00,465 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2021-01-06 11:43:00,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:00,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256513301] [2021-01-06 11:43:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:00,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256513301] [2021-01-06 11:43:00,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:00,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:00,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520634908] [2021-01-06 11:43:00,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:00,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:00,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:00,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:00,611 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2021-01-06 11:43:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:01,007 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2021-01-06 11:43:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:01,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:43:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:01,010 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:43:01,010 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:43:01,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:43:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-01-06 11:43:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2021-01-06 11:43:01,020 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2021-01-06 11:43:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:01,020 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2021-01-06 11:43:01,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2021-01-06 11:43:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:43:01,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:01,022 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] [2021-01-06 11:43:01,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:43:01,022 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2021-01-06 11:43:01,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:01,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375617475] [2021-01-06 11:43:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:01,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375617475] [2021-01-06 11:43:01,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:01,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:01,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617691134] [2021-01-06 11:43:01,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:01,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:01,119 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2021-01-06 11:43:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:01,524 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2021-01-06 11:43:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:01,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:43:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:01,527 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:43:01,527 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:43:01,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:43:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:43:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2021-01-06 11:43:01,535 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2021-01-06 11:43:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:01,535 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2021-01-06 11:43:01,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2021-01-06 11:43:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:43:01,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:01,537 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] [2021-01-06 11:43:01,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:43:01,537 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2021-01-06 11:43:01,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:01,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394988829] [2021-01-06 11:43:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:01,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394988829] [2021-01-06 11:43:01,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:01,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:01,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814511438] [2021-01-06 11:43:01,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:01,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:01,604 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2021-01-06 11:43:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,007 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2021-01-06 11:43:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:02,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:43:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,009 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:43:02,010 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:43:02,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:43:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:43:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2021-01-06 11:43:02,018 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2021-01-06 11:43:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,018 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2021-01-06 11:43:02,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2021-01-06 11:43:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:43:02,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,019 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] [2021-01-06 11:43:02,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:43:02,020 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2021-01-06 11:43:02,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975080115] [2021-01-06 11:43:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:02,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975080115] [2021-01-06 11:43:02,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:02,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:02,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540524595] [2021-01-06 11:43:02,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:02,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:02,086 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2021-01-06 11:43:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,464 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2021-01-06 11:43:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:02,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2021-01-06 11:43:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,467 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:43:02,467 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:43:02,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:43:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:43:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2021-01-06 11:43:02,476 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2021-01-06 11:43:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,477 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2021-01-06 11:43:02,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-01-06 11:43:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:43:02,478 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,478 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] [2021-01-06 11:43:02,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:43:02,478 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2021-01-06 11:43:02,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667007733] [2021-01-06 11:43:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:02,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667007733] [2021-01-06 11:43:02,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:02,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:02,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985640616] [2021-01-06 11:43:02,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:02,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:02,545 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2021-01-06 11:43:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,941 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2021-01-06 11:43:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:02,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 11:43:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,944 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:43:02,944 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:43:02,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:43:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:43:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-01-06 11:43:02,952 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2021-01-06 11:43:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,953 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-01-06 11:43:02,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-01-06 11:43:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:43:02,954 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,954 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] [2021-01-06 11:43:02,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:43:02,955 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2021-01-06 11:43:02,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272509043] [2021-01-06 11:43:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:03,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272509043] [2021-01-06 11:43:03,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:03,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415852764] [2021-01-06 11:43:03,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:03,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:03,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:03,025 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2021-01-06 11:43:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,344 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2021-01-06 11:43:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:03,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:43:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,347 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:43:03,347 INFO L226 Difference]: Without dead ends: 149 [2021-01-06 11:43:03,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-01-06 11:43:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-01-06 11:43:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:43:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2021-01-06 11:43:03,353 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2021-01-06 11:43:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,353 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2021-01-06 11:43:03,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2021-01-06 11:43:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:43:03,355 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,355 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] [2021-01-06 11:43:03,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:43:03,355 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2021-01-06 11:43:03,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790613872] [2021-01-06 11:43:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:03,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790613872] [2021-01-06 11:43:03,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:03,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35112659] [2021-01-06 11:43:03,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:03,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:03,423 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2021-01-06 11:43:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,812 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-01-06 11:43:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:03,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:43:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,818 INFO L225 Difference]: With dead ends: 316 [2021-01-06 11:43:03,820 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:43:03,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 [2021-01-06 11:43:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:43:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:43:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2021-01-06 11:43:03,838 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2021-01-06 11:43:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,838 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2021-01-06 11:43:03,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2021-01-06 11:43:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 11:43:03,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,840 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] [2021-01-06 11:43:03,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:43:03,840 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2021-01-06 11:43:03,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316145731] [2021-01-06 11:43:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:03,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316145731] [2021-01-06 11:43:03,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:03,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593968752] [2021-01-06 11:43:03,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:03,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:03,924 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2021-01-06 11:43:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:04,321 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2021-01-06 11:43:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:04,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 11:43:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:04,324 INFO L225 Difference]: With dead ends: 338 [2021-01-06 11:43:04,324 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:43:04,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:43:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:43:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-01-06 11:43:04,331 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2021-01-06 11:43:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:04,332 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-01-06 11:43:04,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-01-06 11:43:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:43:04,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:04,333 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] [2021-01-06 11:43:04,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:43:04,333 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:04,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2021-01-06 11:43:04,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:04,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583593034] [2021-01-06 11:43:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:04,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583593034] [2021-01-06 11:43:04,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:04,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:04,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261282131] [2021-01-06 11:43:04,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:04,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:04,396 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2021-01-06 11:43:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:04,786 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2021-01-06 11:43:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:04,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:43:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:04,789 INFO L225 Difference]: With dead ends: 337 [2021-01-06 11:43:04,789 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 11:43:04,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 11:43:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2021-01-06 11:43:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2021-01-06 11:43:04,796 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2021-01-06 11:43:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:04,797 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2021-01-06 11:43:04,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2021-01-06 11:43:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:43:04,798 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:04,798 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] [2021-01-06 11:43:04,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:43:04,798 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2021-01-06 11:43:04,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:04,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696030935] [2021-01-06 11:43:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:04,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696030935] [2021-01-06 11:43:04,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:04,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:04,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171737848] [2021-01-06 11:43:04,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:04,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:04,875 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2021-01-06 11:43:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:05,234 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2021-01-06 11:43:05,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:05,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:43:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:05,237 INFO L225 Difference]: With dead ends: 335 [2021-01-06 11:43:05,237 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:43:05,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:43:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2021-01-06 11:43:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2021-01-06 11:43:05,244 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2021-01-06 11:43:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:05,244 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2021-01-06 11:43:05,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2021-01-06 11:43:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:43:05,245 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:05,246 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] [2021-01-06 11:43:05,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:43:05,246 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2021-01-06 11:43:05,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:05,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101779617] [2021-01-06 11:43:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:05,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101779617] [2021-01-06 11:43:05,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:05,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:05,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788493894] [2021-01-06 11:43:05,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:05,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:05,312 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2021-01-06 11:43:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:05,670 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2021-01-06 11:43:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:05,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:43:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:05,673 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:43:05,673 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:43:05,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:43:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:43:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2021-01-06 11:43:05,680 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2021-01-06 11:43:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:05,681 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2021-01-06 11:43:05,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2021-01-06 11:43:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:43:05,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:05,682 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] [2021-01-06 11:43:05,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:43:05,682 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2021-01-06 11:43:05,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:05,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333559351] [2021-01-06 11:43:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:05,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333559351] [2021-01-06 11:43:05,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:05,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:05,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922221604] [2021-01-06 11:43:05,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:05,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:05,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:05,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:05,740 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2021-01-06 11:43:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:06,115 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-01-06 11:43:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:06,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:43:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:06,117 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:43:06,117 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:43:06,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:43:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:43:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-01-06 11:43:06,124 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2021-01-06 11:43:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:06,124 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-01-06 11:43:06,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2021-01-06 11:43:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 11:43:06,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:06,126 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] [2021-01-06 11:43:06,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:43:06,126 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2021-01-06 11:43:06,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:06,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130261682] [2021-01-06 11:43:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:06,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130261682] [2021-01-06 11:43:06,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:06,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:06,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531751537] [2021-01-06 11:43:06,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:06,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:06,185 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2021-01-06 11:43:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:06,649 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2021-01-06 11:43:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:06,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 11:43:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:06,652 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:43:06,652 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:43:06,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:43:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:43:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-01-06 11:43:06,665 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2021-01-06 11:43:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:06,666 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-01-06 11:43:06,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2021-01-06 11:43:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:43:06,667 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:06,668 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] [2021-01-06 11:43:06,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:43:06,668 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2021-01-06 11:43:06,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:06,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048258521] [2021-01-06 11:43:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:06,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048258521] [2021-01-06 11:43:06,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:06,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:06,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121768760] [2021-01-06 11:43:06,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:06,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:06,790 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2021-01-06 11:43:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:07,178 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2021-01-06 11:43:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:07,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 11:43:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:07,180 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:43:07,180 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:43:07,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:43:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:43:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2021-01-06 11:43:07,189 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2021-01-06 11:43:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:07,189 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2021-01-06 11:43:07,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2021-01-06 11:43:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 11:43:07,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:07,190 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] [2021-01-06 11:43:07,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:43:07,190 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2021-01-06 11:43:07,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:07,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671014201] [2021-01-06 11:43:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:07,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671014201] [2021-01-06 11:43:07,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:07,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:07,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708708040] [2021-01-06 11:43:07,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:07,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:07,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:07,272 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2021-01-06 11:43:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:07,628 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2021-01-06 11:43:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:07,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 11:43:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:07,630 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:43:07,630 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:43:07,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:43:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-01-06 11:43:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:43:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2021-01-06 11:43:07,638 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2021-01-06 11:43:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:07,638 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2021-01-06 11:43:07,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2021-01-06 11:43:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:43:07,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:07,640 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] [2021-01-06 11:43:07,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:43:07,640 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2021-01-06 11:43:07,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:07,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570550178] [2021-01-06 11:43:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:07,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570550178] [2021-01-06 11:43:07,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:07,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:07,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250155562] [2021-01-06 11:43:07,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:07,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:07,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:07,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:07,729 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2021-01-06 11:43:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:08,343 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2021-01-06 11:43:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:08,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:43:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:08,345 INFO L225 Difference]: With dead ends: 424 [2021-01-06 11:43:08,346 INFO L226 Difference]: Without dead ends: 275 [2021-01-06 11:43:08,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 [2021-01-06 11:43:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-06 11:43:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2021-01-06 11:43:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 11:43:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2021-01-06 11:43:08,354 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2021-01-06 11:43:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:08,354 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2021-01-06 11:43:08,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2021-01-06 11:43:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:43:08,355 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:08,356 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] [2021-01-06 11:43:08,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:43:08,356 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2021-01-06 11:43:08,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:08,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365011565] [2021-01-06 11:43:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:08,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365011565] [2021-01-06 11:43:08,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:08,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:08,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736670505] [2021-01-06 11:43:08,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:08,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:08,437 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2021-01-06 11:43:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:08,904 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2021-01-06 11:43:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:08,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:43:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:08,906 INFO L225 Difference]: With dead ends: 427 [2021-01-06 11:43:08,906 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 11:43:08,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 11:43:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2021-01-06 11:43:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-06 11:43:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-01-06 11:43:08,914 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2021-01-06 11:43:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:08,915 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-01-06 11:43:08,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2021-01-06 11:43:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:43:08,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:08,916 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] [2021-01-06 11:43:08,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:43:08,916 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2021-01-06 11:43:08,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:08,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708503869] [2021-01-06 11:43:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:08,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708503869] [2021-01-06 11:43:08,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:08,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:08,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392286382] [2021-01-06 11:43:08,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:08,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:08,994 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2021-01-06 11:43:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:09,559 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2021-01-06 11:43:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:09,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:43:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:09,561 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:43:09,562 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:43:09,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:43:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2021-01-06 11:43:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 11:43:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2021-01-06 11:43:09,570 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2021-01-06 11:43:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:09,571 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2021-01-06 11:43:09,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2021-01-06 11:43:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 11:43:09,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:09,572 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] [2021-01-06 11:43:09,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:43:09,572 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2021-01-06 11:43:09,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:09,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892682169] [2021-01-06 11:43:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:09,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892682169] [2021-01-06 11:43:09,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:09,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:09,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143929308] [2021-01-06 11:43:09,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:09,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:09,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:09,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:09,651 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2021-01-06 11:43:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:10,210 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2021-01-06 11:43:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:10,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 11:43:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:10,213 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:43:10,213 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:43:10,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:43:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2021-01-06 11:43:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-01-06 11:43:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2021-01-06 11:43:10,222 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2021-01-06 11:43:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:10,222 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2021-01-06 11:43:10,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2021-01-06 11:43:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:43:10,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:10,223 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] [2021-01-06 11:43:10,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:43:10,224 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2021-01-06 11:43:10,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:10,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497243783] [2021-01-06 11:43:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:10,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497243783] [2021-01-06 11:43:10,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:10,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:10,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875348964] [2021-01-06 11:43:10,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:10,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:10,308 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2021-01-06 11:43:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:10,828 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2021-01-06 11:43:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:10,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:43:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:10,831 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:43:10,832 INFO L226 Difference]: Without dead ends: 285 [2021-01-06 11:43:10,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-06 11:43:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2021-01-06 11:43:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2021-01-06 11:43:10,841 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2021-01-06 11:43:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:10,841 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2021-01-06 11:43:10,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2021-01-06 11:43:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:43:10,842 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:10,842 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] [2021-01-06 11:43:10,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:43:10,843 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:10,843 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2021-01-06 11:43:10,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:10,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828004511] [2021-01-06 11:43:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:10,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828004511] [2021-01-06 11:43:10,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:10,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:10,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423938121] [2021-01-06 11:43:10,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:10,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:10,921 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2021-01-06 11:43:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:11,460 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2021-01-06 11:43:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:11,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:43:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:11,463 INFO L225 Difference]: With dead ends: 500 [2021-01-06 11:43:11,463 INFO L226 Difference]: Without dead ends: 285 [2021-01-06 11:43:11,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-06 11:43:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2021-01-06 11:43:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2021-01-06 11:43:11,472 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2021-01-06 11:43:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:11,472 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2021-01-06 11:43:11,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2021-01-06 11:43:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:43:11,474 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:11,474 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] [2021-01-06 11:43:11,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:43:11,474 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2021-01-06 11:43:11,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:11,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336500860] [2021-01-06 11:43:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:11,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336500860] [2021-01-06 11:43:11,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:11,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:11,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902283931] [2021-01-06 11:43:11,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:11,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:11,551 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2021-01-06 11:43:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:12,036 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2021-01-06 11:43:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:12,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:43:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:12,039 INFO L225 Difference]: With dead ends: 475 [2021-01-06 11:43:12,039 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 11:43:12,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 11:43:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2021-01-06 11:43:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2021-01-06 11:43:12,051 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2021-01-06 11:43:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:12,051 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2021-01-06 11:43:12,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2021-01-06 11:43:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:12,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:12,052 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] [2021-01-06 11:43:12,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:43:12,053 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2021-01-06 11:43:12,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:12,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977116477] [2021-01-06 11:43:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:12,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977116477] [2021-01-06 11:43:12,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:12,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:12,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520702447] [2021-01-06 11:43:12,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:12,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:12,142 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2021-01-06 11:43:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:12,645 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2021-01-06 11:43:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:12,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:43:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:12,648 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:43:12,648 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:43:12,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:43:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2021-01-06 11:43:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2021-01-06 11:43:12,657 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2021-01-06 11:43:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:12,657 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2021-01-06 11:43:12,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2021-01-06 11:43:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:12,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:12,659 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] [2021-01-06 11:43:12,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:43:12,659 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2021-01-06 11:43:12,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:12,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429344162] [2021-01-06 11:43:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:12,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429344162] [2021-01-06 11:43:12,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:12,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:12,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254513910] [2021-01-06 11:43:12,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:12,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:12,738 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2021-01-06 11:43:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:13,238 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2021-01-06 11:43:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:13,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:43:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:13,241 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:43:13,241 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:43:13,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:43:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2021-01-06 11:43:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2021-01-06 11:43:13,248 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2021-01-06 11:43:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:13,249 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2021-01-06 11:43:13,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2021-01-06 11:43:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:13,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:13,250 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] [2021-01-06 11:43:13,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:43:13,250 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2021-01-06 11:43:13,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:13,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764767131] [2021-01-06 11:43:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:13,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764767131] [2021-01-06 11:43:13,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:13,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:13,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763580214] [2021-01-06 11:43:13,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:13,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:13,320 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2021-01-06 11:43:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:13,806 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2021-01-06 11:43:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:13,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:43:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:13,809 INFO L225 Difference]: With dead ends: 496 [2021-01-06 11:43:13,809 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:43:13,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:43:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2021-01-06 11:43:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:43:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2021-01-06 11:43:13,817 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2021-01-06 11:43:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:13,817 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2021-01-06 11:43:13,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2021-01-06 11:43:13,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:13,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:13,818 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] [2021-01-06 11:43:13,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:43:13,819 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:13,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2021-01-06 11:43:13,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:13,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569673384] [2021-01-06 11:43:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:43:13,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569673384] [2021-01-06 11:43:13,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:13,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:43:13,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267159327] [2021-01-06 11:43:13,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:43:13,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:43:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:13,916 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2021-01-06 11:43:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:14,509 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2021-01-06 11:43:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:43:14,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 11:43:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:14,512 INFO L225 Difference]: With dead ends: 470 [2021-01-06 11:43:14,512 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:43:14,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:43:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:43:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-01-06 11:43:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2021-01-06 11:43:14,520 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2021-01-06 11:43:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:14,520 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2021-01-06 11:43:14,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:43:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2021-01-06 11:43:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:14,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:14,522 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] [2021-01-06 11:43:14,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:43:14,522 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2021-01-06 11:43:14,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:14,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173184331] [2021-01-06 11:43:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:14,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173184331] [2021-01-06 11:43:14,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:14,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:14,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311561267] [2021-01-06 11:43:14,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:14,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:14,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:14,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:14,589 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2021-01-06 11:43:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:14,988 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2021-01-06 11:43:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:14,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:43:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:14,991 INFO L225 Difference]: With dead ends: 512 [2021-01-06 11:43:14,992 INFO L226 Difference]: Without dead ends: 277 [2021-01-06 11:43:14,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-06 11:43:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2021-01-06 11:43:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2021-01-06 11:43:15,013 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2021-01-06 11:43:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:15,013 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2021-01-06 11:43:15,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2021-01-06 11:43:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:43:15,015 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:15,015 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:15,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:43:15,015 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2021-01-06 11:43:15,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:15,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788403735] [2021-01-06 11:43:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:15,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788403735] [2021-01-06 11:43:15,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:15,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:15,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398350289] [2021-01-06 11:43:15,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:15,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:15,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:15,081 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2021-01-06 11:43:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:15,521 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2021-01-06 11:43:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:43:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:15,524 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:15,524 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:15,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2021-01-06 11:43:15,535 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2021-01-06 11:43:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:15,535 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2021-01-06 11:43:15,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2021-01-06 11:43:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:43:15,536 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:15,537 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] [2021-01-06 11:43:15,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:43:15,537 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2021-01-06 11:43:15,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:15,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541233335] [2021-01-06 11:43:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:15,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541233335] [2021-01-06 11:43:15,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:15,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:15,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287143381] [2021-01-06 11:43:15,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:15,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:15,612 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2021-01-06 11:43:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:16,141 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2021-01-06 11:43:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:16,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:43:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:16,144 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:43:16,144 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:43:16,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:43:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:43:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-01-06 11:43:16,154 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2021-01-06 11:43:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:16,154 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-01-06 11:43:16,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-01-06 11:43:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:43:16,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:16,155 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] [2021-01-06 11:43:16,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:43:16,156 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2021-01-06 11:43:16,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:16,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656583593] [2021-01-06 11:43:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:16,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656583593] [2021-01-06 11:43:16,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:16,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:16,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672969793] [2021-01-06 11:43:16,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:16,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:16,222 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2021-01-06 11:43:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:16,670 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-01-06 11:43:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:16,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:43:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:16,673 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:16,673 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:16,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2021-01-06 11:43:16,682 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2021-01-06 11:43:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:16,682 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2021-01-06 11:43:16,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2021-01-06 11:43:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:43:16,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:16,683 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] [2021-01-06 11:43:16,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:43:16,684 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2021-01-06 11:43:16,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925121285] [2021-01-06 11:43:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:16,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925121285] [2021-01-06 11:43:16,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:16,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:16,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733983627] [2021-01-06 11:43:16,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:16,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:16,757 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2021-01-06 11:43:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:17,268 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2021-01-06 11:43:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:17,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:43:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:17,272 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:43:17,272 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:43:17,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:43:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:43:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2021-01-06 11:43:17,282 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2021-01-06 11:43:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:17,282 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2021-01-06 11:43:17,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2021-01-06 11:43:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:43:17,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:17,283 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] [2021-01-06 11:43:17,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:43:17,284 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2021-01-06 11:43:17,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:17,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886755114] [2021-01-06 11:43:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:17,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886755114] [2021-01-06 11:43:17,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:17,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:17,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394098868] [2021-01-06 11:43:17,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:17,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:17,349 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2021-01-06 11:43:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:17,750 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2021-01-06 11:43:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:17,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:43:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:17,752 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:17,753 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:17,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2021-01-06 11:43:17,762 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2021-01-06 11:43:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:17,762 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2021-01-06 11:43:17,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2021-01-06 11:43:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:43:17,764 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:17,764 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] [2021-01-06 11:43:17,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:43:17,764 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2021-01-06 11:43:17,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:17,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703094858] [2021-01-06 11:43:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:17,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703094858] [2021-01-06 11:43:17,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:17,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:17,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180053584] [2021-01-06 11:43:17,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:17,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:17,846 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2021-01-06 11:43:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:18,392 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2021-01-06 11:43:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:18,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:43:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:18,395 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:43:18,395 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:43:18,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:43:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:43:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2021-01-06 11:43:18,405 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2021-01-06 11:43:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:18,405 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2021-01-06 11:43:18,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2021-01-06 11:43:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:43:18,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:18,407 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] [2021-01-06 11:43:18,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:43:18,407 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2021-01-06 11:43:18,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:18,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044368451] [2021-01-06 11:43:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:18,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044368451] [2021-01-06 11:43:18,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:18,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:18,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45795591] [2021-01-06 11:43:18,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:18,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:18,476 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2021-01-06 11:43:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:18,906 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2021-01-06 11:43:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:18,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:43:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:18,909 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:18,909 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:18,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2021-01-06 11:43:18,918 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2021-01-06 11:43:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:18,919 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2021-01-06 11:43:18,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2021-01-06 11:43:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:43:18,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:18,920 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] [2021-01-06 11:43:18,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:43:18,921 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2021-01-06 11:43:18,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:18,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624192381] [2021-01-06 11:43:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:18,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624192381] [2021-01-06 11:43:18,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:18,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:18,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869439476] [2021-01-06 11:43:18,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:18,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:18,991 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2021-01-06 11:43:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:19,493 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2021-01-06 11:43:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:19,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:43:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:19,497 INFO L225 Difference]: With dead ends: 526 [2021-01-06 11:43:19,497 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:43:19,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:43:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2021-01-06 11:43:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2021-01-06 11:43:19,507 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2021-01-06 11:43:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:19,507 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2021-01-06 11:43:19,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2021-01-06 11:43:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:43:19,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:19,509 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] [2021-01-06 11:43:19,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:43:19,509 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2021-01-06 11:43:19,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:19,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599538717] [2021-01-06 11:43:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:19,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599538717] [2021-01-06 11:43:19,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:19,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:19,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330379547] [2021-01-06 11:43:19,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:19,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:19,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:19,574 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2021-01-06 11:43:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:19,966 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2021-01-06 11:43:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:19,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:43:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:19,968 INFO L225 Difference]: With dead ends: 501 [2021-01-06 11:43:19,968 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:43:19,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:43:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2021-01-06 11:43:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2021-01-06 11:43:19,978 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2021-01-06 11:43:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:19,979 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2021-01-06 11:43:19,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2021-01-06 11:43:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:19,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:19,980 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] [2021-01-06 11:43:19,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:43:19,980 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2021-01-06 11:43:19,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:19,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616888640] [2021-01-06 11:43:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:20,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616888640] [2021-01-06 11:43:20,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:20,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:20,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229125921] [2021-01-06 11:43:20,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:20,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:20,050 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2021-01-06 11:43:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:20,526 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2021-01-06 11:43:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:20,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:43:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:20,530 INFO L225 Difference]: With dead ends: 526 [2021-01-06 11:43:20,530 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:43:20,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:43:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2021-01-06 11:43:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2021-01-06 11:43:20,539 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2021-01-06 11:43:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:20,540 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2021-01-06 11:43:20,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2021-01-06 11:43:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:20,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:20,541 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] [2021-01-06 11:43:20,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:43:20,541 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2021-01-06 11:43:20,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:20,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734505596] [2021-01-06 11:43:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:43:20,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734505596] [2021-01-06 11:43:20,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:20,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:20,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272932580] [2021-01-06 11:43:20,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:20,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,621 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2021-01-06 11:43:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:20,707 INFO L93 Difference]: Finished difference Result 719 states and 1071 transitions. [2021-01-06 11:43:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:20,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:20,710 INFO L225 Difference]: With dead ends: 719 [2021-01-06 11:43:20,710 INFO L226 Difference]: Without dead ends: 484 [2021-01-06 11:43:20,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-06 11:43:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-01-06 11:43:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2021-01-06 11:43:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 710 transitions. [2021-01-06 11:43:20,728 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 710 transitions. Word has length 96 [2021-01-06 11:43:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:20,728 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 710 transitions. [2021-01-06 11:43:20,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 710 transitions. [2021-01-06 11:43:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:20,730 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:20,730 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] [2021-01-06 11:43:20,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:43:20,730 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1537102738, now seen corresponding path program 1 times [2021-01-06 11:43:20,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:20,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071544853] [2021-01-06 11:43:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:43:20,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071544853] [2021-01-06 11:43:20,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:20,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:20,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445935480] [2021-01-06 11:43:20,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:20,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,777 INFO L87 Difference]: Start difference. First operand 484 states and 710 transitions. Second operand 3 states. [2021-01-06 11:43:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:20,843 INFO L93 Difference]: Finished difference Result 976 states and 1435 transitions. [2021-01-06 11:43:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:20,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:20,847 INFO L225 Difference]: With dead ends: 976 [2021-01-06 11:43:20,847 INFO L226 Difference]: Without dead ends: 511 [2021-01-06 11:43:20,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-06 11:43:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-01-06 11:43:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2021-01-06 11:43:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2021-01-06 11:43:20,864 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2021-01-06 11:43:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:20,864 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2021-01-06 11:43:20,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2021-01-06 11:43:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:20,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:20,866 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] [2021-01-06 11:43:20,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:43:20,866 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1564168340, now seen corresponding path program 1 times [2021-01-06 11:43:20,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:20,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083427264] [2021-01-06 11:43:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:43:20,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083427264] [2021-01-06 11:43:20,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:20,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:20,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658310314] [2021-01-06 11:43:20,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:20,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,908 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2021-01-06 11:43:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:20,946 INFO L93 Difference]: Finished difference Result 1005 states and 1471 transitions. [2021-01-06 11:43:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:20,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:20,949 INFO L225 Difference]: With dead ends: 1005 [2021-01-06 11:43:20,950 INFO L226 Difference]: Without dead ends: 513 [2021-01-06 11:43:20,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-01-06 11:43:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-01-06 11:43:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2021-01-06 11:43:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 747 transitions. [2021-01-06 11:43:20,969 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 747 transitions. Word has length 96 [2021-01-06 11:43:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:20,969 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 747 transitions. [2021-01-06 11:43:20,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 747 transitions. [2021-01-06 11:43:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:43:20,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:20,971 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] [2021-01-06 11:43:20,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:43:20,972 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2021-01-06 11:43:20,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:20,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546410343] [2021-01-06 11:43:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:21,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546410343] [2021-01-06 11:43:21,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:21,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:21,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914681073] [2021-01-06 11:43:21,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:21,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:21,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,061 INFO L87 Difference]: Start difference. First operand 513 states and 747 transitions. Second operand 3 states. [2021-01-06 11:43:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:21,138 INFO L93 Difference]: Finished difference Result 1240 states and 1821 transitions. [2021-01-06 11:43:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:21,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:43:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:21,143 INFO L225 Difference]: With dead ends: 1240 [2021-01-06 11:43:21,144 INFO L226 Difference]: Without dead ends: 748 [2021-01-06 11:43:21,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-01-06 11:43:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2021-01-06 11:43:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2021-01-06 11:43:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2021-01-06 11:43:21,174 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 98 [2021-01-06 11:43:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:21,174 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2021-01-06 11:43:21,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2021-01-06 11:43:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 11:43:21,177 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:21,177 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] [2021-01-06 11:43:21,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:43:21,177 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2021-01-06 11:43:21,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:21,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249979659] [2021-01-06 11:43:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:21,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249979659] [2021-01-06 11:43:21,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:21,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:21,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518521118] [2021-01-06 11:43:21,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:21,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,244 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 3 states. [2021-01-06 11:43:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:21,356 INFO L93 Difference]: Finished difference Result 1706 states and 2515 transitions. [2021-01-06 11:43:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:21,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-06 11:43:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:21,361 INFO L225 Difference]: With dead ends: 1706 [2021-01-06 11:43:21,361 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:43:21,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:43:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2021-01-06 11:43:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2021-01-06 11:43:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2021-01-06 11:43:21,396 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 104 [2021-01-06 11:43:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:21,396 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2021-01-06 11:43:21,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2021-01-06 11:43:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:43:21,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:21,399 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] [2021-01-06 11:43:21,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:43:21,400 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2021-01-06 11:43:21,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:21,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495935029] [2021-01-06 11:43:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:21,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495935029] [2021-01-06 11:43:21,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:21,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:21,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245967430] [2021-01-06 11:43:21,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:21,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,473 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand 3 states. [2021-01-06 11:43:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:21,564 INFO L93 Difference]: Finished difference Result 2170 states and 3182 transitions. [2021-01-06 11:43:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:21,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:43:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:21,571 INFO L225 Difference]: With dead ends: 2170 [2021-01-06 11:43:21,571 INFO L226 Difference]: Without dead ends: 1212 [2021-01-06 11:43:21,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-01-06 11:43:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2021-01-06 11:43:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2021-01-06 11:43:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1774 transitions. [2021-01-06 11:43:21,614 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1774 transitions. Word has length 121 [2021-01-06 11:43:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:21,615 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 1774 transitions. [2021-01-06 11:43:21,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1774 transitions. [2021-01-06 11:43:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 11:43:21,618 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:21,618 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] [2021-01-06 11:43:21,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:43:21,618 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2021-01-06 11:43:21,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:21,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117840286] [2021-01-06 11:43:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:43:21,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117840286] [2021-01-06 11:43:21,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:21,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:21,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849292101] [2021-01-06 11:43:21,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:21,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,699 INFO L87 Difference]: Start difference. First operand 1212 states and 1774 transitions. Second operand 3 states. [2021-01-06 11:43:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:21,774 INFO L93 Difference]: Finished difference Result 1449 states and 2119 transitions. [2021-01-06 11:43:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:21,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 11:43:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:21,783 INFO L225 Difference]: With dead ends: 1449 [2021-01-06 11:43:21,783 INFO L226 Difference]: Without dead ends: 1447 [2021-01-06 11:43:21,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2021-01-06 11:43:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2021-01-06 11:43:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2021-01-06 11:43:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2116 transitions. [2021-01-06 11:43:21,835 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2116 transitions. Word has length 127 [2021-01-06 11:43:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:21,835 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2116 transitions. [2021-01-06 11:43:21,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2116 transitions. [2021-01-06 11:43:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-06 11:43:21,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:21,839 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] [2021-01-06 11:43:21,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:43:21,840 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2021-01-06 11:43:21,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:21,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670852489] [2021-01-06 11:43:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:43:21,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670852489] [2021-01-06 11:43:21,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:21,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:21,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001048419] [2021-01-06 11:43:21,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:21,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:21,973 INFO L87 Difference]: Start difference. First operand 1445 states and 2116 transitions. Second operand 4 states. [2021-01-06 11:43:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:22,504 INFO L93 Difference]: Finished difference Result 3247 states and 4784 transitions. [2021-01-06 11:43:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:22,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2021-01-06 11:43:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:22,514 INFO L225 Difference]: With dead ends: 3247 [2021-01-06 11:43:22,514 INFO L226 Difference]: Without dead ends: 1823 [2021-01-06 11:43:22,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2021-01-06 11:43:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1613. [2021-01-06 11:43:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2021-01-06 11:43:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2410 transitions. [2021-01-06 11:43:22,575 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2410 transitions. Word has length 163 [2021-01-06 11:43:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:22,575 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 2410 transitions. [2021-01-06 11:43:22,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2410 transitions. [2021-01-06 11:43:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 11:43:22,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:22,579 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] [2021-01-06 11:43:22,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 11:43:22,580 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2021-01-06 11:43:22,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:22,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976811216] [2021-01-06 11:43:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:43:22,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976811216] [2021-01-06 11:43:22,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:22,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:22,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792184651] [2021-01-06 11:43:22,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:22,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:22,706 INFO L87 Difference]: Start difference. First operand 1613 states and 2410 transitions. Second operand 3 states. [2021-01-06 11:43:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:22,805 INFO L93 Difference]: Finished difference Result 2398 states and 3591 transitions. [2021-01-06 11:43:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:22,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2021-01-06 11:43:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:22,815 INFO L225 Difference]: With dead ends: 2398 [2021-01-06 11:43:22,815 INFO L226 Difference]: Without dead ends: 1874 [2021-01-06 11:43:22,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2021-01-06 11:43:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2021-01-06 11:43:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2805 transitions. [2021-01-06 11:43:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2805 transitions. Word has length 164 [2021-01-06 11:43:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:22,888 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2805 transitions. [2021-01-06 11:43:22,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2805 transitions. [2021-01-06 11:43:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-01-06 11:43:22,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:22,892 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2021-01-06 11:43:22,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:43:22,893 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2020286926, now seen corresponding path program 1 times [2021-01-06 11:43:22,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:22,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068951364] [2021-01-06 11:43:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:23,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068951364] [2021-01-06 11:43:23,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:23,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:23,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905016932] [2021-01-06 11:43:23,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:23,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:23,010 INFO L87 Difference]: Start difference. First operand 1874 states and 2805 transitions. Second operand 4 states. [2021-01-06 11:43:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:23,574 INFO L93 Difference]: Finished difference Result 3972 states and 5910 transitions. [2021-01-06 11:43:23,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:23,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2021-01-06 11:43:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:23,586 INFO L225 Difference]: With dead ends: 3972 [2021-01-06 11:43:23,586 INFO L226 Difference]: Without dead ends: 2119 [2021-01-06 11:43:23,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-01-06 11:43:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1874. [2021-01-06 11:43:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2798 transitions. [2021-01-06 11:43:23,669 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2798 transitions. Word has length 176 [2021-01-06 11:43:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:23,670 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2798 transitions. [2021-01-06 11:43:23,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2798 transitions. [2021-01-06 11:43:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-06 11:43:23,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:23,675 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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] [2021-01-06 11:43:23,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:43:23,675 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 163592357, now seen corresponding path program 1 times [2021-01-06 11:43:23,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:23,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924035143] [2021-01-06 11:43:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:23,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924035143] [2021-01-06 11:43:23,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:23,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:23,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978273910] [2021-01-06 11:43:23,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:23,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:23,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:23,782 INFO L87 Difference]: Start difference. First operand 1874 states and 2798 transitions. Second operand 4 states. [2021-01-06 11:43:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:24,242 INFO L93 Difference]: Finished difference Result 3958 states and 5882 transitions. [2021-01-06 11:43:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:24,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2021-01-06 11:43:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:24,253 INFO L225 Difference]: With dead ends: 3958 [2021-01-06 11:43:24,253 INFO L226 Difference]: Without dead ends: 2105 [2021-01-06 11:43:24,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2021-01-06 11:43:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1874. [2021-01-06 11:43:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2791 transitions. [2021-01-06 11:43:24,317 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2791 transitions. Word has length 177 [2021-01-06 11:43:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:24,318 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2791 transitions. [2021-01-06 11:43:24,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2791 transitions. [2021-01-06 11:43:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-06 11:43:24,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:24,323 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] [2021-01-06 11:43:24,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 11:43:24,323 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2021-01-06 11:43:24,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:24,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884670343] [2021-01-06 11:43:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:24,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884670343] [2021-01-06 11:43:24,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:24,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:24,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334788800] [2021-01-06 11:43:24,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:24,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:24,423 INFO L87 Difference]: Start difference. First operand 1874 states and 2791 transitions. Second operand 4 states. [2021-01-06 11:43:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:24,900 INFO L93 Difference]: Finished difference Result 3951 states and 5861 transitions. [2021-01-06 11:43:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:24,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2021-01-06 11:43:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:24,928 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:43:24,929 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:43:24,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 [2021-01-06 11:43:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:43:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:43:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2784 transitions. [2021-01-06 11:43:25,016 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2784 transitions. Word has length 177 [2021-01-06 11:43:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:25,017 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2784 transitions. [2021-01-06 11:43:25,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2784 transitions. [2021-01-06 11:43:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 11:43:25,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:25,021 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] [2021-01-06 11:43:25,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 11:43:25,022 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2021-01-06 11:43:25,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:25,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4910231] [2021-01-06 11:43:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:25,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4910231] [2021-01-06 11:43:25,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:25,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:25,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84899885] [2021-01-06 11:43:25,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:25,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:25,120 INFO L87 Difference]: Start difference. First operand 1874 states and 2784 transitions. Second operand 4 states. [2021-01-06 11:43:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:25,647 INFO L93 Difference]: Finished difference Result 3951 states and 5847 transitions. [2021-01-06 11:43:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:25,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 11:43:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:25,653 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:43:25,654 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:43:25,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:43:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:43:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2777 transitions. [2021-01-06 11:43:25,717 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2777 transitions. Word has length 178 [2021-01-06 11:43:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:25,717 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2777 transitions. [2021-01-06 11:43:25,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2777 transitions. [2021-01-06 11:43:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:43:25,721 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:25,722 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] [2021-01-06 11:43:25,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 11:43:25,722 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2021-01-06 11:43:25,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:25,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357416742] [2021-01-06 11:43:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:25,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357416742] [2021-01-06 11:43:25,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:25,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:25,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119869800] [2021-01-06 11:43:25,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:25,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:25,857 INFO L87 Difference]: Start difference. First operand 1874 states and 2777 transitions. Second operand 4 states. [2021-01-06 11:43:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:26,346 INFO L93 Difference]: Finished difference Result 3951 states and 5833 transitions. [2021-01-06 11:43:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:26,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2021-01-06 11:43:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:26,352 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:43:26,352 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:43:26,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:43:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:43:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2770 transitions. [2021-01-06 11:43:26,414 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2770 transitions. Word has length 179 [2021-01-06 11:43:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:26,415 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2770 transitions. [2021-01-06 11:43:26,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2770 transitions. [2021-01-06 11:43:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 11:43:26,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:26,420 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] [2021-01-06 11:43:26,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 11:43:26,420 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2021-01-06 11:43:26,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:26,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197998006] [2021-01-06 11:43:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:26,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197998006] [2021-01-06 11:43:26,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:26,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:26,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538919108] [2021-01-06 11:43:26,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:26,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:26,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:26,572 INFO L87 Difference]: Start difference. First operand 1874 states and 2770 transitions. Second operand 4 states. [2021-01-06 11:43:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:27,111 INFO L93 Difference]: Finished difference Result 3951 states and 5819 transitions. [2021-01-06 11:43:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:27,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 11:43:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:27,118 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:43:27,118 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:43:27,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:43:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:43:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2763 transitions. [2021-01-06 11:43:27,174 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2763 transitions. Word has length 180 [2021-01-06 11:43:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:27,174 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2763 transitions. [2021-01-06 11:43:27,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2763 transitions. [2021-01-06 11:43:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-06 11:43:27,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:27,179 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] [2021-01-06 11:43:27,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 11:43:27,179 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2021-01-06 11:43:27,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:27,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203586662] [2021-01-06 11:43:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:27,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203586662] [2021-01-06 11:43:27,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:27,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:27,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357582290] [2021-01-06 11:43:27,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:27,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:27,276 INFO L87 Difference]: Start difference. First operand 1874 states and 2763 transitions. Second operand 4 states. [2021-01-06 11:43:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:27,729 INFO L93 Difference]: Finished difference Result 3881 states and 5721 transitions. [2021-01-06 11:43:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2021-01-06 11:43:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:27,734 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:43:27,734 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:43:27,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:43:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:43:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2756 transitions. [2021-01-06 11:43:27,789 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2756 transitions. Word has length 181 [2021-01-06 11:43:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:27,789 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2756 transitions. [2021-01-06 11:43:27,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2756 transitions. [2021-01-06 11:43:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-06 11:43:27,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:27,794 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:27,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 11:43:27,795 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2021-01-06 11:43:27,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:27,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888693189] [2021-01-06 11:43:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:27,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888693189] [2021-01-06 11:43:27,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:27,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:27,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33723282] [2021-01-06 11:43:27,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:27,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:27,908 INFO L87 Difference]: Start difference. First operand 1874 states and 2756 transitions. Second operand 4 states. [2021-01-06 11:43:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:28,392 INFO L93 Difference]: Finished difference Result 3881 states and 5707 transitions. [2021-01-06 11:43:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:28,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2021-01-06 11:43:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:28,398 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:43:28,398 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:43:28,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:43:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:43:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2749 transitions. [2021-01-06 11:43:28,478 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2749 transitions. Word has length 185 [2021-01-06 11:43:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:28,478 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2749 transitions. [2021-01-06 11:43:28,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2749 transitions. [2021-01-06 11:43:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-06 11:43:28,482 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:28,482 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:28,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 11:43:28,482 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2021-01-06 11:43:28,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:28,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788990058] [2021-01-06 11:43:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:28,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788990058] [2021-01-06 11:43:28,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:28,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:28,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970395942] [2021-01-06 11:43:28,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:28,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:28,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:28,588 INFO L87 Difference]: Start difference. First operand 1874 states and 2749 transitions. Second operand 4 states. [2021-01-06 11:43:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:29,050 INFO L93 Difference]: Finished difference Result 3881 states and 5693 transitions. [2021-01-06 11:43:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:29,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2021-01-06 11:43:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:29,057 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:43:29,058 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:43:29,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:43:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:43:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2742 transitions. [2021-01-06 11:43:29,111 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2742 transitions. Word has length 185 [2021-01-06 11:43:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:29,112 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2742 transitions. [2021-01-06 11:43:29,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2742 transitions. [2021-01-06 11:43:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:43:29,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:29,116 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:29,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 11:43:29,116 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2021-01-06 11:43:29,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:29,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181213088] [2021-01-06 11:43:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:29,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181213088] [2021-01-06 11:43:29,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:29,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:29,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541122037] [2021-01-06 11:43:29,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:29,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:29,263 INFO L87 Difference]: Start difference. First operand 1874 states and 2742 transitions. Second operand 4 states. [2021-01-06 11:43:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:29,704 INFO L93 Difference]: Finished difference Result 3853 states and 5641 transitions. [2021-01-06 11:43:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:29,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-06 11:43:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:29,710 INFO L225 Difference]: With dead ends: 3853 [2021-01-06 11:43:29,710 INFO L226 Difference]: Without dead ends: 2000 [2021-01-06 11:43:29,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2021-01-06 11:43:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1874. [2021-01-06 11:43:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2735 transitions. [2021-01-06 11:43:29,765 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2735 transitions. Word has length 186 [2021-01-06 11:43:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:29,766 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2735 transitions. [2021-01-06 11:43:29,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2735 transitions. [2021-01-06 11:43:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:43:29,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:29,770 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:29,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 11:43:29,770 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2021-01-06 11:43:29,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:29,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150502114] [2021-01-06 11:43:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:43:29,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150502114] [2021-01-06 11:43:29,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:29,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:29,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847263833] [2021-01-06 11:43:29,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:29,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:29,875 INFO L87 Difference]: Start difference. First operand 1874 states and 2735 transitions. Second operand 4 states. [2021-01-06 11:43:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:30,331 INFO L93 Difference]: Finished difference Result 3819 states and 5583 transitions. [2021-01-06 11:43:30,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:30,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-06 11:43:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:30,337 INFO L225 Difference]: With dead ends: 3819 [2021-01-06 11:43:30,337 INFO L226 Difference]: Without dead ends: 1966 [2021-01-06 11:43:30,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-01-06 11:43:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1874. [2021-01-06 11:43:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:43:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2728 transitions. [2021-01-06 11:43:30,408 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2728 transitions. Word has length 186 [2021-01-06 11:43:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:30,408 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2728 transitions. [2021-01-06 11:43:30,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2728 transitions. [2021-01-06 11:43:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-01-06 11:43:30,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:30,413 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2021-01-06 11:43:30,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-06 11:43:30,413 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2021-01-06 11:43:30,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:30,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562763961] [2021-01-06 11:43:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:43:30,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562763961] [2021-01-06 11:43:30,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:30,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:30,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76060267] [2021-01-06 11:43:30,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:30,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:30,558 INFO L87 Difference]: Start difference. First operand 1874 states and 2728 transitions. Second operand 4 states. [2021-01-06 11:43:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:31,100 INFO L93 Difference]: Finished difference Result 4196 states and 6148 transitions. [2021-01-06 11:43:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:31,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2021-01-06 11:43:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:31,107 INFO L225 Difference]: With dead ends: 4196 [2021-01-06 11:43:31,107 INFO L226 Difference]: Without dead ends: 2343 [2021-01-06 11:43:31,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2021-01-06 11:43:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2084. [2021-01-06 11:43:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2021-01-06 11:43:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3099 transitions. [2021-01-06 11:43:31,173 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3099 transitions. Word has length 188 [2021-01-06 11:43:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:31,173 INFO L481 AbstractCegarLoop]: Abstraction has 2084 states and 3099 transitions. [2021-01-06 11:43:31,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3099 transitions. [2021-01-06 11:43:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 11:43:31,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:31,178 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:31,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 11:43:31,179 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:31,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1629892887, now seen corresponding path program 1 times [2021-01-06 11:43:31,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:31,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703835843] [2021-01-06 11:43:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:31,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703835843] [2021-01-06 11:43:31,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:31,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:31,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676250290] [2021-01-06 11:43:31,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:31,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:31,338 INFO L87 Difference]: Start difference. First operand 2084 states and 3099 transitions. Second operand 4 states. [2021-01-06 11:43:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:32,045 INFO L93 Difference]: Finished difference Result 4863 states and 7256 transitions. [2021-01-06 11:43:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:32,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2021-01-06 11:43:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:32,053 INFO L225 Difference]: With dead ends: 4863 [2021-01-06 11:43:32,053 INFO L226 Difference]: Without dead ends: 2800 [2021-01-06 11:43:32,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2021-01-06 11:43:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2280. [2021-01-06 11:43:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2021-01-06 11:43:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3442 transitions. [2021-01-06 11:43:32,127 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3442 transitions. Word has length 194 [2021-01-06 11:43:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:32,127 INFO L481 AbstractCegarLoop]: Abstraction has 2280 states and 3442 transitions. [2021-01-06 11:43:32,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3442 transitions. [2021-01-06 11:43:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 11:43:32,132 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:32,132 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:32,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-06 11:43:32,132 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:32,133 INFO L82 PathProgramCache]: Analyzing trace with hash -893401278, now seen corresponding path program 1 times [2021-01-06 11:43:32,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:32,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711853438] [2021-01-06 11:43:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:32,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711853438] [2021-01-06 11:43:32,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:32,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:32,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300218459] [2021-01-06 11:43:32,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:32,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:32,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:32,273 INFO L87 Difference]: Start difference. First operand 2280 states and 3442 transitions. Second operand 4 states. [2021-01-06 11:43:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:32,885 INFO L93 Difference]: Finished difference Result 5003 states and 7501 transitions. [2021-01-06 11:43:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:32,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2021-01-06 11:43:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:32,895 INFO L225 Difference]: With dead ends: 5003 [2021-01-06 11:43:32,895 INFO L226 Difference]: Without dead ends: 2744 [2021-01-06 11:43:32,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2021-01-06 11:43:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2287. [2021-01-06 11:43:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2021-01-06 11:43:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3449 transitions. [2021-01-06 11:43:32,972 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3449 transitions. Word has length 195 [2021-01-06 11:43:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:32,972 INFO L481 AbstractCegarLoop]: Abstraction has 2287 states and 3449 transitions. [2021-01-06 11:43:32,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3449 transitions. [2021-01-06 11:43:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 11:43:32,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:32,977 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, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:32,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-01-06 11:43:32,978 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1513066831, now seen corresponding path program 1 times [2021-01-06 11:43:32,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:32,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182652626] [2021-01-06 11:43:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:43:33,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182652626] [2021-01-06 11:43:33,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:33,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 11:43:33,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146437273] [2021-01-06 11:43:33,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:43:33,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:43:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:43:33,351 INFO L87 Difference]: Start difference. First operand 2287 states and 3449 transitions. Second operand 9 states. [2021-01-06 11:43:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:37,268 INFO L93 Difference]: Finished difference Result 9627 states and 14519 transitions. [2021-01-06 11:43:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 11:43:37,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2021-01-06 11:43:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:37,283 INFO L225 Difference]: With dead ends: 9627 [2021-01-06 11:43:37,283 INFO L226 Difference]: Without dead ends: 7361 [2021-01-06 11:43:37,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-01-06 11:43:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2021-01-06 11:43:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 3512. [2021-01-06 11:43:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2021-01-06 11:43:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5651 transitions. [2021-01-06 11:43:37,465 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5651 transitions. Word has length 199 [2021-01-06 11:43:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:37,465 INFO L481 AbstractCegarLoop]: Abstraction has 3512 states and 5651 transitions. [2021-01-06 11:43:37,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:43:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5651 transitions. [2021-01-06 11:43:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 11:43:37,472 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:37,472 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, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:37,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-01-06 11:43:37,472 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1894677619, now seen corresponding path program 1 times [2021-01-06 11:43:37,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:37,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070566191] [2021-01-06 11:43:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:43:37,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070566191] [2021-01-06 11:43:37,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:37,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:43:37,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52352319] [2021-01-06 11:43:37,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:43:37,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:43:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:43:37,779 INFO L87 Difference]: Start difference. First operand 3512 states and 5651 transitions. Second operand 7 states. [2021-01-06 11:43:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:40,994 INFO L93 Difference]: Finished difference Result 11501 states and 18202 transitions. [2021-01-06 11:43:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:43:40,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2021-01-06 11:43:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:41,004 INFO L225 Difference]: With dead ends: 11501 [2021-01-06 11:43:41,005 INFO L226 Difference]: Without dead ends: 8010 [2021-01-06 11:43:41,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:43:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2021-01-06 11:43:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 4611. [2021-01-06 11:43:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4611 states. [2021-01-06 11:43:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 4611 states and 7612 transitions. [2021-01-06 11:43:41,203 INFO L78 Accepts]: Start accepts. Automaton has 4611 states and 7612 transitions. Word has length 199 [2021-01-06 11:43:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:41,203 INFO L481 AbstractCegarLoop]: Abstraction has 4611 states and 7612 transitions. [2021-01-06 11:43:41,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:43:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4611 states and 7612 transitions. [2021-01-06 11:43:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-06 11:43:41,211 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:41,211 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, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:41,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-01-06 11:43:41,211 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash 940730833, now seen corresponding path program 1 times [2021-01-06 11:43:41,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:41,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896565592] [2021-01-06 11:43:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:43:41,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896565592] [2021-01-06 11:43:41,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:41,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:43:41,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604456704] [2021-01-06 11:43:41,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:43:41,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:41,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:43:41,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:43:41,558 INFO L87 Difference]: Start difference. First operand 4611 states and 7612 transitions. Second operand 8 states. [2021-01-06 11:43:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:44,219 INFO L93 Difference]: Finished difference Result 10873 states and 17546 transitions. [2021-01-06 11:43:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:43:44,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2021-01-06 11:43:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:44,228 INFO L225 Difference]: With dead ends: 10873 [2021-01-06 11:43:44,228 INFO L226 Difference]: Without dead ends: 6283 [2021-01-06 11:43:44,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:43:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2021-01-06 11:43:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 4079. [2021-01-06 11:43:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4079 states. [2021-01-06 11:43:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 6677 transitions. [2021-01-06 11:43:44,352 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 6677 transitions. Word has length 200 [2021-01-06 11:43:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:44,352 INFO L481 AbstractCegarLoop]: Abstraction has 4079 states and 6677 transitions. [2021-01-06 11:43:44,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:43:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 6677 transitions. [2021-01-06 11:43:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-06 11:43:44,358 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:44,358 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, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:44,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-01-06 11:43:44,358 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1620132013, now seen corresponding path program 1 times [2021-01-06 11:43:44,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:44,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572425781] [2021-01-06 11:43:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:43:44,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572425781] [2021-01-06 11:43:44,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:44,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:43:44,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632315374] [2021-01-06 11:43:44,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:43:44,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:43:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:43:44,634 INFO L87 Difference]: Start difference. First operand 4079 states and 6677 transitions. Second operand 7 states. [2021-01-06 11:43:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:47,930 INFO L93 Difference]: Finished difference Result 11207 states and 17742 transitions. [2021-01-06 11:43:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:43:47,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2021-01-06 11:43:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:47,940 INFO L225 Difference]: With dead ends: 11207 [2021-01-06 11:43:47,940 INFO L226 Difference]: Without dead ends: 7149 [2021-01-06 11:43:47,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:43:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2021-01-06 11:43:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 4086. [2021-01-06 11:43:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6670 transitions. [2021-01-06 11:43:48,067 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6670 transitions. Word has length 200 [2021-01-06 11:43:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:48,068 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6670 transitions. [2021-01-06 11:43:48,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:43:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6670 transitions. [2021-01-06 11:43:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-01-06 11:43:48,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:48,073 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:48,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-01-06 11:43:48,073 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash -606545911, now seen corresponding path program 1 times [2021-01-06 11:43:48,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:48,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591525191] [2021-01-06 11:43:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:48,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591525191] [2021-01-06 11:43:48,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:48,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:48,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004506445] [2021-01-06 11:43:48,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:48,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:48,262 INFO L87 Difference]: Start difference. First operand 4086 states and 6670 transitions. Second operand 4 states. [2021-01-06 11:43:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:48,961 INFO L93 Difference]: Finished difference Result 8580 states and 13897 transitions. [2021-01-06 11:43:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:48,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2021-01-06 11:43:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:48,967 INFO L225 Difference]: With dead ends: 8580 [2021-01-06 11:43:48,967 INFO L226 Difference]: Without dead ends: 4515 [2021-01-06 11:43:48,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 [2021-01-06 11:43:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2021-01-06 11:43:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4086. [2021-01-06 11:43:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6663 transitions. [2021-01-06 11:43:49,088 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6663 transitions. Word has length 207 [2021-01-06 11:43:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:49,089 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6663 transitions. [2021-01-06 11:43:49,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6663 transitions. [2021-01-06 11:43:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-01-06 11:43:49,095 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:49,096 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:49,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-01-06 11:43:49,096 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2073605104, now seen corresponding path program 1 times [2021-01-06 11:43:49,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:49,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146320788] [2021-01-06 11:43:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:49,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146320788] [2021-01-06 11:43:49,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:49,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:49,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753526541] [2021-01-06 11:43:49,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:49,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:49,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:49,242 INFO L87 Difference]: Start difference. First operand 4086 states and 6663 transitions. Second operand 4 states. [2021-01-06 11:43:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:49,967 INFO L93 Difference]: Finished difference Result 8566 states and 13869 transitions. [2021-01-06 11:43:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:49,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2021-01-06 11:43:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:49,973 INFO L225 Difference]: With dead ends: 8566 [2021-01-06 11:43:49,974 INFO L226 Difference]: Without dead ends: 4501 [2021-01-06 11:43:49,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-01-06 11:43:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4086. [2021-01-06 11:43:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6656 transitions. [2021-01-06 11:43:50,082 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6656 transitions. Word has length 208 [2021-01-06 11:43:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:50,083 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6656 transitions. [2021-01-06 11:43:50,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6656 transitions. [2021-01-06 11:43:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-01-06 11:43:50,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:50,088 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:50,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-01-06 11:43:50,088 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1533459632, now seen corresponding path program 1 times [2021-01-06 11:43:50,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:50,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104004014] [2021-01-06 11:43:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2021-01-06 11:43:50,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104004014] [2021-01-06 11:43:50,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:50,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:50,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052278293] [2021-01-06 11:43:50,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:50,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:50,233 INFO L87 Difference]: Start difference. First operand 4086 states and 6656 transitions. Second operand 4 states. [2021-01-06 11:43:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:50,981 INFO L93 Difference]: Finished difference Result 8685 states and 14003 transitions. [2021-01-06 11:43:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:50,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2021-01-06 11:43:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:50,987 INFO L225 Difference]: With dead ends: 8685 [2021-01-06 11:43:50,987 INFO L226 Difference]: Without dead ends: 4620 [2021-01-06 11:43:50,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 [2021-01-06 11:43:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2021-01-06 11:43:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4086. [2021-01-06 11:43:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6642 transitions. [2021-01-06 11:43:51,136 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6642 transitions. Word has length 208 [2021-01-06 11:43:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:51,136 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6642 transitions. [2021-01-06 11:43:51,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6642 transitions. [2021-01-06 11:43:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 11:43:51,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:51,142 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:51,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-01-06 11:43:51,143 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2096029627, now seen corresponding path program 1 times [2021-01-06 11:43:51,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:51,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953305627] [2021-01-06 11:43:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2021-01-06 11:43:51,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953305627] [2021-01-06 11:43:51,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:51,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:51,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186280276] [2021-01-06 11:43:51,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:51,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:51,287 INFO L87 Difference]: Start difference. First operand 4086 states and 6642 transitions. Second operand 4 states. [2021-01-06 11:43:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:51,998 INFO L93 Difference]: Finished difference Result 8629 states and 13884 transitions. [2021-01-06 11:43:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:51,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2021-01-06 11:43:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:52,004 INFO L225 Difference]: With dead ends: 8629 [2021-01-06 11:43:52,004 INFO L226 Difference]: Without dead ends: 4564 [2021-01-06 11:43:52,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2021-01-06 11:43:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4086. [2021-01-06 11:43:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6628 transitions. [2021-01-06 11:43:52,175 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6628 transitions. Word has length 209 [2021-01-06 11:43:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:52,175 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6628 transitions. [2021-01-06 11:43:52,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6628 transitions. [2021-01-06 11:43:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 11:43:52,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:52,180 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:52,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-01-06 11:43:52,181 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1669270075, now seen corresponding path program 1 times [2021-01-06 11:43:52,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:52,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087562146] [2021-01-06 11:43:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:52,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087562146] [2021-01-06 11:43:52,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:52,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:52,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569897846] [2021-01-06 11:43:52,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:52,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:52,390 INFO L87 Difference]: Start difference. First operand 4086 states and 6628 transitions. Second operand 4 states. [2021-01-06 11:43:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:53,084 INFO L93 Difference]: Finished difference Result 8566 states and 13799 transitions. [2021-01-06 11:43:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:53,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2021-01-06 11:43:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:53,090 INFO L225 Difference]: With dead ends: 8566 [2021-01-06 11:43:53,090 INFO L226 Difference]: Without dead ends: 4501 [2021-01-06 11:43:53,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-01-06 11:43:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4086. [2021-01-06 11:43:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6621 transitions. [2021-01-06 11:43:53,262 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6621 transitions. Word has length 209 [2021-01-06 11:43:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:53,262 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6621 transitions. [2021-01-06 11:43:53,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6621 transitions. [2021-01-06 11:43:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-01-06 11:43:53,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:53,268 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:53,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-01-06 11:43:53,268 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:53,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash -534944436, now seen corresponding path program 1 times [2021-01-06 11:43:53,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:53,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349402036] [2021-01-06 11:43:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:53,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349402036] [2021-01-06 11:43:53,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:53,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:53,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603630766] [2021-01-06 11:43:53,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:53,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:53,414 INFO L87 Difference]: Start difference. First operand 4086 states and 6621 transitions. Second operand 4 states. [2021-01-06 11:43:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:54,220 INFO L93 Difference]: Finished difference Result 8566 states and 13785 transitions. [2021-01-06 11:43:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:54,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2021-01-06 11:43:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:54,227 INFO L225 Difference]: With dead ends: 8566 [2021-01-06 11:43:54,228 INFO L226 Difference]: Without dead ends: 4501 [2021-01-06 11:43:54,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-01-06 11:43:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4086. [2021-01-06 11:43:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6614 transitions. [2021-01-06 11:43:54,430 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6614 transitions. Word has length 210 [2021-01-06 11:43:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:54,430 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6614 transitions. [2021-01-06 11:43:54,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6614 transitions. [2021-01-06 11:43:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-06 11:43:54,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:54,437 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:54,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-01-06 11:43:54,437 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1012622592, now seen corresponding path program 1 times [2021-01-06 11:43:54,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:54,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961918096] [2021-01-06 11:43:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:54,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961918096] [2021-01-06 11:43:54,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:54,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:54,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241578023] [2021-01-06 11:43:54,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:54,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:54,574 INFO L87 Difference]: Start difference. First operand 4086 states and 6614 transitions. Second operand 4 states. [2021-01-06 11:43:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:55,340 INFO L93 Difference]: Finished difference Result 8566 states and 13771 transitions. [2021-01-06 11:43:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:55,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2021-01-06 11:43:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:55,345 INFO L225 Difference]: With dead ends: 8566 [2021-01-06 11:43:55,345 INFO L226 Difference]: Without dead ends: 4501 [2021-01-06 11:43:55,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2021-01-06 11:43:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4086. [2021-01-06 11:43:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6607 transitions. [2021-01-06 11:43:55,456 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6607 transitions. Word has length 211 [2021-01-06 11:43:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:55,456 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6607 transitions. [2021-01-06 11:43:55,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6607 transitions. [2021-01-06 11:43:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 11:43:55,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:55,460 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:55,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-01-06 11:43:55,460 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 77189159, now seen corresponding path program 1 times [2021-01-06 11:43:55,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:55,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429320533] [2021-01-06 11:43:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-01-06 11:43:55,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429320533] [2021-01-06 11:43:55,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:55,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:55,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438883713] [2021-01-06 11:43:55,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:55,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:55,634 INFO L87 Difference]: Start difference. First operand 4086 states and 6607 transitions. Second operand 4 states. [2021-01-06 11:43:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:56,283 INFO L93 Difference]: Finished difference Result 8496 states and 13673 transitions. [2021-01-06 11:43:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:56,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2021-01-06 11:43:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:56,289 INFO L225 Difference]: With dead ends: 8496 [2021-01-06 11:43:56,289 INFO L226 Difference]: Without dead ends: 4431 [2021-01-06 11:43:56,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2021-01-06 11:43:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 4086. [2021-01-06 11:43:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:43:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6600 transitions. [2021-01-06 11:43:56,415 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6600 transitions. Word has length 212 [2021-01-06 11:43:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:56,415 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 6600 transitions. [2021-01-06 11:43:56,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6600 transitions. [2021-01-06 11:43:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-01-06 11:43:56,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:56,419 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:56,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-01-06 11:43:56,419 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -11911447, now seen corresponding path program 1 times [2021-01-06 11:43:56,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:56,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98139009] [2021-01-06 11:43:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-01-06 11:43:56,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98139009] [2021-01-06 11:43:56,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:56,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:43:56,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158842300] [2021-01-06 11:43:56,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:43:56,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:43:56,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:56,597 INFO L87 Difference]: Start difference. First operand 4086 states and 6600 transitions. Second operand 5 states. [2021-01-06 11:43:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:57,459 INFO L93 Difference]: Finished difference Result 9035 states and 14502 transitions. [2021-01-06 11:43:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:57,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2021-01-06 11:43:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:57,464 INFO L225 Difference]: With dead ends: 9035 [2021-01-06 11:43:57,465 INFO L226 Difference]: Without dead ends: 4970 [2021-01-06 11:43:57,467 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 [2021-01-06 11:43:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4970 states. [2021-01-06 11:43:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4970 to 4345. [2021-01-06 11:43:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4345 states. [2021-01-06 11:43:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 7062 transitions. [2021-01-06 11:43:57,608 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 7062 transitions. Word has length 214 [2021-01-06 11:43:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:57,608 INFO L481 AbstractCegarLoop]: Abstraction has 4345 states and 7062 transitions. [2021-01-06 11:43:57,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:43:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 7062 transitions. [2021-01-06 11:43:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-06 11:43:57,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:57,613 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:43:57,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-01-06 11:43:57,613 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 911044471, now seen corresponding path program 1 times [2021-01-06 11:43:57,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:57,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111250981] [2021-01-06 11:43:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-01-06 11:43:57,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111250981] [2021-01-06 11:43:57,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:57,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:43:57,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351899191] [2021-01-06 11:43:57,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:43:57,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:43:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:57,790 INFO L87 Difference]: Start difference. First operand 4345 states and 7062 transitions. Second operand 5 states. [2021-01-06 11:43:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:58,645 INFO L93 Difference]: Finished difference Result 9280 states and 14929 transitions. [2021-01-06 11:43:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:58,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-06 11:43:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:58,658 INFO L225 Difference]: With dead ends: 9280 [2021-01-06 11:43:58,658 INFO L226 Difference]: Without dead ends: 4956 [2021-01-06 11:43:58,663 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 [2021-01-06 11:43:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2021-01-06 11:43:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4282. [2021-01-06 11:43:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4282 states. [2021-01-06 11:43:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 6936 transitions. [2021-01-06 11:43:58,850 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 6936 transitions. Word has length 215 [2021-01-06 11:43:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:58,850 INFO L481 AbstractCegarLoop]: Abstraction has 4282 states and 6936 transitions. [2021-01-06 11:43:58,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:43:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 6936 transitions. [2021-01-06 11:43:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-01-06 11:43:58,856 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:58,856 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-01-06 11:43:58,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-01-06 11:43:58,856 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1214559478, now seen corresponding path program 1 times [2021-01-06 11:43:58,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:58,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453127831] [2021-01-06 11:43:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 151 proven. 297 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:59,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453127831] [2021-01-06 11:43:59,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983065432] [2021-01-06 11:43:59,783 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 [2021-01-06 11:44:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:00,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-06 11:44:00,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:44:00,430 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,431 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 [2021-01-06 11:44:00,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:00,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,521 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_163|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2021-01-06 11:44:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:00,574 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 [2021-01-06 11:44:00,575 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:00,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,624 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:00,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,777 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 25 [2021-01-06 11:44:00,780 INFO L348 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2021-01-06 11:44:00,781 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 7 case distinctions, treesize of input 52 treesize of output 46 [2021-01-06 11:44:00,789 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:00,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,823 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. [2021-01-06 11:44:00,824 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2021-01-06 11:44:00,931 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:44:00,932 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 [2021-01-06 11:44:00,935 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:00,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:00,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:00,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:44:01,045 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:44:01,045 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 [2021-01-06 11:44:01,049 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,061 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:44:01,074 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_166|]} [2021-01-06 11:44:01,078 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:01,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,183 INFO L348 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2021-01-06 11:44:01,184 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 7 case distinctions, treesize of input 77 treesize of output 53 [2021-01-06 11:44:01,187 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,203 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,203 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2021-01-06 11:44:01,295 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:44:01,295 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 [2021-01-06 11:44:01,298 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,309 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:44:01,358 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:44:01,359 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 [2021-01-06 11:44:01,361 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,372 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:01,373 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:44:01,498 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_169|]} [2021-01-06 11:44:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:01,506 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 [2021-01-06 11:44:01,510 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:01,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:01,801 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-06 11:44:01,802 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2021-01-06 11:44:01,802 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 [2021-01-06 11:44:01,820 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:01,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:01,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 2, 2, 1] term [2021-01-06 11:44:01,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 11:44:01,837 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 11:44:01,839 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:01,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:01,844 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,846 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,849 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,851 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:01,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:01,860 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,864 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,870 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,873 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,878 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,886 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,888 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,890 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,896 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,901 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,903 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:01,908 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,911 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:01,922 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:01,924 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:01,926 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:01,930 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,935 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:01,939 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,944 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,946 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:01,956 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,961 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:01,965 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:01,967 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,972 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,978 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,979 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,981 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:01,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:01,987 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,990 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:01,995 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:01,997 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,001 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,005 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,008 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:02,014 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,018 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,023 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 11:44:02,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:02,028 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,030 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,031 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,033 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,036 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,041 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,046 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,050 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,054 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 11:44:02,067 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:02,069 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,071 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,073 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,077 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,082 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,083 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,087 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,091 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,092 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,096 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:02,098 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,100 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,104 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,108 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,109 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,114 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,116 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,120 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:02,129 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,131 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,133 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,134 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,137 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,141 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,142 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,147 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,148 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,153 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,157 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,159 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,164 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 11:44:02,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:02,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:02,169 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,174 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,176 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,182 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:02,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:02,189 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,192 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,195 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,198 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,202 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,206 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,208 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,209 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,213 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,219 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,221 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:02,227 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,230 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:02,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,247 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,249 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:02,252 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,256 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,259 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,263 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,264 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:02,269 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,273 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,276 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,279 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,290 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,292 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,293 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:02,298 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,300 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,304 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,305 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,308 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,320 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,321 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:02,325 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,328 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,331 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 11:44:02,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:02,335 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,336 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,337 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,338 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,341 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,342 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,345 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,350 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,351 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,354 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,357 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,358 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 11:44:02,365 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:02,367 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,368 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,371 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,377 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,383 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,388 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,391 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,397 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,398 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,403 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:02,405 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,407 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,411 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,415 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,417 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,425 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,427 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,430 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:02,452 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,453 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,454 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,456 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,459 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,462 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,463 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:02,467 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:02,469 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,471 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,474 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,478 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:02,480 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:02,489 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:02,531 INFO L625 ElimStorePlain]: treesize reduction 68, result has 54.1 percent of original size [2021-01-06 11:44:02,533 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:02,533 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2021-01-06 11:44:02,630 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_170|]} [2021-01-06 11:44:02,635 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:02,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:02,945 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2021-01-06 11:44:02,946 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2021-01-06 11:44:02,947 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 [2021-01-06 11:44:02,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:44:02,953 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:02,956 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:02,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:02,975 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. [2021-01-06 11:44:02,975 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2021-01-06 11:44:03,344 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2021-01-06 11:44:03,345 INFO L348 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2021-01-06 11:44:03,345 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 15 case distinctions, treesize of input 99 treesize of output 111 [2021-01-06 11:44:03,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 11:44:03,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:03,354 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:03,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:03,371 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. [2021-01-06 11:44:03,371 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2021-01-06 11:44:03,383 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_159|], 30=[|v_#memory_$Pointer$.base_172|]} [2021-01-06 11:44:03,390 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 31 treesize of output 21 [2021-01-06 11:44:03,392 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:03,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:03,429 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2021-01-06 11:44:03,432 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:03,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:03,968 WARN L197 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2021-01-06 11:44:03,969 INFO L348 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2021-01-06 11:44:03,974 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 15 case distinctions, treesize of input 150 treesize of output 507 [2021-01-06 11:44:03,984 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 11:44:03,985 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 11:44:03,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:03,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:03,988 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:03,989 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:03,990 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:03,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:03,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:03,995 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 11:44:03,996 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:03,997 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:04,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:44:04,002 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,003 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,004 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,007 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:04,008 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:04,011 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,012 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,014 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:04,015 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:04,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:04,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 5, 3, 4, 3, 4, 3, 3, 3, 3, 5, 3, 4, 3, 3, 2, 1] term [2021-01-06 11:44:04,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 11:44:04,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,028 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:04,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,030 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,031 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,034 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,036 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,037 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,040 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,042 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,044 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,045 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,046 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,051 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,052 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:04,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:04,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:04,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:04,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:04,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,064 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,066 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,069 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,070 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,073 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,073 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,075 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,077 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,080 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,081 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,084 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,085 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,087 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,088 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,091 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,092 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,093 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,095 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,098 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,101 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:04,109 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,111 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,112 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,113 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,115 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,117 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,120 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,122 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,125 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,126 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,127 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:04,129 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,132 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,134 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,137 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,139 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,142 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,144 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,146 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,147 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:04,148 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,151 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,153 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:04,156 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,159 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:04,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:04,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:04,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:04,196 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,332 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-01-06 11:44:04,332 INFO L625 ElimStorePlain]: treesize reduction 698, result has 15.8 percent of original size [2021-01-06 11:44:04,335 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. [2021-01-06 11:44:04,336 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:119 [2021-01-06 11:44:04,394 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_int_179|], 12=[|v_#memory_$Pointer$.base_173|]} [2021-01-06 11:44:04,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-01-06 11:44:04,405 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,440 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 34 [2021-01-06 11:44:04,443 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2021-01-06 11:44:04,488 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,507 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,508 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,508 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2021-01-06 11:44:04,636 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_int_180|], 12=[|v_#memory_$Pointer$.base_174|]} [2021-01-06 11:44:04,642 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 53 treesize of output 41 [2021-01-06 11:44:04,645 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:04,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,692 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2021-01-06 11:44:04,693 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:04,748 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2021-01-06 11:44:04,751 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:04,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:04,778 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:04,778 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:86 [2021-01-06 11:44:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:05,016 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2021-01-06 11:44:05,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:05,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:05,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:05,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2021-01-06 11:44:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 334 proven. 86 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:44:05,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:44:05,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2021-01-06 11:44:05,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740426219] [2021-01-06 11:44:05,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 11:44:05,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 11:44:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-01-06 11:44:05,693 INFO L87 Difference]: Start difference. First operand 4282 states and 6936 transitions. Second operand 19 states. [2021-01-06 11:44:20,124 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-01-06 11:44:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:20,969 INFO L93 Difference]: Finished difference Result 24449 states and 38217 transitions. [2021-01-06 11:44:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 11:44:20,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 228 [2021-01-06 11:44:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:21,049 INFO L225 Difference]: With dead ends: 24449 [2021-01-06 11:44:21,049 INFO L226 Difference]: Without dead ends: 20188 [2021-01-06 11:44:21,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 11:44:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20188 states. [2021-01-06 11:44:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20188 to 10938. [2021-01-06 11:44:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10938 states. [2021-01-06 11:44:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10938 states to 10938 states and 17680 transitions. [2021-01-06 11:44:21,828 INFO L78 Accepts]: Start accepts. Automaton has 10938 states and 17680 transitions. Word has length 228 [2021-01-06 11:44:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:21,828 INFO L481 AbstractCegarLoop]: Abstraction has 10938 states and 17680 transitions. [2021-01-06 11:44:21,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 11:44:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 10938 states and 17680 transitions. [2021-01-06 11:44:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-01-06 11:44:21,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:21,847 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-01-06 11:44:22,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2021-01-06 11:44:22,062 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1047013772, now seen corresponding path program 1 times [2021-01-06 11:44:22,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:22,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829831252] [2021-01-06 11:44:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 270 proven. 92 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-01-06 11:44:22,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829831252] [2021-01-06 11:44:22,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688572812] [2021-01-06 11:44:22,846 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:44:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:23,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-06 11:44:23,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:44:23,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-01-06 11:44:23,208 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,266 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_180|], 2=[|v_#memory_$Pointer$.base_176|, |v_#memory_$Pointer$.base_175|]} [2021-01-06 11:44:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,304 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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 [2021-01-06 11:44:23,305 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,346 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:23,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,477 INFO L348 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2021-01-06 11:44:23,478 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2021-01-06 11:44:23,480 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,501 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. [2021-01-06 11:44:23,501 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:10 [2021-01-06 11:44:23,541 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:44:23,542 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,548 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:44:23,593 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:44:23,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,599 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:44:23,608 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.base_183|, |v_#memory_$Pointer$.base_177|]} [2021-01-06 11:44:23,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,618 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 [2021-01-06 11:44:23,619 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,662 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,686 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,688 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,700 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,700 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:29 [2021-01-06 11:44:23,815 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_184|], 12=[|v_#memory_int_182|]} [2021-01-06 11:44:23,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,824 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,826 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,859 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:23,862 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,877 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,877 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:39 [2021-01-06 11:44:23,919 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_185|], 12=[|v_#memory_int_183|]} [2021-01-06 11:44:23,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,929 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:44:23,930 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:23,959 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:23,962 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:23,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:23,978 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:39 [2021-01-06 11:44:24,063 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_162|], 12=[|v_#memory_int_184|, |v_#memory_$Pointer$.base_186|]} [2021-01-06 11:44:24,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:24,070 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 99 treesize of output 75 [2021-01-06 11:44:24,073 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:24,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:24,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:24,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:24,219 INFO L348 Elim1Store]: treesize reduction 120, result has 40.6 percent of original size [2021-01-06 11:44:24,220 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 92 [2021-01-06 11:44:24,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,226 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:24,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:24,492 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2021-01-06 11:44:24,493 INFO L348 Elim1Store]: treesize reduction 46, result has 73.6 percent of original size [2021-01-06 11:44:24,494 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 205 [2021-01-06 11:44:24,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-06 11:44:24,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:24,502 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:24,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:24,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,505 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:24,510 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:24,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,515 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:44:24,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:44:24,516 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:24,517 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:24,518 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,521 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,522 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,523 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,526 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:24,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,528 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,528 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,529 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,532 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,533 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,534 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:24,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,542 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,551 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:24,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,552 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:24,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:24,556 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:24,779 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-01-06 11:44:24,780 INFO L625 ElimStorePlain]: treesize reduction 79, result has 70.3 percent of original size [2021-01-06 11:44:24,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,854 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:24,854 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:137, output treesize:182 [2021-01-06 11:44:24,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:24,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:24,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:24,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:24,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:24,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:44:27,261 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 11:44:29,370 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2021-01-06 11:44:29,376 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2021-01-06 11:44:29,380 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 4 disjuncts [2021-01-06 11:44:29,400 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_178|], 18=[|v_#memory_int_185|], 182=[|v_#memory_$Pointer$.base_187|]} [2021-01-06 11:44:29,410 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:29,427 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:29,451 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:29,469 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:29,517 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:29,556 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:31,840 WARN L197 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 115 [2021-01-06 11:44:31,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:31,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:31,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:32,267 INFO L244 Elim1Store]: Index analysis took 379 ms [2021-01-06 11:44:32,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-01-06 11:44:32,404 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:32,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:32,639 INFO L244 Elim1Store]: Index analysis took 183 ms [2021-01-06 11:44:32,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-01-06 11:44:32,747 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:32,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:32,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:32,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,023 INFO L244 Elim1Store]: Index analysis took 228 ms [2021-01-06 11:44:33,211 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2021-01-06 11:44:33,212 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:33,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,537 INFO L244 Elim1Store]: Index analysis took 261 ms [2021-01-06 11:44:33,701 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2021-01-06 11:44:33,706 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:33,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:34,124 INFO L244 Elim1Store]: Index analysis took 355 ms [2021-01-06 11:44:34,268 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-01-06 11:44:34,277 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:34,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:34,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:34,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:34,455 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-01-06 11:44:34,461 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:35,650 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 109 [2021-01-06 11:44:35,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:35,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,790 INFO L244 Elim1Store]: Index analysis took 108 ms [2021-01-06 11:44:35,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,869 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:35,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 62 [2021-01-06 11:44:35,874 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:35,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:35,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,019 INFO L244 Elim1Store]: Index analysis took 121 ms [2021-01-06 11:44:36,307 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-01-06 11:44:36,307 INFO L348 Elim1Store]: treesize reduction 39, result has 76.9 percent of original size [2021-01-06 11:44:36,308 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 173 [2021-01-06 11:44:36,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-06 11:44:36,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:36,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:44:36,313 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:36,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:44:36,314 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:36,320 INFO L547 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,624 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-01-06 11:44:36,625 INFO L348 Elim1Store]: treesize reduction 59, result has 66.3 percent of original size [2021-01-06 11:44:36,625 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 159 [2021-01-06 11:44:36,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-06 11:44:36,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:36,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:44:36,631 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:36,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:44:36,632 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:36,636 INFO L547 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:36,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,904 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2021-01-06 11:44:36,905 INFO L348 Elim1Store]: treesize reduction 39, result has 72.5 percent of original size [2021-01-06 11:44:36,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 155 [2021-01-06 11:44:36,914 INFO L547 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:36,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:36,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,289 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2021-01-06 11:44:37,290 INFO L348 Elim1Store]: treesize reduction 78, result has 70.8 percent of original size [2021-01-06 11:44:37,291 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 229 [2021-01-06 11:44:37,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-06 11:44:37,297 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:44:37,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-06 11:44:37,297 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:44:37,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-06 11:44:37,298 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:37,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:44:37,299 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:37,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:44:37,299 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:37,306 INFO L547 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:37,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:37,459 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2021-01-06 11:44:37,460 INFO L348 Elim1Store]: treesize reduction 39, result has 69.0 percent of original size [2021-01-06 11:44:37,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 124 [2021-01-06 11:44:37,464 INFO L547 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:37,846 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2021-01-06 11:44:37,847 INFO L625 ElimStorePlain]: treesize reduction 117, result has 78.8 percent of original size [2021-01-06 11:44:37,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2021-01-06 11:44:37,867 INFO L244 ElimStorePlain]: Needed 19 recursive calls to eliminate 11 variables, input treesize:723, output treesize:307 [2021-01-06 11:44:38,216 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-01-06 11:44:38,748 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2021-01-06 11:44:38,753 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2021-01-06 11:44:38,756 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2021-01-06 11:44:38,765 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_int_186|], 90=[|v_#memory_$Pointer$.base_188|]} [2021-01-06 11:44:38,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,823 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:38,825 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:38,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,884 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:38,887 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:38,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,928 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 0 case distinctions, treesize of input 32 treesize of output 25 [2021-01-06 11:44:38,931 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:38,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:38,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:38,992 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-01-06 11:44:39,022 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,206 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 11:44:39,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:39,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,232 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-01-06 11:44:39,235 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,351 INFO L348 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2021-01-06 11:44:39,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 82 [2021-01-06 11:44:39,355 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,512 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-01-06 11:44:39,513 INFO L348 Elim1Store]: treesize reduction 28, result has 71.4 percent of original size [2021-01-06 11:44:39,514 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 110 [2021-01-06 11:44:39,519 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,747 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-01-06 11:44:39,748 INFO L348 Elim1Store]: treesize reduction 56, result has 68.7 percent of original size [2021-01-06 11:44:39,749 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 154 [2021-01-06 11:44:39,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-06 11:44:39,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:44:39,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-06 11:44:39,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:39,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:44:39,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:44:39,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:44:39,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:44:39,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:44:39,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:39,760 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:39,789 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:39,789 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2021-01-06 11:44:39,792 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:40,085 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-01-06 11:44:40,086 INFO L625 ElimStorePlain]: treesize reduction 93, result has 78.6 percent of original size [2021-01-06 11:44:40,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2021-01-06 11:44:40,091 INFO L244 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:502, output treesize:342 [2021-01-06 11:44:46,411 WARN L197 SmtUtils]: Spent 6.26 s on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 11:44:46,423 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_int_187|], 20=[|v_#memory_$Pointer$.base_189|]} [2021-01-06 11:44:46,429 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 102 [2021-01-06 11:44:46,431 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,477 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2021-01-06 11:44:46,479 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,669 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 11:44:46,670 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,670 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 364 [2021-01-06 11:44:46,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-06 11:44:46,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:44:46,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:44:46,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:44:46,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:44:46,683 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:44:46,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 3, 3, 2, 3, 1] term [2021-01-06 11:44:46,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 11:44:46,694 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,759 INFO L625 ElimStorePlain]: treesize reduction 46, result has 68.7 percent of original size [2021-01-06 11:44:46,761 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,762 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:197, output treesize:68 [2021-01-06 11:44:46,832 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_164|], 6=[|v_#memory_$Pointer$.base_190|], 20=[|v_#memory_int_188|]} [2021-01-06 11:44:46,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,840 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-01-06 11:44:46,841 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2021-01-06 11:44:46,890 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:46,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2021-01-06 11:44:46,934 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:46,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:46,956 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:119, output treesize:68 [2021-01-06 11:44:47,082 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_191|], 20=[|v_#memory_int_189|]} [2021-01-06 11:44:47,088 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 53 treesize of output 41 [2021-01-06 11:44:47,090 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:47,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:47,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 54 [2021-01-06 11:44:47,137 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:47,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:47,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,176 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2021-01-06 11:44:47,179 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:47,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:47,200 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:44:47,200 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2021-01-06 11:44:47,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:47,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 16 [2021-01-06 11:44:47,420 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:47,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:47,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:44:47,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:23 [2021-01-06 11:44:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 199 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:44:48,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:44:48,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2021-01-06 11:44:48,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319169011] [2021-01-06 11:44:48,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 11:44:48,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 11:44:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=293, Unknown=1, NotChecked=0, Total=342 [2021-01-06 11:44:48,248 INFO L87 Difference]: Start difference. First operand 10938 states and 17680 transitions. Second operand 19 states. [2021-01-06 11:44:58,967 WARN L197 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2021-01-06 11:45:07,938 WARN L197 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2021-01-06 11:45:12,305 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-01-06 11:45:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:13,112 INFO L93 Difference]: Finished difference Result 30109 states and 48134 transitions. [2021-01-06 11:45:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 11:45:13,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 228 [2021-01-06 11:45:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:13,171 INFO L225 Difference]: With dead ends: 30109 [2021-01-06 11:45:13,171 INFO L226 Difference]: Without dead ends: 19192 [2021-01-06 11:45:13,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=204, Invalid=917, Unknown=1, NotChecked=0, Total=1122 [2021-01-06 11:45:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19192 states. [2021-01-06 11:45:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19192 to 16383. [2021-01-06 11:45:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16383 states. [2021-01-06 11:45:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16383 states to 16383 states and 26428 transitions. [2021-01-06 11:45:13,927 INFO L78 Accepts]: Start accepts. Automaton has 16383 states and 26428 transitions. Word has length 228 [2021-01-06 11:45:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:13,927 INFO L481 AbstractCegarLoop]: Abstraction has 16383 states and 26428 transitions. [2021-01-06 11:45:13,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 11:45:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16383 states and 26428 transitions. [2021-01-06 11:45:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-01-06 11:45:13,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:13,941 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:14,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2021-01-06 11:45:14,156 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2011306122, now seen corresponding path program 1 times [2021-01-06 11:45:14,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:14,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757866962] [2021-01-06 11:45:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 154 proven. 297 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:15,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757866962] [2021-01-06 11:45:15,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249730295] [2021-01-06 11:45:15,231 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-06 11:45:15,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:15,695 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:15,696 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 [2021-01-06 11:45:15,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:15,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:15,793 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_196|], 2=[|v_#memory_$Pointer$.base_193|, |v_#memory_$Pointer$.base_192|]} [2021-01-06 11:45:15,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:15,848 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 [2021-01-06 11:45:15,850 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:15,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:15,912 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:15,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,037 INFO L348 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2021-01-06 11:45:16,038 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 7 case distinctions, treesize of input 52 treesize of output 46 [2021-01-06 11:45:16,040 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,064 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. [2021-01-06 11:45:16,065 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2021-01-06 11:45:16,162 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:16,162 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 [2021-01-06 11:45:16,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,179 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,179 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:16,251 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:16,251 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 [2021-01-06 11:45:16,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,266 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:16,276 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_194|], 12=[|v_#memory_$Pointer$.base_199|]} [2021-01-06 11:45:16,280 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:16,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,398 INFO L348 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2021-01-06 11:45:16,399 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 7 case distinctions, treesize of input 77 treesize of output 53 [2021-01-06 11:45:16,402 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,420 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2021-01-06 11:45:16,519 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:16,520 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 [2021-01-06 11:45:16,522 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,536 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,536 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:16,589 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:16,589 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 [2021-01-06 11:45:16,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:16,603 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:16,604 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:16,672 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_166|], 20=[|v_#memory_$Pointer$.base_202|]} [2021-01-06 11:45:16,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:16,679 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 [2021-01-06 11:45:16,682 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:16,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:17,010 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-06 11:45:17,011 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2021-01-06 11:45:17,011 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 [2021-01-06 11:45:17,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:17,019 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:17,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:17,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:17,030 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:17,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:17,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:17,035 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,037 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:17,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:17,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:17,042 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,043 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:17,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:17,044 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:17,045 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,046 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:17,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:17,049 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,050 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 3, 3, 1] term [2021-01-06 11:45:17,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 11:45:17,054 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:17,054 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:17,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:17,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:17,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:17,061 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:17,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:17,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:17,076 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2021-01-06 11:45:17,149 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_195|], 30=[|v_#memory_$Pointer$.base_203|]} [2021-01-06 11:45:17,154 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:17,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:17,507 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2021-01-06 11:45:17,508 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2021-01-06 11:45:17,508 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 [2021-01-06 11:45:17,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:45:17,512 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:17,515 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:17,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:17,537 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. [2021-01-06 11:45:17,537 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2021-01-06 11:45:17,907 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2021-01-06 11:45:17,908 INFO L348 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2021-01-06 11:45:17,908 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 15 case distinctions, treesize of input 99 treesize of output 111 [2021-01-06 11:45:17,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 11:45:17,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:17,914 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:17,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:17,931 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. [2021-01-06 11:45:17,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2021-01-06 11:45:17,940 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_190|], 2=[|v_#memory_$Pointer$.offset_167|], 30=[|v_#memory_$Pointer$.base_205|]} [2021-01-06 11:45:17,949 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 31 treesize of output 21 [2021-01-06 11:45:17,950 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:17,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:18,059 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2021-01-06 11:45:18,061 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:18,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:18,679 WARN L197 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2021-01-06 11:45:18,680 INFO L348 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2021-01-06 11:45:18,680 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 15 case distinctions, treesize of input 150 treesize of output 507 [2021-01-06 11:45:18,689 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:18,690 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:18,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[16, 3, 2, 2, 3, 3, 1] term [2021-01-06 11:45:18,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-06 11:45:18,698 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,699 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,700 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,701 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:18,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:18,708 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,709 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,711 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,713 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,714 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,719 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,722 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,723 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,725 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,726 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,728 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,732 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,733 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,733 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:18,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,741 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,750 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,752 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,757 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,758 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,759 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,760 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:18,764 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,765 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,768 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,769 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,770 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:18,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:18,771 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,774 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,780 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,783 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,784 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,786 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,788 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,789 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,790 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,791 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,796 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,798 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,801 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,804 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,805 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,807 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,814 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,815 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,816 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,817 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,822 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,825 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,826 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,827 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:18,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,831 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,833 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,837 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,841 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,843 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 11:45:18,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:45:18,845 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,845 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,847 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,851 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,852 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,853 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,854 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,855 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:18,858 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,859 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,861 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,863 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,863 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:18,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:18,865 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:18,867 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,873 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,876 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,877 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,877 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,879 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,881 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:18,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:18,883 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:18,884 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:18,890 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:18,948 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,073 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2021-01-06 11:45:19,074 INFO L625 ElimStorePlain]: treesize reduction 408, result has 24.3 percent of original size [2021-01-06 11:45:19,078 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. [2021-01-06 11:45:19,079 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:119 [2021-01-06 11:45:19,138 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_191|, |v_#memory_$Pointer$.offset_168|], 12=[|v_#memory_$Pointer$.base_206|]} [2021-01-06 11:45:19,144 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 34 [2021-01-06 11:45:19,146 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-01-06 11:45:19,193 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,234 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2021-01-06 11:45:19,236 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,255 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,255 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2021-01-06 11:45:19,372 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_169|], 6=[|v_#memory_int_192|, |v_#memory_$Pointer$.base_207|]} [2021-01-06 11:45:19,378 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 53 treesize of output 41 [2021-01-06 11:45:19,379 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:19,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2021-01-06 11:45:19,415 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:19,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 41 [2021-01-06 11:45:19,454 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:19,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:19,469 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:38 [2021-01-06 11:45:19,692 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:19,693 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 43 treesize of output 13 [2021-01-06 11:45:19,695 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:19,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:19,704 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2021-01-06 11:45:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 275 proven. 148 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:20,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:20,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2021-01-06 11:45:20,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705050701] [2021-01-06 11:45:20,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 11:45:20,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 11:45:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-01-06 11:45:20,361 INFO L87 Difference]: Start difference. First operand 16383 states and 26428 transitions. Second operand 17 states. [2021-01-06 11:45:34,564 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-06 11:45:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:36,325 INFO L93 Difference]: Finished difference Result 45820 states and 72558 transitions. [2021-01-06 11:45:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 11:45:36,326 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 229 [2021-01-06 11:45:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:36,368 INFO L225 Difference]: With dead ends: 45820 [2021-01-06 11:45:36,368 INFO L226 Difference]: Without dead ends: 29458 [2021-01-06 11:45:36,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2021-01-06 11:45:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29458 states. [2021-01-06 11:45:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29458 to 16257. [2021-01-06 11:45:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16257 states. [2021-01-06 11:45:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16257 states to 16257 states and 26190 transitions. [2021-01-06 11:45:37,204 INFO L78 Accepts]: Start accepts. Automaton has 16257 states and 26190 transitions. Word has length 229 [2021-01-06 11:45:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:37,204 INFO L481 AbstractCegarLoop]: Abstraction has 16257 states and 26190 transitions. [2021-01-06 11:45:37,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 11:45:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16257 states and 26190 transitions. [2021-01-06 11:45:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-01-06 11:45:37,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:37,224 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:37,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-01-06 11:45:37,438 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash 408818485, now seen corresponding path program 1 times [2021-01-06 11:45:37,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:37,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800839561] [2021-01-06 11:45:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-01-06 11:45:37,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800839561] [2021-01-06 11:45:37,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546371938] [2021-01-06 11:45:37,803 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:38,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-06 11:45:38,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:38,140 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:45:38,141 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:45:38,142 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,149 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,149 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:45:38,197 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:38,198 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:45:38,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,203 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,203 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:45:38,300 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 [2021-01-06 11:45:38,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:45:38,332 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_208|, |v_#memory_$Pointer$.offset_170|], 2=[|v_#memory_int_195|]} [2021-01-06 11:45:38,336 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 19 [2021-01-06 11:45:38,337 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:38,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,352 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 19 treesize of output 13 [2021-01-06 11:45:38,353 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:38,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,389 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,389 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:45:38,392 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,427 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:45:38,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:38,429 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:38,429 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:45:38,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:38,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:38,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:38,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:38,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:38,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:45:38,499 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:38,544 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,545 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 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:45:38,547 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,612 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:45:38,615 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:45:38,615 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:45:38,803 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:38,804 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:45:38,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:38,810 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:38,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2021-01-06 11:45:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 330 proven. 51 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-01-06 11:45:38,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:38,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-01-06 11:45:38,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985161124] [2021-01-06 11:45:38,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 11:45:38,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 11:45:38,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:45:38,927 INFO L87 Difference]: Start difference. First operand 16257 states and 26190 transitions. Second operand 16 states. [2021-01-06 11:45:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:48,791 INFO L93 Difference]: Finished difference Result 44336 states and 69916 transitions. [2021-01-06 11:45:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:45:48,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 231 [2021-01-06 11:45:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:48,830 INFO L225 Difference]: With dead ends: 44336 [2021-01-06 11:45:48,830 INFO L226 Difference]: Without dead ends: 28100 [2021-01-06 11:45:48,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-01-06 11:45:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28100 states. [2021-01-06 11:45:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28100 to 16852. [2021-01-06 11:45:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2021-01-06 11:45:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 27212 transitions. [2021-01-06 11:45:49,847 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 27212 transitions. Word has length 231 [2021-01-06 11:45:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:49,847 INFO L481 AbstractCegarLoop]: Abstraction has 16852 states and 27212 transitions. [2021-01-06 11:45:49,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 11:45:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 27212 transitions. [2021-01-06 11:45:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-06 11:45:49,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:49,860 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:50,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:50,061 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1962803991, now seen corresponding path program 1 times [2021-01-06 11:45:50,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:50,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405015733] [2021-01-06 11:45:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 340 proven. 1 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-01-06 11:45:50,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405015733] [2021-01-06 11:45:50,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136156303] [2021-01-06 11:45:50,377 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:50,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-06 11:45:50,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:50,717 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:45:50,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:45:50,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:50,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,728 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:45:50,789 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:50,790 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:45:50,792 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:50,796 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:45:50,916 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 [2021-01-06 11:45:50,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:50,921 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:50,921 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:45:50,946 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.offset_171|], 2=[|v_#memory_int_199|]} [2021-01-06 11:45:50,951 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 19 [2021-01-06 11:45:50,953 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:50,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:50,966 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 19 treesize of output 13 [2021-01-06 11:45:50,967 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:50,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:51,004 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:51,004 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:45:51,007 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:51,044 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:45:51,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:51,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:51,047 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:45:51,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:51,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:51,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:51,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:51,142 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:51,142 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 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:45:51,145 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:51,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:51,156 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:45:51,158 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:51,228 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:45:51,231 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:45:51,231 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:45:51,434 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:51,435 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:45:51,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:51,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:51,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:51,439 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2021-01-06 11:45:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 334 proven. 51 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-01-06 11:45:51,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:51,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-01-06 11:45:51,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105723815] [2021-01-06 11:45:51,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 11:45:51,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 11:45:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:45:51,631 INFO L87 Difference]: Start difference. First operand 16852 states and 27212 transitions. Second operand 16 states. [2021-01-06 11:45:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:59,252 INFO L93 Difference]: Finished difference Result 43958 states and 69211 transitions. [2021-01-06 11:45:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:45:59,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 232 [2021-01-06 11:45:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:59,284 INFO L225 Difference]: With dead ends: 43958 [2021-01-06 11:45:59,285 INFO L226 Difference]: Without dead ends: 27127 [2021-01-06 11:45:59,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-01-06 11:45:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27127 states. [2021-01-06 11:46:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27127 to 16880. [2021-01-06 11:46:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16880 states. [2021-01-06 11:46:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16880 states to 16880 states and 27219 transitions. [2021-01-06 11:46:00,294 INFO L78 Accepts]: Start accepts. Automaton has 16880 states and 27219 transitions. Word has length 232 [2021-01-06 11:46:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:00,295 INFO L481 AbstractCegarLoop]: Abstraction has 16880 states and 27219 transitions. [2021-01-06 11:46:00,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 11:46:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16880 states and 27219 transitions. [2021-01-06 11:46:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-01-06 11:46:00,310 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:00,310 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2021-01-06 11:46:00,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:00,518 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1687624652, now seen corresponding path program 1 times [2021-01-06 11:46:00,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:00,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63507873] [2021-01-06 11:46:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 360 proven. 37 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-01-06 11:46:00,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63507873] [2021-01-06 11:46:00,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448578273] [2021-01-06 11:46:00,994 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:01,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:46:01,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:01,345 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:46:01,346 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:46:01,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,357 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,357 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:46:01,433 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:46:01,433 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:46:01,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,440 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:46:01,589 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 [2021-01-06 11:46:01,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:46:01,633 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|, |v_#memory_$Pointer$.base_210|], 2=[|v_#memory_int_203|]} [2021-01-06 11:46:01,637 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 [2021-01-06 11:46:01,639 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,655 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 25 treesize of output 13 [2021-01-06 11:46:01,657 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,702 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,703 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:46:01,705 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,753 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:46:01,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:01,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,756 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:46:01,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:01,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:01,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:46:01,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:01,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,831 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:46:01,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,891 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,892 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 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:46:01,895 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,985 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:46:01,988 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:46:01,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:46:02,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:02,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:02,082 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 [2021-01-06 11:46:02,084 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:02,089 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:46:02,089 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:46:02,092 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:02,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:02,100 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:46:02,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:7 [2021-01-06 11:46:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 344 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-01-06 11:46:02,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:46:02,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-01-06 11:46:02,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227574112] [2021-01-06 11:46:02,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 11:46:02,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 11:46:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-01-06 11:46:02,246 INFO L87 Difference]: Start difference. First operand 16880 states and 27219 transitions. Second operand 14 states. [2021-01-06 11:46:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:11,338 INFO L93 Difference]: Finished difference Result 41321 states and 64899 transitions. [2021-01-06 11:46:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 11:46:11,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 241 [2021-01-06 11:46:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:11,368 INFO L225 Difference]: With dead ends: 41321 [2021-01-06 11:46:11,368 INFO L226 Difference]: Without dead ends: 24462 [2021-01-06 11:46:11,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2021-01-06 11:46:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24462 states. [2021-01-06 11:46:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24462 to 11148. [2021-01-06 11:46:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2021-01-06 11:46:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 17997 transitions. [2021-01-06 11:46:12,082 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 17997 transitions. Word has length 241 [2021-01-06 11:46:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:12,083 INFO L481 AbstractCegarLoop]: Abstraction has 11148 states and 17997 transitions. [2021-01-06 11:46:12,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 11:46:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 17997 transitions. [2021-01-06 11:46:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-01-06 11:46:12,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:12,092 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2021-01-06 11:46:12,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:12,297 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1266982991, now seen corresponding path program 1 times [2021-01-06 11:46:12,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:12,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941920146] [2021-01-06 11:46:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 366 proven. 35 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-01-06 11:46:12,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941920146] [2021-01-06 11:46:12,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021760389] [2021-01-06 11:46:12,628 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:46:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:12,986 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:46:12,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:46:12,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:12,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:12,997 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:12,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:46:13,070 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:46:13,070 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:46:13,077 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,082 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:46:13,193 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 [2021-01-06 11:46:13,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,198 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:46:13,230 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_173|, |v_#memory_$Pointer$.base_211|], 2=[|v_#memory_int_207|]} [2021-01-06 11:46:13,234 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 [2021-01-06 11:46:13,236 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:13,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,251 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 25 treesize of output 13 [2021-01-06 11:46:13,253 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:13,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,299 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,300 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:46:13,302 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,349 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:46:13,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:13,351 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:13,351 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:46:13,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:13,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:13,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:46:13,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:13,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:13,468 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,469 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 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:46:13,472 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:13,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:46:13,487 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,572 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:46:13,580 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:46:13,580 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:46:13,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:46:13,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:13,668 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 [2021-01-06 11:46:13,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,676 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:46:13,676 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 11:46:13,679 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:13,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:13,686 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:46:13,687 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:7 [2021-01-06 11:46:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 350 proven. 46 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-01-06 11:46:13,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:46:13,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-01-06 11:46:13,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638097081] [2021-01-06 11:46:13,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 11:46:13,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 11:46:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-01-06 11:46:13,863 INFO L87 Difference]: Start difference. First operand 11148 states and 17997 transitions. Second operand 14 states. [2021-01-06 11:46:17,554 WARN L197 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 49 [2021-01-06 11:46:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:23,521 INFO L93 Difference]: Finished difference Result 28189 states and 44052 transitions. [2021-01-06 11:46:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 11:46:23,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 242 [2021-01-06 11:46:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:23,541 INFO L225 Difference]: With dead ends: 28189 [2021-01-06 11:46:23,542 INFO L226 Difference]: Without dead ends: 17062 [2021-01-06 11:46:23,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2021-01-06 11:46:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2021-01-06 11:46:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 11148. [2021-01-06 11:46:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2021-01-06 11:46:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 17955 transitions. [2021-01-06 11:46:24,139 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 17955 transitions. Word has length 242 [2021-01-06 11:46:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:24,139 INFO L481 AbstractCegarLoop]: Abstraction has 11148 states and 17955 transitions. [2021-01-06 11:46:24,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 11:46:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 17955 transitions. [2021-01-06 11:46:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 11:46:24,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:24,148 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:24,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:24,349 INFO L429 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -646067452, now seen corresponding path program 1 times [2021-01-06 11:46:24,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:24,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745594489] [2021-01-06 11:46:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-01-06 11:46:24,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745594489] [2021-01-06 11:46:24,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:24,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:46:24,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539430752] [2021-01-06 11:46:24,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:24,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:46:24,460 INFO L87 Difference]: Start difference. First operand 11148 states and 17955 transitions. Second operand 4 states. [2021-01-06 11:46:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:26,103 INFO L93 Difference]: Finished difference Result 16415 states and 26202 transitions. [2021-01-06 11:46:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:26,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 11:46:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:26,117 INFO L225 Difference]: With dead ends: 16415 [2021-01-06 11:46:26,117 INFO L226 Difference]: Without dead ends: 12749 [2021-01-06 11:46:26,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2021-01-06 11:46:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 11364. [2021-01-06 11:46:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11364 states. [2021-01-06 11:46:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11364 states to 11364 states and 18261 transitions. [2021-01-06 11:46:26,706 INFO L78 Accepts]: Start accepts. Automaton has 11364 states and 18261 transitions. Word has length 243 [2021-01-06 11:46:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:26,706 INFO L481 AbstractCegarLoop]: Abstraction has 11364 states and 18261 transitions. [2021-01-06 11:46:26,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 11364 states and 18261 transitions. [2021-01-06 11:46:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-01-06 11:46:26,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:26,717 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:26,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-01-06 11:46:26,717 INFO L429 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash -278224633, now seen corresponding path program 1 times [2021-01-06 11:46:26,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:26,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312986247] [2021-01-06 11:46:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-01-06 11:46:26,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312986247] [2021-01-06 11:46:26,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:26,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:46:26,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073673286] [2021-01-06 11:46:26,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:26,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:46:26,924 INFO L87 Difference]: Start difference. First operand 11364 states and 18261 transitions. Second operand 4 states. [2021-01-06 11:46:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:28,512 INFO L93 Difference]: Finished difference Result 16487 states and 26286 transitions. [2021-01-06 11:46:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:28,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2021-01-06 11:46:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:28,532 INFO L225 Difference]: With dead ends: 16487 [2021-01-06 11:46:28,532 INFO L226 Difference]: Without dead ends: 12749 [2021-01-06 11:46:28,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2021-01-06 11:46:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 11382. [2021-01-06 11:46:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11382 states. [2021-01-06 11:46:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11382 states to 11382 states and 18279 transitions. [2021-01-06 11:46:29,207 INFO L78 Accepts]: Start accepts. Automaton has 11382 states and 18279 transitions. Word has length 244 [2021-01-06 11:46:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:29,207 INFO L481 AbstractCegarLoop]: Abstraction has 11382 states and 18279 transitions. [2021-01-06 11:46:29,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 11382 states and 18279 transitions. [2021-01-06 11:46:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-01-06 11:46:29,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:29,218 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:29,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-01-06 11:46:29,218 INFO L429 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash -978011031, now seen corresponding path program 1 times [2021-01-06 11:46:29,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:29,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235172922] [2021-01-06 11:46:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-01-06 11:46:29,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235172922] [2021-01-06 11:46:29,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:29,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:46:29,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5964739] [2021-01-06 11:46:29,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:29,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:46:29,338 INFO L87 Difference]: Start difference. First operand 11382 states and 18279 transitions. Second operand 4 states. [2021-01-06 11:46:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:31,013 INFO L93 Difference]: Finished difference Result 16493 states and 26274 transitions. [2021-01-06 11:46:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:31,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2021-01-06 11:46:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:31,030 INFO L225 Difference]: With dead ends: 16493 [2021-01-06 11:46:31,030 INFO L226 Difference]: Without dead ends: 12749 [2021-01-06 11:46:31,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2021-01-06 11:46:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 11400. [2021-01-06 11:46:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11400 states. [2021-01-06 11:46:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11400 states to 11400 states and 18297 transitions. [2021-01-06 11:46:31,687 INFO L78 Accepts]: Start accepts. Automaton has 11400 states and 18297 transitions. Word has length 245 [2021-01-06 11:46:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:31,687 INFO L481 AbstractCegarLoop]: Abstraction has 11400 states and 18297 transitions. [2021-01-06 11:46:31,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 11400 states and 18297 transitions. [2021-01-06 11:46:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-01-06 11:46:31,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:31,701 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:31,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-01-06 11:46:31,701 INFO L429 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1536452114, now seen corresponding path program 1 times [2021-01-06 11:46:31,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:31,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479072820] [2021-01-06 11:46:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-01-06 11:46:31,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479072820] [2021-01-06 11:46:31,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:31,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:46:31,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810355318] [2021-01-06 11:46:31,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:31,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:46:31,842 INFO L87 Difference]: Start difference. First operand 11400 states and 18297 transitions. Second operand 4 states. [2021-01-06 11:46:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:33,470 INFO L93 Difference]: Finished difference Result 23859 states and 38010 transitions. [2021-01-06 11:46:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:33,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2021-01-06 11:46:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:33,484 INFO L225 Difference]: With dead ends: 23859 [2021-01-06 11:46:33,484 INFO L226 Difference]: Without dead ends: 12480 [2021-01-06 11:46:33,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12480 states. [2021-01-06 11:46:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12480 to 11526. [2021-01-06 11:46:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11526 states. [2021-01-06 11:46:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11526 states to 11526 states and 18507 transitions. [2021-01-06 11:46:34,078 INFO L78 Accepts]: Start accepts. Automaton has 11526 states and 18507 transitions. Word has length 245 [2021-01-06 11:46:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:34,079 INFO L481 AbstractCegarLoop]: Abstraction has 11526 states and 18507 transitions. [2021-01-06 11:46:34,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 11526 states and 18507 transitions. [2021-01-06 11:46:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-01-06 11:46:34,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:34,088 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:34,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-01-06 11:46:34,088 INFO L429 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash -71194494, now seen corresponding path program 1 times [2021-01-06 11:46:34,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:34,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804541117] [2021-01-06 11:46:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat