/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.12.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:48:37,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:48:37,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:48:37,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:48:37,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:48:37,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:48:37,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:48:37,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:48:37,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:48:37,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:48:37,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:48:37,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:48:37,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:48:37,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:48:37,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:48:37,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:48:37,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:48:37,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:48:37,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:48:37,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:48:37,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:48:37,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:48:37,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:48:37,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:48:37,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:48:37,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:48:37,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:48:37,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:48:37,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:48:37,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:48:37,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:48:37,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:48:37,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:48:37,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:48:37,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:48:37,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:48:37,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:48:37,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:48:37,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:48:37,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:48:37,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:48:37,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:48:37,369 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:48:37,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:48:37,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:48:37,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:48:37,371 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:48:37,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:48:37,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:48:37,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:48:37,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:48:37,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:48:37,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:48:37,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:48:37,373 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:48:37,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:48:37,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:48:37,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:48:37,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:48:37,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:48:37,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:48:37,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:48:37,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:48:37,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:48:37,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:48:37,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:48:37,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:48:37,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:48:37,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:48:37,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:48:37,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:48:37,770 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:48:37,771 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:48:37,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c [2020-12-23 01:48:37,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7cc55655f/41769ef004844d1eb8dae53252003eee/FLAG99302e6a9 [2020-12-23 01:48:38,697 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:48:38,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c [2020-12-23 01:48:38,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7cc55655f/41769ef004844d1eb8dae53252003eee/FLAG99302e6a9 [2020-12-23 01:48:38,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7cc55655f/41769ef004844d1eb8dae53252003eee [2020-12-23 01:48:38,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:48:38,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:48:38,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:48:38,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:48:38,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:48:38,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:48:38" (1/1) ... [2020-12-23 01:48:38,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297cbe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:38, skipping insertion in model container [2020-12-23 01:48:38,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:48:38" (1/1) ... [2020-12-23 01:48:38,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:48:39,036 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: 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~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: 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: 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[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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:48:39,508 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.12.i.cil-1.c[73985,73998] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:48:39,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:48:39,541 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: 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~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: 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: 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[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: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:48:39,743 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.12.i.cil-1.c[73985,73998] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:48:39,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:48:39,779 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:48:39,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39 WrapperNode [2020-12-23 01:48:39,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:48:39,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:48:39,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:48:39,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:48:39,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:48:39,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:48:39,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:48:39,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:48:39,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:39,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:40,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:40,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... [2020-12-23 01:48:40,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:48:40,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:48:40,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:48:40,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:48:40,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:48:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:48:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:48:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:48:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:48:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:48:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:48:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:48:40,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:48:40,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:48:40,535 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:48:41,721 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:48:41,724 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:48:41,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:48:41,740 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:48:41,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:48:41 BoogieIcfgContainer [2020-12-23 01:48:41,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:48:41,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:48:41,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:48:41,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:48:41,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:48:38" (1/3) ... [2020-12-23 01:48:41,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad69093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:48:41, skipping insertion in model container [2020-12-23 01:48:41,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:48:39" (2/3) ... [2020-12-23 01:48:41,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad69093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:48:41, skipping insertion in model container [2020-12-23 01:48:41,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:48:41" (3/3) ... [2020-12-23 01:48:41,757 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2020-12-23 01:48:41,764 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:48:41,769 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:48:41,789 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:48:41,820 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:48:41,821 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:48:41,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:48:41,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:48:41,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:48:41,821 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:48:41,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:48:41,821 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:48:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2020-12-23 01:48:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 01:48:41,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:41,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:41,855 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1126362112, now seen corresponding path program 1 times [2020-12-23 01:48:41,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:41,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496485897] [2020-12-23 01:48:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:42,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496485897] [2020-12-23 01:48:42,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:42,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:42,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122919795] [2020-12-23 01:48:42,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:42,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:42,389 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2020-12-23 01:48:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:43,104 INFO L93 Difference]: Finished difference Result 327 states and 555 transitions. [2020-12-23 01:48:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:43,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-12-23 01:48:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:43,121 INFO L225 Difference]: With dead ends: 327 [2020-12-23 01:48:43,121 INFO L226 Difference]: Without dead ends: 165 [2020-12-23 01:48:43,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-23 01:48:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2020-12-23 01:48:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-12-23 01:48:43,185 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 41 [2020-12-23 01:48:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:43,186 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-12-23 01:48:43,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-12-23 01:48:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 01:48:43,189 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:43,190 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:43,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:48:43,190 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614375, now seen corresponding path program 1 times [2020-12-23 01:48:43,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:43,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90210302] [2020-12-23 01:48:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:43,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90210302] [2020-12-23 01:48:43,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:43,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:43,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720928432] [2020-12-23 01:48:43,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:43,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:43,369 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 4 states. [2020-12-23 01:48:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:43,925 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2020-12-23 01:48:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:43,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 01:48:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:43,932 INFO L225 Difference]: With dead ends: 294 [2020-12-23 01:48:43,932 INFO L226 Difference]: Without dead ends: 165 [2020-12-23 01:48:43,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-23 01:48:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2020-12-23 01:48:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 229 transitions. [2020-12-23 01:48:43,968 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 229 transitions. Word has length 54 [2020-12-23 01:48:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:43,969 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 229 transitions. [2020-12-23 01:48:43,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2020-12-23 01:48:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:48:43,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:43,976 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:43,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:48:43,976 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1545467861, now seen corresponding path program 1 times [2020-12-23 01:48:43,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:43,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603248379] [2020-12-23 01:48:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:44,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603248379] [2020-12-23 01:48:44,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:44,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:44,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582142235] [2020-12-23 01:48:44,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:44,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:44,176 INFO L87 Difference]: Start difference. First operand 148 states and 229 transitions. Second operand 4 states. [2020-12-23 01:48:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:44,645 INFO L93 Difference]: Finished difference Result 293 states and 449 transitions. [2020-12-23 01:48:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:44,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 01:48:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:44,651 INFO L225 Difference]: With dead ends: 293 [2020-12-23 01:48:44,651 INFO L226 Difference]: Without dead ends: 164 [2020-12-23 01:48:44,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-23 01:48:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2020-12-23 01:48:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2020-12-23 01:48:44,680 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 55 [2020-12-23 01:48:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:44,680 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2020-12-23 01:48:44,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2020-12-23 01:48:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:48:44,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:44,685 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:44,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:48:44,686 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1613297430, now seen corresponding path program 1 times [2020-12-23 01:48:44,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:44,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196133288] [2020-12-23 01:48:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:44,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196133288] [2020-12-23 01:48:44,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:44,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:44,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452361708] [2020-12-23 01:48:44,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:44,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:44,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:44,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:44,848 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand 4 states. [2020-12-23 01:48:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:45,281 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2020-12-23 01:48:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:45,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 01:48:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:45,284 INFO L225 Difference]: With dead ends: 291 [2020-12-23 01:48:45,284 INFO L226 Difference]: Without dead ends: 162 [2020-12-23 01:48:45,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-23 01:48:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2020-12-23 01:48:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-12-23 01:48:45,296 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 55 [2020-12-23 01:48:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:45,296 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-12-23 01:48:45,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-12-23 01:48:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:48:45,299 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:45,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:45,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:48:45,300 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 877952598, now seen corresponding path program 1 times [2020-12-23 01:48:45,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:45,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100672288] [2020-12-23 01:48:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:45,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100672288] [2020-12-23 01:48:45,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:45,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:45,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782188687] [2020-12-23 01:48:45,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:45,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:45,380 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 4 states. [2020-12-23 01:48:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:45,791 INFO L93 Difference]: Finished difference Result 290 states and 444 transitions. [2020-12-23 01:48:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:45,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 01:48:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:45,794 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:48:45,794 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:48:45,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:48:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2020-12-23 01:48:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 226 transitions. [2020-12-23 01:48:45,804 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 226 transitions. Word has length 55 [2020-12-23 01:48:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:45,805 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 226 transitions. [2020-12-23 01:48:45,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 226 transitions. [2020-12-23 01:48:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 01:48:45,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:45,807 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:45,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:48:45,807 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1745877439, now seen corresponding path program 1 times [2020-12-23 01:48:45,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:45,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584002106] [2020-12-23 01:48:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:45,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584002106] [2020-12-23 01:48:45,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:45,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:45,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291315570] [2020-12-23 01:48:45,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:45,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:45,882 INFO L87 Difference]: Start difference. First operand 148 states and 226 transitions. Second operand 4 states. [2020-12-23 01:48:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:46,307 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2020-12-23 01:48:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:46,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 01:48:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:46,309 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:48:46,310 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:48:46,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:48:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2020-12-23 01:48:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2020-12-23 01:48:46,318 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 55 [2020-12-23 01:48:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:46,319 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2020-12-23 01:48:46,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2020-12-23 01:48:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 01:48:46,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:46,320 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:46,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:48:46,321 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash -112151006, now seen corresponding path program 1 times [2020-12-23 01:48:46,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:46,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597332076] [2020-12-23 01:48:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:46,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597332076] [2020-12-23 01:48:46,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:46,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:46,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777112885] [2020-12-23 01:48:46,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:46,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:46,413 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand 4 states. [2020-12-23 01:48:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:46,793 INFO L93 Difference]: Finished difference Result 290 states and 442 transitions. [2020-12-23 01:48:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:46,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-12-23 01:48:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:46,795 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:48:46,796 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:48:46,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:48:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2020-12-23 01:48:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2020-12-23 01:48:46,805 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 56 [2020-12-23 01:48:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:46,805 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2020-12-23 01:48:46,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2020-12-23 01:48:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 01:48:46,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:46,808 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:46,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:48:46,808 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1790225756, now seen corresponding path program 1 times [2020-12-23 01:48:46,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:46,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888665559] [2020-12-23 01:48:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:46,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888665559] [2020-12-23 01:48:46,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:46,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:46,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735025594] [2020-12-23 01:48:46,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:46,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:46,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:46,938 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand 4 states. [2020-12-23 01:48:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:47,330 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2020-12-23 01:48:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:47,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-23 01:48:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:47,332 INFO L225 Difference]: With dead ends: 290 [2020-12-23 01:48:47,332 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:48:47,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:48:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2020-12-23 01:48:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2020-12-23 01:48:47,339 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 57 [2020-12-23 01:48:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:47,339 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2020-12-23 01:48:47,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2020-12-23 01:48:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:48:47,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:47,340 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:47,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:48:47,341 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2110264039, now seen corresponding path program 1 times [2020-12-23 01:48:47,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:47,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117266040] [2020-12-23 01:48:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:47,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117266040] [2020-12-23 01:48:47,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:47,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:47,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504002012] [2020-12-23 01:48:47,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:47,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:47,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:47,409 INFO L87 Difference]: Start difference. First operand 148 states and 223 transitions. Second operand 4 states. [2020-12-23 01:48:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:47,757 INFO L93 Difference]: Finished difference Result 280 states and 427 transitions. [2020-12-23 01:48:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:47,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:48:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:47,759 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:48:47,759 INFO L226 Difference]: Without dead ends: 151 [2020-12-23 01:48:47,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-23 01:48:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2020-12-23 01:48:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 01:48:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2020-12-23 01:48:47,766 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 58 [2020-12-23 01:48:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:47,766 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2020-12-23 01:48:47,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2020-12-23 01:48:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:48:47,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:47,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:47,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:48:47,768 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1054614961, now seen corresponding path program 1 times [2020-12-23 01:48:47,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:47,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160579870] [2020-12-23 01:48:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:47,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160579870] [2020-12-23 01:48:47,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:47,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:47,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824373664] [2020-12-23 01:48:47,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:47,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:47,833 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand 4 states. [2020-12-23 01:48:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:48,232 INFO L93 Difference]: Finished difference Result 320 states and 488 transitions. [2020-12-23 01:48:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:48,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:48:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:48,235 INFO L225 Difference]: With dead ends: 320 [2020-12-23 01:48:48,235 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:48:48,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:48:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2020-12-23 01:48:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 260 transitions. [2020-12-23 01:48:48,243 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 260 transitions. Word has length 58 [2020-12-23 01:48:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:48,244 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 260 transitions. [2020-12-23 01:48:48,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 260 transitions. [2020-12-23 01:48:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 01:48:48,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:48,245 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:48,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:48:48,246 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash -608200918, now seen corresponding path program 1 times [2020-12-23 01:48:48,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:48,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915810697] [2020-12-23 01:48:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:48,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915810697] [2020-12-23 01:48:48,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:48,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:48,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143362192] [2020-12-23 01:48:48,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:48,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:48,372 INFO L87 Difference]: Start difference. First operand 170 states and 260 transitions. Second operand 4 states. [2020-12-23 01:48:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:48,768 INFO L93 Difference]: Finished difference Result 342 states and 525 transitions. [2020-12-23 01:48:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:48,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-12-23 01:48:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:48,771 INFO L225 Difference]: With dead ends: 342 [2020-12-23 01:48:48,771 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:48:48,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:48:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2020-12-23 01:48:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2020-12-23 01:48:48,779 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 71 [2020-12-23 01:48:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:48,780 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2020-12-23 01:48:48,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2020-12-23 01:48:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:48:48,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:48,781 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:48,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:48:48,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1499480122, now seen corresponding path program 1 times [2020-12-23 01:48:48,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:48,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460977966] [2020-12-23 01:48:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:48,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460977966] [2020-12-23 01:48:48,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:48,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:48,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857763964] [2020-12-23 01:48:48,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:48,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:48,873 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand 4 states. [2020-12-23 01:48:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:49,299 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2020-12-23 01:48:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:49,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-23 01:48:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:49,301 INFO L225 Difference]: With dead ends: 341 [2020-12-23 01:48:49,302 INFO L226 Difference]: Without dead ends: 190 [2020-12-23 01:48:49,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-23 01:48:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2020-12-23 01:48:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2020-12-23 01:48:49,308 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 72 [2020-12-23 01:48:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:49,308 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2020-12-23 01:48:49,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2020-12-23 01:48:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:48:49,309 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:49,310 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:49,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:48:49,310 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 363278117, now seen corresponding path program 1 times [2020-12-23 01:48:49,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:49,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785406450] [2020-12-23 01:48:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:49,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785406450] [2020-12-23 01:48:49,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:49,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:49,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108249194] [2020-12-23 01:48:49,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:49,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:49,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:49,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:49,398 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand 4 states. [2020-12-23 01:48:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:49,773 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2020-12-23 01:48:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:49,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-23 01:48:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:49,776 INFO L225 Difference]: With dead ends: 339 [2020-12-23 01:48:49,776 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 01:48:49,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 01:48:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2020-12-23 01:48:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2020-12-23 01:48:49,783 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 72 [2020-12-23 01:48:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:49,784 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2020-12-23 01:48:49,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2020-12-23 01:48:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:48:49,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:49,785 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:49,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:48:49,786 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash -372066715, now seen corresponding path program 1 times [2020-12-23 01:48:49,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:49,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50678192] [2020-12-23 01:48:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:49,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50678192] [2020-12-23 01:48:49,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:49,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:49,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802643311] [2020-12-23 01:48:49,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:49,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:49,853 INFO L87 Difference]: Start difference. First operand 170 states and 257 transitions. Second operand 4 states. [2020-12-23 01:48:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:50,249 INFO L93 Difference]: Finished difference Result 338 states and 515 transitions. [2020-12-23 01:48:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:50,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-23 01:48:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:50,251 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:48:50,251 INFO L226 Difference]: Without dead ends: 187 [2020-12-23 01:48:50,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-23 01:48:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2020-12-23 01:48:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 256 transitions. [2020-12-23 01:48:50,259 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 256 transitions. Word has length 72 [2020-12-23 01:48:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:50,259 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 256 transitions. [2020-12-23 01:48:50,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2020-12-23 01:48:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:48:50,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:50,260 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:50,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:48:50,261 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash 495858126, now seen corresponding path program 1 times [2020-12-23 01:48:50,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:50,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326365917] [2020-12-23 01:48:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:50,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326365917] [2020-12-23 01:48:50,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:50,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:50,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696376135] [2020-12-23 01:48:50,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:50,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:50,318 INFO L87 Difference]: Start difference. First operand 170 states and 256 transitions. Second operand 4 states. [2020-12-23 01:48:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:50,707 INFO L93 Difference]: Finished difference Result 338 states and 513 transitions. [2020-12-23 01:48:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:50,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-23 01:48:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:50,710 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:48:50,710 INFO L226 Difference]: Without dead ends: 187 [2020-12-23 01:48:50,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-23 01:48:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2020-12-23 01:48:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 255 transitions. [2020-12-23 01:48:50,716 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 255 transitions. Word has length 72 [2020-12-23 01:48:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:50,717 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 255 transitions. [2020-12-23 01:48:50,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2020-12-23 01:48:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 01:48:50,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:50,718 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:50,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:48:50,718 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -208044045, now seen corresponding path program 1 times [2020-12-23 01:48:50,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:50,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134912265] [2020-12-23 01:48:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:50,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134912265] [2020-12-23 01:48:50,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:50,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:50,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913842231] [2020-12-23 01:48:50,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:50,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:50,774 INFO L87 Difference]: Start difference. First operand 170 states and 255 transitions. Second operand 4 states. [2020-12-23 01:48:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:51,208 INFO L93 Difference]: Finished difference Result 338 states and 511 transitions. [2020-12-23 01:48:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:51,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 01:48:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:51,211 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:48:51,211 INFO L226 Difference]: Without dead ends: 187 [2020-12-23 01:48:51,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-23 01:48:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2020-12-23 01:48:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2020-12-23 01:48:51,219 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 73 [2020-12-23 01:48:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:51,219 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2020-12-23 01:48:51,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2020-12-23 01:48:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:48:51,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:51,221 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:51,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:48:51,221 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -467942669, now seen corresponding path program 1 times [2020-12-23 01:48:51,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:51,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235122889] [2020-12-23 01:48:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:51,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235122889] [2020-12-23 01:48:51,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:51,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:51,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571863414] [2020-12-23 01:48:51,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:51,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:51,317 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand 4 states. [2020-12-23 01:48:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:51,804 INFO L93 Difference]: Finished difference Result 338 states and 509 transitions. [2020-12-23 01:48:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:51,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:48:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:51,806 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:48:51,806 INFO L226 Difference]: Without dead ends: 187 [2020-12-23 01:48:51,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-12-23 01:48:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2020-12-23 01:48:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2020-12-23 01:48:51,813 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 74 [2020-12-23 01:48:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:51,813 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2020-12-23 01:48:51,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2020-12-23 01:48:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:48:51,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:51,815 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:51,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:48:51,815 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 151366776, now seen corresponding path program 1 times [2020-12-23 01:48:51,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:51,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375611381] [2020-12-23 01:48:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:48:51,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375611381] [2020-12-23 01:48:51,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:51,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:51,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012709182] [2020-12-23 01:48:51,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:51,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:51,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:51,877 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 4 states. [2020-12-23 01:48:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:52,220 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2020-12-23 01:48:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:52,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:48:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:52,222 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:48:52,222 INFO L226 Difference]: Without dead ends: 177 [2020-12-23 01:48:52,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-23 01:48:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2020-12-23 01:48:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:48:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2020-12-23 01:48:52,228 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 75 [2020-12-23 01:48:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:52,230 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2020-12-23 01:48:52,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2020-12-23 01:48:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 01:48:52,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:52,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:52,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:48:52,232 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1479009068, now seen corresponding path program 1 times [2020-12-23 01:48:52,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:52,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811194551] [2020-12-23 01:48:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:52,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811194551] [2020-12-23 01:48:52,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:52,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:52,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177228431] [2020-12-23 01:48:52,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:52,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:52,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:52,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:52,350 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand 4 states. [2020-12-23 01:48:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:53,001 INFO L93 Difference]: Finished difference Result 430 states and 651 transitions. [2020-12-23 01:48:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:53,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 01:48:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:53,004 INFO L225 Difference]: With dead ends: 430 [2020-12-23 01:48:53,006 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 01:48:53,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 01:48:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2020-12-23 01:48:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 01:48:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2020-12-23 01:48:53,020 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 80 [2020-12-23 01:48:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:53,020 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2020-12-23 01:48:53,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2020-12-23 01:48:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 01:48:53,022 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:53,022 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:53,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:48:53,023 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 970591062, now seen corresponding path program 1 times [2020-12-23 01:48:53,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:53,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412222087] [2020-12-23 01:48:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:53,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412222087] [2020-12-23 01:48:53,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:53,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:53,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75246429] [2020-12-23 01:48:53,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:53,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:53,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:53,104 INFO L87 Difference]: Start difference. First operand 211 states and 326 transitions. Second operand 4 states. [2020-12-23 01:48:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:53,680 INFO L93 Difference]: Finished difference Result 453 states and 707 transitions. [2020-12-23 01:48:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:53,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 01:48:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:53,684 INFO L225 Difference]: With dead ends: 453 [2020-12-23 01:48:53,684 INFO L226 Difference]: Without dead ends: 261 [2020-12-23 01:48:53,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-23 01:48:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2020-12-23 01:48:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-12-23 01:48:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 368 transitions. [2020-12-23 01:48:53,697 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 368 transitions. Word has length 80 [2020-12-23 01:48:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:53,698 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 368 transitions. [2020-12-23 01:48:53,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 368 transitions. [2020-12-23 01:48:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 01:48:53,700 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:53,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:53,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:48:53,701 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1387575626, now seen corresponding path program 1 times [2020-12-23 01:48:53,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:53,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582581938] [2020-12-23 01:48:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:53,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582581938] [2020-12-23 01:48:53,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:53,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:53,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634701769] [2020-12-23 01:48:53,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:53,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:53,839 INFO L87 Difference]: Start difference. First operand 235 states and 368 transitions. Second operand 4 states. [2020-12-23 01:48:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:54,474 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2020-12-23 01:48:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:54,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 01:48:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:54,477 INFO L225 Difference]: With dead ends: 513 [2020-12-23 01:48:54,477 INFO L226 Difference]: Without dead ends: 297 [2020-12-23 01:48:54,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-23 01:48:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 236. [2020-12-23 01:48:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 369 transitions. [2020-12-23 01:48:54,486 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 369 transitions. Word has length 81 [2020-12-23 01:48:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:54,487 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 369 transitions. [2020-12-23 01:48:54,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 369 transitions. [2020-12-23 01:48:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 01:48:54,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:54,489 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:54,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:48:54,489 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -4172603, now seen corresponding path program 1 times [2020-12-23 01:48:54,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:54,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082753666] [2020-12-23 01:48:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:54,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082753666] [2020-12-23 01:48:54,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:54,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:54,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712360331] [2020-12-23 01:48:54,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:54,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:54,578 INFO L87 Difference]: Start difference. First operand 236 states and 369 transitions. Second operand 4 states. [2020-12-23 01:48:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:55,219 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2020-12-23 01:48:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:55,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2020-12-23 01:48:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:55,225 INFO L225 Difference]: With dead ends: 514 [2020-12-23 01:48:55,225 INFO L226 Difference]: Without dead ends: 297 [2020-12-23 01:48:55,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-23 01:48:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 236. [2020-12-23 01:48:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 368 transitions. [2020-12-23 01:48:55,233 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 368 transitions. Word has length 93 [2020-12-23 01:48:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:55,233 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 368 transitions. [2020-12-23 01:48:55,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 368 transitions. [2020-12-23 01:48:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 01:48:55,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:55,235 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:55,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:48:55,235 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1534167427, now seen corresponding path program 1 times [2020-12-23 01:48:55,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:55,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716640205] [2020-12-23 01:48:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:55,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716640205] [2020-12-23 01:48:55,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:55,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:55,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9684253] [2020-12-23 01:48:55,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:55,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:55,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:55,333 INFO L87 Difference]: Start difference. First operand 236 states and 368 transitions. Second operand 4 states. [2020-12-23 01:48:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:55,785 INFO L93 Difference]: Finished difference Result 479 states and 748 transitions. [2020-12-23 01:48:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:55,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2020-12-23 01:48:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:55,788 INFO L225 Difference]: With dead ends: 479 [2020-12-23 01:48:55,788 INFO L226 Difference]: Without dead ends: 262 [2020-12-23 01:48:55,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-12-23 01:48:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2020-12-23 01:48:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 367 transitions. [2020-12-23 01:48:55,797 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 367 transitions. Word has length 93 [2020-12-23 01:48:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:55,797 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 367 transitions. [2020-12-23 01:48:55,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 367 transitions. [2020-12-23 01:48:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:55,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:55,799 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:55,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:48:55,799 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1250478593, now seen corresponding path program 1 times [2020-12-23 01:48:55,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:55,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997328274] [2020-12-23 01:48:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:55,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997328274] [2020-12-23 01:48:55,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:55,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:55,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731371705] [2020-12-23 01:48:55,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:55,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:55,880 INFO L87 Difference]: Start difference. First operand 236 states and 367 transitions. Second operand 4 states. [2020-12-23 01:48:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:56,449 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2020-12-23 01:48:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:56,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 01:48:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:56,452 INFO L225 Difference]: With dead ends: 513 [2020-12-23 01:48:56,452 INFO L226 Difference]: Without dead ends: 296 [2020-12-23 01:48:56,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-23 01:48:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 236. [2020-12-23 01:48:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 366 transitions. [2020-12-23 01:48:56,465 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 366 transitions. Word has length 94 [2020-12-23 01:48:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:56,465 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 366 transitions. [2020-12-23 01:48:56,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 366 transitions. [2020-12-23 01:48:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:56,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:56,467 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:56,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:48:56,468 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1908286698, now seen corresponding path program 1 times [2020-12-23 01:48:56,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:56,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455745840] [2020-12-23 01:48:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:56,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455745840] [2020-12-23 01:48:56,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:56,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:56,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122299183] [2020-12-23 01:48:56,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:56,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:56,572 INFO L87 Difference]: Start difference. First operand 236 states and 366 transitions. Second operand 4 states. [2020-12-23 01:48:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:57,082 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2020-12-23 01:48:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:57,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 01:48:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:57,085 INFO L225 Difference]: With dead ends: 511 [2020-12-23 01:48:57,086 INFO L226 Difference]: Without dead ends: 294 [2020-12-23 01:48:57,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-23 01:48:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2020-12-23 01:48:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 365 transitions. [2020-12-23 01:48:57,095 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 365 transitions. Word has length 94 [2020-12-23 01:48:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:57,096 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 365 transitions. [2020-12-23 01:48:57,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 365 transitions. [2020-12-23 01:48:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:57,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:57,098 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:57,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:48:57,098 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1172941866, now seen corresponding path program 1 times [2020-12-23 01:48:57,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:57,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396340190] [2020-12-23 01:48:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:57,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396340190] [2020-12-23 01:48:57,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:57,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:57,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277985402] [2020-12-23 01:48:57,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:57,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:57,203 INFO L87 Difference]: Start difference. First operand 236 states and 365 transitions. Second operand 4 states. [2020-12-23 01:48:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:57,770 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2020-12-23 01:48:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:57,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 01:48:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:57,773 INFO L225 Difference]: With dead ends: 510 [2020-12-23 01:48:57,773 INFO L226 Difference]: Without dead ends: 293 [2020-12-23 01:48:57,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-12-23 01:48:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2020-12-23 01:48:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 01:48:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-12-23 01:48:57,783 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 94 [2020-12-23 01:48:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:57,783 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-12-23 01:48:57,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-12-23 01:48:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:57,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:57,785 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:57,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:48:57,785 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2040866707, now seen corresponding path program 1 times [2020-12-23 01:48:57,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:57,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064136691] [2020-12-23 01:48:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 01:48:57,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064136691] [2020-12-23 01:48:57,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:57,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:57,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945099445] [2020-12-23 01:48:57,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:57,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:57,899 INFO L87 Difference]: Start difference. First operand 236 states and 364 transitions. Second operand 5 states. [2020-12-23 01:48:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:58,512 INFO L93 Difference]: Finished difference Result 474 states and 736 transitions. [2020-12-23 01:48:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:48:58,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2020-12-23 01:48:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:58,515 INFO L225 Difference]: With dead ends: 474 [2020-12-23 01:48:58,515 INFO L226 Difference]: Without dead ends: 257 [2020-12-23 01:48:58,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:48:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-12-23 01:48:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2020-12-23 01:48:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:48:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2020-12-23 01:48:58,527 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 94 [2020-12-23 01:48:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:58,527 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2020-12-23 01:48:58,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2020-12-23 01:48:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:58,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:58,529 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:58,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:48:58,530 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1942779924, now seen corresponding path program 1 times [2020-12-23 01:48:58,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:58,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779039130] [2020-12-23 01:48:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:58,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779039130] [2020-12-23 01:48:58,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:58,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:58,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17956797] [2020-12-23 01:48:58,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:58,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:58,637 INFO L87 Difference]: Start difference. First operand 256 states and 390 transitions. Second operand 4 states. [2020-12-23 01:48:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:59,050 INFO L93 Difference]: Finished difference Result 516 states and 788 transitions. [2020-12-23 01:48:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:59,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 01:48:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:59,054 INFO L225 Difference]: With dead ends: 516 [2020-12-23 01:48:59,054 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 01:48:59,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 01:48:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 256. [2020-12-23 01:48:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:48:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2020-12-23 01:48:59,075 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 94 [2020-12-23 01:48:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:59,075 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2020-12-23 01:48:59,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2020-12-23 01:48:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 01:48:59,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:59,077 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:59,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:48:59,077 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1616842540, now seen corresponding path program 1 times [2020-12-23 01:48:59,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:59,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51125179] [2020-12-23 01:48:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:59,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51125179] [2020-12-23 01:48:59,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:59,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:59,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397564747] [2020-12-23 01:48:59,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:59,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:59,147 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2020-12-23 01:48:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:59,575 INFO L93 Difference]: Finished difference Result 515 states and 785 transitions. [2020-12-23 01:48:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:59,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 01:48:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:59,578 INFO L225 Difference]: With dead ends: 515 [2020-12-23 01:48:59,578 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 01:48:59,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 01:48:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2020-12-23 01:48:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:48:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2020-12-23 01:48:59,589 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 94 [2020-12-23 01:48:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:59,590 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2020-12-23 01:48:59,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2020-12-23 01:48:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 01:48:59,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:59,592 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:48:59,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:48:59,592 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1770643777, now seen corresponding path program 1 times [2020-12-23 01:48:59,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:59,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870352357] [2020-12-23 01:48:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:48:59,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870352357] [2020-12-23 01:48:59,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:59,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:59,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284626994] [2020-12-23 01:48:59,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:59,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:59,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:59,673 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2020-12-23 01:49:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:00,248 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2020-12-23 01:49:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:00,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 01:49:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:00,251 INFO L225 Difference]: With dead ends: 550 [2020-12-23 01:49:00,251 INFO L226 Difference]: Without dead ends: 313 [2020-12-23 01:49:00,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-12-23 01:49:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2020-12-23 01:49:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2020-12-23 01:49:00,263 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 95 [2020-12-23 01:49:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:00,264 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2020-12-23 01:49:00,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2020-12-23 01:49:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 01:49:00,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:00,265 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:00,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:49:00,266 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1648304513, now seen corresponding path program 1 times [2020-12-23 01:49:00,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:00,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893169918] [2020-12-23 01:49:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:00,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893169918] [2020-12-23 01:49:00,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:00,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:00,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397019663] [2020-12-23 01:49:00,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:00,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:00,340 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2020-12-23 01:49:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:00,743 INFO L93 Difference]: Finished difference Result 515 states and 781 transitions. [2020-12-23 01:49:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:00,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 01:49:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:00,746 INFO L225 Difference]: With dead ends: 515 [2020-12-23 01:49:00,746 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 01:49:00,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 01:49:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2020-12-23 01:49:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2020-12-23 01:49:00,757 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 95 [2020-12-23 01:49:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:00,757 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2020-12-23 01:49:00,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2020-12-23 01:49:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:49:00,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:00,759 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:00,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:49:00,759 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -531550874, now seen corresponding path program 1 times [2020-12-23 01:49:00,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:00,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734948046] [2020-12-23 01:49:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:00,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734948046] [2020-12-23 01:49:00,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:00,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:00,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623151050] [2020-12-23 01:49:00,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:00,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:00,826 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2020-12-23 01:49:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:01,368 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2020-12-23 01:49:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:01,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:49:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:01,372 INFO L225 Difference]: With dead ends: 550 [2020-12-23 01:49:01,372 INFO L226 Difference]: Without dead ends: 313 [2020-12-23 01:49:01,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-12-23 01:49:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2020-12-23 01:49:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2020-12-23 01:49:01,383 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 96 [2020-12-23 01:49:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:01,383 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2020-12-23 01:49:01,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2020-12-23 01:49:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:49:01,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:01,385 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:01,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:49:01,386 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash 855234536, now seen corresponding path program 1 times [2020-12-23 01:49:01,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:01,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207239131] [2020-12-23 01:49:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:01,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207239131] [2020-12-23 01:49:01,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:01,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:01,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966003683] [2020-12-23 01:49:01,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:01,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:01,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:01,463 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2020-12-23 01:49:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:01,899 INFO L93 Difference]: Finished difference Result 515 states and 777 transitions. [2020-12-23 01:49:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:01,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:49:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:01,901 INFO L225 Difference]: With dead ends: 515 [2020-12-23 01:49:01,901 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 01:49:01,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 01:49:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2020-12-23 01:49:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2020-12-23 01:49:01,916 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 96 [2020-12-23 01:49:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:01,916 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2020-12-23 01:49:01,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2020-12-23 01:49:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:49:01,918 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:01,918 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:01,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:49:01,919 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -506910212, now seen corresponding path program 1 times [2020-12-23 01:49:01,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:01,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188593609] [2020-12-23 01:49:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:01,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188593609] [2020-12-23 01:49:01,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:01,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:01,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572800788] [2020-12-23 01:49:01,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:01,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:01,992 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2020-12-23 01:49:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:02,550 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2020-12-23 01:49:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:02,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:49:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:02,553 INFO L225 Difference]: With dead ends: 550 [2020-12-23 01:49:02,553 INFO L226 Difference]: Without dead ends: 313 [2020-12-23 01:49:02,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-12-23 01:49:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2020-12-23 01:49:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2020-12-23 01:49:02,564 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 97 [2020-12-23 01:49:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:02,564 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2020-12-23 01:49:02,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2020-12-23 01:49:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:49:02,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:02,566 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:02,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:49:02,567 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -466235462, now seen corresponding path program 1 times [2020-12-23 01:49:02,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:02,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496820536] [2020-12-23 01:49:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:02,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496820536] [2020-12-23 01:49:02,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:02,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:02,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583398499] [2020-12-23 01:49:02,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:02,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:02,650 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2020-12-23 01:49:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:03,073 INFO L93 Difference]: Finished difference Result 515 states and 773 transitions. [2020-12-23 01:49:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:03,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:49:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:03,077 INFO L225 Difference]: With dead ends: 515 [2020-12-23 01:49:03,077 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 01:49:03,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 01:49:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2020-12-23 01:49:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2020-12-23 01:49:03,087 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 97 [2020-12-23 01:49:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:03,088 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2020-12-23 01:49:03,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2020-12-23 01:49:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:49:03,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:03,089 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:03,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:49:03,089 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1364818879, now seen corresponding path program 1 times [2020-12-23 01:49:03,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:03,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877259713] [2020-12-23 01:49:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:03,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877259713] [2020-12-23 01:49:03,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:03,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:03,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864813084] [2020-12-23 01:49:03,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:03,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:03,168 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2020-12-23 01:49:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:03,706 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2020-12-23 01:49:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:03,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:49:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:03,708 INFO L225 Difference]: With dead ends: 540 [2020-12-23 01:49:03,708 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:49:03,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:49:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2020-12-23 01:49:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2020-12-23 01:49:03,719 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 98 [2020-12-23 01:49:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:03,720 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2020-12-23 01:49:03,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2020-12-23 01:49:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:49:03,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:03,721 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:03,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:49:03,722 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash -103901629, now seen corresponding path program 1 times [2020-12-23 01:49:03,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:03,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81224089] [2020-12-23 01:49:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:03,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81224089] [2020-12-23 01:49:03,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:03,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:03,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639045982] [2020-12-23 01:49:03,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:03,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:03,803 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2020-12-23 01:49:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:04,196 INFO L93 Difference]: Finished difference Result 505 states and 757 transitions. [2020-12-23 01:49:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:04,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:49:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:04,199 INFO L225 Difference]: With dead ends: 505 [2020-12-23 01:49:04,199 INFO L226 Difference]: Without dead ends: 268 [2020-12-23 01:49:04,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-12-23 01:49:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2020-12-23 01:49:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2020-12-23 01:49:04,209 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 98 [2020-12-23 01:49:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:04,209 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2020-12-23 01:49:04,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2020-12-23 01:49:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:49:04,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:04,211 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] [2020-12-23 01:49:04,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:49:04,211 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash -620164665, now seen corresponding path program 1 times [2020-12-23 01:49:04,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:04,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729656171] [2020-12-23 01:49:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:04,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729656171] [2020-12-23 01:49:04,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:04,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:04,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940557734] [2020-12-23 01:49:04,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:04,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:04,287 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2020-12-23 01:49:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:04,830 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2020-12-23 01:49:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:04,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:49:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:04,833 INFO L225 Difference]: With dead ends: 540 [2020-12-23 01:49:04,833 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:49:04,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:49:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2020-12-23 01:49:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 01:49:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2020-12-23 01:49:04,845 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 102 [2020-12-23 01:49:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:04,845 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2020-12-23 01:49:04,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2020-12-23 01:49:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:49:04,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:04,846 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] [2020-12-23 01:49:04,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:49:04,847 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1341409993, now seen corresponding path program 1 times [2020-12-23 01:49:04,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:04,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123979409] [2020-12-23 01:49:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:04,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123979409] [2020-12-23 01:49:04,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:04,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:04,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372773514] [2020-12-23 01:49:04,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:04,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:04,932 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2020-12-23 01:49:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:05,370 INFO L93 Difference]: Finished difference Result 546 states and 817 transitions. [2020-12-23 01:49:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:05,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:49:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:05,373 INFO L225 Difference]: With dead ends: 546 [2020-12-23 01:49:05,373 INFO L226 Difference]: Without dead ends: 309 [2020-12-23 01:49:05,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-23 01:49:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 282. [2020-12-23 01:49:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 424 transitions. [2020-12-23 01:49:05,384 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 424 transitions. Word has length 102 [2020-12-23 01:49:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:05,384 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 424 transitions. [2020-12-23 01:49:05,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 424 transitions. [2020-12-23 01:49:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:49:05,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:05,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:05,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:49:05,386 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -369071582, now seen corresponding path program 1 times [2020-12-23 01:49:05,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:05,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285256889] [2020-12-23 01:49:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:05,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285256889] [2020-12-23 01:49:05,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:05,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:05,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121317569] [2020-12-23 01:49:05,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:05,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:05,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:05,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:05,476 INFO L87 Difference]: Start difference. First operand 282 states and 424 transitions. Second operand 4 states. [2020-12-23 01:49:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:06,014 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2020-12-23 01:49:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:06,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-23 01:49:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:06,017 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:49:06,017 INFO L226 Difference]: Without dead ends: 329 [2020-12-23 01:49:06,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-12-23 01:49:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 282. [2020-12-23 01:49:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 423 transitions. [2020-12-23 01:49:06,029 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 423 transitions. Word has length 105 [2020-12-23 01:49:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:06,030 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 423 transitions. [2020-12-23 01:49:06,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 423 transitions. [2020-12-23 01:49:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:49:06,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:06,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:06,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:49:06,032 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 802506503, now seen corresponding path program 1 times [2020-12-23 01:49:06,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:06,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669146606] [2020-12-23 01:49:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:06,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669146606] [2020-12-23 01:49:06,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:06,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:06,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852630850] [2020-12-23 01:49:06,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:06,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:06,113 INFO L87 Difference]: Start difference. First operand 282 states and 423 transitions. Second operand 4 states. [2020-12-23 01:49:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:06,648 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2020-12-23 01:49:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:06,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 01:49:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:06,652 INFO L225 Difference]: With dead ends: 584 [2020-12-23 01:49:06,652 INFO L226 Difference]: Without dead ends: 321 [2020-12-23 01:49:06,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-23 01:49:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2020-12-23 01:49:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 422 transitions. [2020-12-23 01:49:06,663 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 422 transitions. Word has length 106 [2020-12-23 01:49:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:06,663 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 422 transitions. [2020-12-23 01:49:06,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 422 transitions. [2020-12-23 01:49:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 01:49:06,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:06,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:06,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:49:06,665 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1208871294, now seen corresponding path program 1 times [2020-12-23 01:49:06,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:06,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621763326] [2020-12-23 01:49:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:06,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621763326] [2020-12-23 01:49:06,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:06,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:06,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438210326] [2020-12-23 01:49:06,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:06,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:06,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:06,762 INFO L87 Difference]: Start difference. First operand 282 states and 422 transitions. Second operand 4 states. [2020-12-23 01:49:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:07,310 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2020-12-23 01:49:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:07,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2020-12-23 01:49:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:07,313 INFO L225 Difference]: With dead ends: 584 [2020-12-23 01:49:07,314 INFO L226 Difference]: Without dead ends: 321 [2020-12-23 01:49:07,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-23 01:49:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2020-12-23 01:49:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 421 transitions. [2020-12-23 01:49:07,327 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 421 transitions. Word has length 107 [2020-12-23 01:49:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:07,327 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 421 transitions. [2020-12-23 01:49:07,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 421 transitions. [2020-12-23 01:49:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 01:49:07,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:07,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:07,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 01:49:07,329 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -819208804, now seen corresponding path program 1 times [2020-12-23 01:49:07,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:07,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923290997] [2020-12-23 01:49:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:07,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923290997] [2020-12-23 01:49:07,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:07,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:07,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726861057] [2020-12-23 01:49:07,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:07,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:07,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:07,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:07,416 INFO L87 Difference]: Start difference. First operand 282 states and 421 transitions. Second operand 4 states. [2020-12-23 01:49:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:07,932 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2020-12-23 01:49:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:07,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2020-12-23 01:49:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:07,935 INFO L225 Difference]: With dead ends: 584 [2020-12-23 01:49:07,935 INFO L226 Difference]: Without dead ends: 321 [2020-12-23 01:49:07,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-23 01:49:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2020-12-23 01:49:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2020-12-23 01:49:07,961 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 108 [2020-12-23 01:49:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:07,962 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2020-12-23 01:49:07,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2020-12-23 01:49:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 01:49:07,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:07,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:07,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 01:49:07,964 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1320802695, now seen corresponding path program 1 times [2020-12-23 01:49:07,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:07,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382329712] [2020-12-23 01:49:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:08,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382329712] [2020-12-23 01:49:08,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:08,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:08,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059573925] [2020-12-23 01:49:08,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:08,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:08,071 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2020-12-23 01:49:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:08,592 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2020-12-23 01:49:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:08,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2020-12-23 01:49:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:08,595 INFO L225 Difference]: With dead ends: 582 [2020-12-23 01:49:08,595 INFO L226 Difference]: Without dead ends: 319 [2020-12-23 01:49:08,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-12-23 01:49:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 282. [2020-12-23 01:49:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 419 transitions. [2020-12-23 01:49:08,607 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 419 transitions. Word has length 108 [2020-12-23 01:49:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:08,607 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 419 transitions. [2020-12-23 01:49:08,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 419 transitions. [2020-12-23 01:49:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 01:49:08,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:08,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:08,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 01:49:08,609 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash -463707657, now seen corresponding path program 1 times [2020-12-23 01:49:08,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:08,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220849129] [2020-12-23 01:49:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:08,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220849129] [2020-12-23 01:49:08,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:08,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:08,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628882948] [2020-12-23 01:49:08,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:08,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:08,705 INFO L87 Difference]: Start difference. First operand 282 states and 419 transitions. Second operand 4 states. [2020-12-23 01:49:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:09,204 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2020-12-23 01:49:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:09,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-12-23 01:49:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:09,208 INFO L225 Difference]: With dead ends: 580 [2020-12-23 01:49:09,208 INFO L226 Difference]: Without dead ends: 317 [2020-12-23 01:49:09,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-12-23 01:49:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2020-12-23 01:49:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 418 transitions. [2020-12-23 01:49:09,220 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 418 transitions. Word has length 109 [2020-12-23 01:49:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:09,220 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 418 transitions. [2020-12-23 01:49:09,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 418 transitions. [2020-12-23 01:49:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 01:49:09,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:09,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:09,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 01:49:09,222 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -977169504, now seen corresponding path program 1 times [2020-12-23 01:49:09,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:09,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659297306] [2020-12-23 01:49:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:09,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659297306] [2020-12-23 01:49:09,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:09,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:09,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964277651] [2020-12-23 01:49:09,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:09,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:09,326 INFO L87 Difference]: Start difference. First operand 282 states and 418 transitions. Second operand 4 states. [2020-12-23 01:49:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:09,816 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2020-12-23 01:49:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:09,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-12-23 01:49:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:09,818 INFO L225 Difference]: With dead ends: 577 [2020-12-23 01:49:09,818 INFO L226 Difference]: Without dead ends: 314 [2020-12-23 01:49:09,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-12-23 01:49:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2020-12-23 01:49:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 417 transitions. [2020-12-23 01:49:09,829 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 417 transitions. Word has length 109 [2020-12-23 01:49:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:09,829 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 417 transitions. [2020-12-23 01:49:09,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 417 transitions. [2020-12-23 01:49:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 01:49:09,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:09,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:09,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 01:49:09,831 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash 863494017, now seen corresponding path program 1 times [2020-12-23 01:49:09,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:09,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412654499] [2020-12-23 01:49:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:09,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412654499] [2020-12-23 01:49:09,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:09,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:09,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936398173] [2020-12-23 01:49:09,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:09,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:09,917 INFO L87 Difference]: Start difference. First operand 282 states and 417 transitions. Second operand 4 states. [2020-12-23 01:49:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:10,383 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2020-12-23 01:49:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:10,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-23 01:49:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:10,385 INFO L225 Difference]: With dead ends: 577 [2020-12-23 01:49:10,385 INFO L226 Difference]: Without dead ends: 314 [2020-12-23 01:49:10,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-12-23 01:49:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2020-12-23 01:49:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 416 transitions. [2020-12-23 01:49:10,396 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 416 transitions. Word has length 112 [2020-12-23 01:49:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:10,397 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 416 transitions. [2020-12-23 01:49:10,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 416 transitions. [2020-12-23 01:49:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 01:49:10,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:10,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:10,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 01:49:10,399 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -126256681, now seen corresponding path program 1 times [2020-12-23 01:49:10,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:10,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456612603] [2020-12-23 01:49:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:10,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456612603] [2020-12-23 01:49:10,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:10,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:10,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753894748] [2020-12-23 01:49:10,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:10,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:10,498 INFO L87 Difference]: Start difference. First operand 282 states and 416 transitions. Second operand 4 states. [2020-12-23 01:49:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:10,964 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2020-12-23 01:49:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:10,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-12-23 01:49:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:10,967 INFO L225 Difference]: With dead ends: 571 [2020-12-23 01:49:10,967 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 01:49:10,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 01:49:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 282. [2020-12-23 01:49:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2020-12-23 01:49:10,978 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 113 [2020-12-23 01:49:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:10,979 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2020-12-23 01:49:10,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2020-12-23 01:49:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 01:49:10,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:10,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:10,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 01:49:10,981 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1518797521, now seen corresponding path program 1 times [2020-12-23 01:49:10,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:10,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100992306] [2020-12-23 01:49:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:11,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100992306] [2020-12-23 01:49:11,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:11,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:11,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528693147] [2020-12-23 01:49:11,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:11,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:11,071 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand 4 states. [2020-12-23 01:49:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:11,535 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2020-12-23 01:49:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:11,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-12-23 01:49:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:11,537 INFO L225 Difference]: With dead ends: 571 [2020-12-23 01:49:11,538 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 01:49:11,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 01:49:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 282. [2020-12-23 01:49:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 414 transitions. [2020-12-23 01:49:11,550 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 414 transitions. Word has length 113 [2020-12-23 01:49:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:11,550 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 414 transitions. [2020-12-23 01:49:11,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 414 transitions. [2020-12-23 01:49:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 01:49:11,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:11,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:11,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 01:49:11,552 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash 433296347, now seen corresponding path program 1 times [2020-12-23 01:49:11,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:11,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15127168] [2020-12-23 01:49:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:11,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15127168] [2020-12-23 01:49:11,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:11,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:11,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687875688] [2020-12-23 01:49:11,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:11,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:11,654 INFO L87 Difference]: Start difference. First operand 282 states and 414 transitions. Second operand 4 states. [2020-12-23 01:49:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:12,120 INFO L93 Difference]: Finished difference Result 568 states and 839 transitions. [2020-12-23 01:49:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:12,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2020-12-23 01:49:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:12,123 INFO L225 Difference]: With dead ends: 568 [2020-12-23 01:49:12,123 INFO L226 Difference]: Without dead ends: 305 [2020-12-23 01:49:12,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-23 01:49:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 282. [2020-12-23 01:49:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2020-12-23 01:49:12,136 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 114 [2020-12-23 01:49:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:12,136 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2020-12-23 01:49:12,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2020-12-23 01:49:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 01:49:12,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:12,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:12,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 01:49:12,138 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1778534199, now seen corresponding path program 1 times [2020-12-23 01:49:12,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:12,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565901131] [2020-12-23 01:49:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:12,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565901131] [2020-12-23 01:49:12,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:12,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:12,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488406789] [2020-12-23 01:49:12,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:12,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:12,237 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand 4 states. [2020-12-23 01:49:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:12,726 INFO L93 Difference]: Finished difference Result 568 states and 837 transitions. [2020-12-23 01:49:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:12,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-12-23 01:49:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:12,729 INFO L225 Difference]: With dead ends: 568 [2020-12-23 01:49:12,729 INFO L226 Difference]: Without dead ends: 305 [2020-12-23 01:49:12,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-23 01:49:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 282. [2020-12-23 01:49:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 01:49:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2020-12-23 01:49:12,742 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 115 [2020-12-23 01:49:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:12,743 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2020-12-23 01:49:12,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2020-12-23 01:49:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 01:49:12,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:12,744 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:12,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-23 01:49:12,745 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1965605648, now seen corresponding path program 1 times [2020-12-23 01:49:12,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:12,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201877969] [2020-12-23 01:49:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 01:49:12,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201877969] [2020-12-23 01:49:12,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:12,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:12,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89148628] [2020-12-23 01:49:12,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:12,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:12,844 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand 4 states. [2020-12-23 01:49:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:13,365 INFO L93 Difference]: Finished difference Result 617 states and 914 transitions. [2020-12-23 01:49:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:13,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-12-23 01:49:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:13,368 INFO L225 Difference]: With dead ends: 617 [2020-12-23 01:49:13,368 INFO L226 Difference]: Without dead ends: 354 [2020-12-23 01:49:13,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-12-23 01:49:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 314. [2020-12-23 01:49:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-12-23 01:49:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 469 transitions. [2020-12-23 01:49:13,380 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 469 transitions. Word has length 115 [2020-12-23 01:49:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:13,381 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 469 transitions. [2020-12-23 01:49:13,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 469 transitions. [2020-12-23 01:49:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 01:49:13,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:13,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:13,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-23 01:49:13,383 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1736110093, now seen corresponding path program 1 times [2020-12-23 01:49:13,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:13,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312718098] [2020-12-23 01:49:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:13,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312718098] [2020-12-23 01:49:13,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:13,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:13,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273573832] [2020-12-23 01:49:13,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:13,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:13,481 INFO L87 Difference]: Start difference. First operand 314 states and 469 transitions. Second operand 4 states. [2020-12-23 01:49:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:13,945 INFO L93 Difference]: Finished difference Result 629 states and 945 transitions. [2020-12-23 01:49:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:13,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2020-12-23 01:49:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:13,947 INFO L225 Difference]: With dead ends: 629 [2020-12-23 01:49:13,947 INFO L226 Difference]: Without dead ends: 334 [2020-12-23 01:49:13,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-12-23 01:49:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 314. [2020-12-23 01:49:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-12-23 01:49:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 468 transitions. [2020-12-23 01:49:13,975 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 468 transitions. Word has length 116 [2020-12-23 01:49:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:13,977 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 468 transitions. [2020-12-23 01:49:13,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 468 transitions. [2020-12-23 01:49:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 01:49:13,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:13,978 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:13,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-23 01:49:13,979 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash 498059615, now seen corresponding path program 1 times [2020-12-23 01:49:13,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:13,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866591742] [2020-12-23 01:49:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:14,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866591742] [2020-12-23 01:49:14,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:14,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:14,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346018] [2020-12-23 01:49:14,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:14,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:14,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:14,063 INFO L87 Difference]: Start difference. First operand 314 states and 468 transitions. Second operand 4 states. [2020-12-23 01:49:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:14,648 INFO L93 Difference]: Finished difference Result 715 states and 1078 transitions. [2020-12-23 01:49:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:14,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2020-12-23 01:49:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:14,651 INFO L225 Difference]: With dead ends: 715 [2020-12-23 01:49:14,652 INFO L226 Difference]: Without dead ends: 420 [2020-12-23 01:49:14,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-12-23 01:49:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 353. [2020-12-23 01:49:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-12-23 01:49:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2020-12-23 01:49:14,665 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 116 [2020-12-23 01:49:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:14,665 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2020-12-23 01:49:14,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2020-12-23 01:49:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 01:49:14,666 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:14,667 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:14,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-23 01:49:14,667 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1747804641, now seen corresponding path program 1 times [2020-12-23 01:49:14,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:14,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399830547] [2020-12-23 01:49:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:14,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399830547] [2020-12-23 01:49:14,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:14,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:14,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452906283] [2020-12-23 01:49:14,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:14,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:14,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:14,747 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand 4 states. [2020-12-23 01:49:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:15,380 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2020-12-23 01:49:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:15,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 01:49:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:15,384 INFO L225 Difference]: With dead ends: 748 [2020-12-23 01:49:15,384 INFO L226 Difference]: Without dead ends: 414 [2020-12-23 01:49:15,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-12-23 01:49:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 352. [2020-12-23 01:49:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-12-23 01:49:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 538 transitions. [2020-12-23 01:49:15,400 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 538 transitions. Word has length 117 [2020-12-23 01:49:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:15,401 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 538 transitions. [2020-12-23 01:49:15,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 538 transitions. [2020-12-23 01:49:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 01:49:15,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:15,403 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:15,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-23 01:49:15,403 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1970836820, now seen corresponding path program 1 times [2020-12-23 01:49:15,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:15,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046598156] [2020-12-23 01:49:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:15,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046598156] [2020-12-23 01:49:15,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:15,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:15,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871157781] [2020-12-23 01:49:15,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:15,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:15,495 INFO L87 Difference]: Start difference. First operand 352 states and 538 transitions. Second operand 4 states. [2020-12-23 01:49:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:15,917 INFO L93 Difference]: Finished difference Result 712 states and 1089 transitions. [2020-12-23 01:49:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:15,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 01:49:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:15,922 INFO L225 Difference]: With dead ends: 712 [2020-12-23 01:49:15,923 INFO L226 Difference]: Without dead ends: 379 [2020-12-23 01:49:15,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-12-23 01:49:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2020-12-23 01:49:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-12-23 01:49:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 537 transitions. [2020-12-23 01:49:15,937 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 537 transitions. Word has length 117 [2020-12-23 01:49:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:15,937 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 537 transitions. [2020-12-23 01:49:15,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 537 transitions. [2020-12-23 01:49:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 01:49:15,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:15,939 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:15,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-23 01:49:15,939 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:15,940 INFO L82 PathProgramCache]: Analyzing trace with hash -553332389, now seen corresponding path program 1 times [2020-12-23 01:49:15,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:15,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88888880] [2020-12-23 01:49:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:16,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88888880] [2020-12-23 01:49:16,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:16,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:16,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057859612] [2020-12-23 01:49:16,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:16,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:16,067 INFO L87 Difference]: Start difference. First operand 352 states and 537 transitions. Second operand 4 states. [2020-12-23 01:49:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:16,491 INFO L93 Difference]: Finished difference Result 712 states and 1087 transitions. [2020-12-23 01:49:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:16,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2020-12-23 01:49:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:16,494 INFO L225 Difference]: With dead ends: 712 [2020-12-23 01:49:16,494 INFO L226 Difference]: Without dead ends: 379 [2020-12-23 01:49:16,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-12-23 01:49:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2020-12-23 01:49:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-12-23 01:49:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 536 transitions. [2020-12-23 01:49:16,505 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 536 transitions. Word has length 118 [2020-12-23 01:49:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:16,505 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 536 transitions. [2020-12-23 01:49:16,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 536 transitions. [2020-12-23 01:49:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 01:49:16,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:16,506 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:16,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-23 01:49:16,507 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1182137177, now seen corresponding path program 1 times [2020-12-23 01:49:16,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:16,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122586750] [2020-12-23 01:49:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:16,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122586750] [2020-12-23 01:49:16,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:16,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:16,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452728112] [2020-12-23 01:49:16,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:16,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:16,584 INFO L87 Difference]: Start difference. First operand 352 states and 536 transitions. Second operand 4 states. [2020-12-23 01:49:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:16,997 INFO L93 Difference]: Finished difference Result 712 states and 1085 transitions. [2020-12-23 01:49:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:16,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2020-12-23 01:49:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:17,001 INFO L225 Difference]: With dead ends: 712 [2020-12-23 01:49:17,001 INFO L226 Difference]: Without dead ends: 379 [2020-12-23 01:49:17,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-12-23 01:49:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2020-12-23 01:49:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-12-23 01:49:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 535 transitions. [2020-12-23 01:49:17,016 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 535 transitions. Word has length 119 [2020-12-23 01:49:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:17,016 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 535 transitions. [2020-12-23 01:49:17,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 535 transitions. [2020-12-23 01:49:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 01:49:17,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:17,017 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:17,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-23 01:49:17,018 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash -822018314, now seen corresponding path program 1 times [2020-12-23 01:49:17,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:17,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581169036] [2020-12-23 01:49:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:17,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581169036] [2020-12-23 01:49:17,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:17,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:17,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651020152] [2020-12-23 01:49:17,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:17,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:17,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:17,101 INFO L87 Difference]: Start difference. First operand 352 states and 535 transitions. Second operand 4 states. [2020-12-23 01:49:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:17,530 INFO L93 Difference]: Finished difference Result 702 states and 1071 transitions. [2020-12-23 01:49:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:17,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 01:49:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:17,532 INFO L225 Difference]: With dead ends: 702 [2020-12-23 01:49:17,533 INFO L226 Difference]: Without dead ends: 369 [2020-12-23 01:49:17,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-12-23 01:49:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 352. [2020-12-23 01:49:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-12-23 01:49:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 534 transitions. [2020-12-23 01:49:17,555 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 534 transitions. Word has length 120 [2020-12-23 01:49:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:17,555 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 534 transitions. [2020-12-23 01:49:17,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 534 transitions. [2020-12-23 01:49:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:49:17,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:17,557 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:17,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-23 01:49:17,557 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1871688814, now seen corresponding path program 1 times [2020-12-23 01:49:17,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:17,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376179529] [2020-12-23 01:49:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:17,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376179529] [2020-12-23 01:49:17,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:17,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:49:17,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418774447] [2020-12-23 01:49:17,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:49:17,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:49:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:49:17,626 INFO L87 Difference]: Start difference. First operand 352 states and 534 transitions. Second operand 3 states. [2020-12-23 01:49:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:17,753 INFO L93 Difference]: Finished difference Result 1013 states and 1552 transitions. [2020-12-23 01:49:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:49:17,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-23 01:49:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:17,756 INFO L225 Difference]: With dead ends: 1013 [2020-12-23 01:49:17,757 INFO L226 Difference]: Without dead ends: 680 [2020-12-23 01:49:17,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:49:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-12-23 01:49:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2020-12-23 01:49:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2020-12-23 01:49:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1027 transitions. [2020-12-23 01:49:17,782 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1027 transitions. Word has length 121 [2020-12-23 01:49:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:17,782 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 1027 transitions. [2020-12-23 01:49:17,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:49:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1027 transitions. [2020-12-23 01:49:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:49:17,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:17,784 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:17,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-12-23 01:49:17,784 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1051471184, now seen corresponding path program 1 times [2020-12-23 01:49:17,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:17,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905482204] [2020-12-23 01:49:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:17,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905482204] [2020-12-23 01:49:17,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:17,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:17,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540035326] [2020-12-23 01:49:17,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:17,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:17,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:17,869 INFO L87 Difference]: Start difference. First operand 678 states and 1027 transitions. Second operand 4 states. [2020-12-23 01:49:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:18,517 INFO L93 Difference]: Finished difference Result 1544 states and 2346 transitions. [2020-12-23 01:49:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:18,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-12-23 01:49:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:18,521 INFO L225 Difference]: With dead ends: 1544 [2020-12-23 01:49:18,523 INFO L226 Difference]: Without dead ends: 885 [2020-12-23 01:49:18,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-23 01:49:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 756. [2020-12-23 01:49:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-12-23 01:49:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1169 transitions. [2020-12-23 01:49:18,562 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1169 transitions. Word has length 121 [2020-12-23 01:49:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:18,562 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1169 transitions. [2020-12-23 01:49:18,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1169 transitions. [2020-12-23 01:49:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:49:18,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:18,565 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:18,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-12-23 01:49:18,565 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1771915186, now seen corresponding path program 1 times [2020-12-23 01:49:18,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:18,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407250690] [2020-12-23 01:49:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:18,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407250690] [2020-12-23 01:49:18,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:18,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:18,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197217019] [2020-12-23 01:49:18,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:18,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:18,664 INFO L87 Difference]: Start difference. First operand 756 states and 1169 transitions. Second operand 4 states. [2020-12-23 01:49:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:19,290 INFO L93 Difference]: Finished difference Result 1614 states and 2477 transitions. [2020-12-23 01:49:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:19,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2020-12-23 01:49:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:19,294 INFO L225 Difference]: With dead ends: 1614 [2020-12-23 01:49:19,294 INFO L226 Difference]: Without dead ends: 877 [2020-12-23 01:49:19,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2020-12-23 01:49:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 678. [2020-12-23 01:49:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2020-12-23 01:49:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1027 transitions. [2020-12-23 01:49:19,316 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1027 transitions. Word has length 122 [2020-12-23 01:49:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:19,316 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 1027 transitions. [2020-12-23 01:49:19,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1027 transitions. [2020-12-23 01:49:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 01:49:19,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:19,319 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, 1, 1] [2020-12-23 01:49:19,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-12-23 01:49:19,319 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1718013730, now seen corresponding path program 1 times [2020-12-23 01:49:19,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:19,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682482375] [2020-12-23 01:49:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:19,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682482375] [2020-12-23 01:49:19,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:19,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:19,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189240292] [2020-12-23 01:49:19,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:19,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:19,429 INFO L87 Difference]: Start difference. First operand 678 states and 1027 transitions. Second operand 4 states. [2020-12-23 01:49:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:19,902 INFO L93 Difference]: Finished difference Result 1368 states and 2072 transitions. [2020-12-23 01:49:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:19,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2020-12-23 01:49:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:19,906 INFO L225 Difference]: With dead ends: 1368 [2020-12-23 01:49:19,906 INFO L226 Difference]: Without dead ends: 709 [2020-12-23 01:49:19,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 [2020-12-23 01:49:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-12-23 01:49:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 684. [2020-12-23 01:49:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-12-23 01:49:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1033 transitions. [2020-12-23 01:49:19,929 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1033 transitions. Word has length 123 [2020-12-23 01:49:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:19,929 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1033 transitions. [2020-12-23 01:49:19,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1033 transitions. [2020-12-23 01:49:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 01:49:19,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:19,932 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:19,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-12-23 01:49:19,932 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 811271589, now seen corresponding path program 1 times [2020-12-23 01:49:19,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:19,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743659722] [2020-12-23 01:49:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:20,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743659722] [2020-12-23 01:49:20,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:20,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:20,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461484884] [2020-12-23 01:49:20,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:20,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:20,012 INFO L87 Difference]: Start difference. First operand 684 states and 1033 transitions. Second operand 4 states. [2020-12-23 01:49:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:20,421 INFO L93 Difference]: Finished difference Result 1382 states and 2086 transitions. [2020-12-23 01:49:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:20,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-12-23 01:49:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:20,426 INFO L225 Difference]: With dead ends: 1382 [2020-12-23 01:49:20,426 INFO L226 Difference]: Without dead ends: 717 [2020-12-23 01:49:20,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2020-12-23 01:49:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 684. [2020-12-23 01:49:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-12-23 01:49:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1031 transitions. [2020-12-23 01:49:20,449 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1031 transitions. Word has length 130 [2020-12-23 01:49:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:20,449 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1031 transitions. [2020-12-23 01:49:20,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1031 transitions. [2020-12-23 01:49:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 01:49:20,451 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:20,452 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, 1, 1, 1] [2020-12-23 01:49:20,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-12-23 01:49:20,452 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 166214161, now seen corresponding path program 1 times [2020-12-23 01:49:20,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:20,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026339788] [2020-12-23 01:49:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:49:20,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026339788] [2020-12-23 01:49:20,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:20,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:20,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508564895] [2020-12-23 01:49:20,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:20,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:20,558 INFO L87 Difference]: Start difference. First operand 684 states and 1031 transitions. Second operand 4 states. [2020-12-23 01:49:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:21,087 INFO L93 Difference]: Finished difference Result 1474 states and 2232 transitions. [2020-12-23 01:49:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:21,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-12-23 01:49:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:21,092 INFO L225 Difference]: With dead ends: 1474 [2020-12-23 01:49:21,093 INFO L226 Difference]: Without dead ends: 809 [2020-12-23 01:49:21,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2020-12-23 01:49:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 740. [2020-12-23 01:49:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 01:49:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1129 transitions. [2020-12-23 01:49:21,121 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1129 transitions. Word has length 130 [2020-12-23 01:49:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:21,122 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1129 transitions. [2020-12-23 01:49:21,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1129 transitions. [2020-12-23 01:49:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 01:49:21,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:21,124 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:21,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-12-23 01:49:21,124 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:21,125 INFO L82 PathProgramCache]: Analyzing trace with hash -450159466, now seen corresponding path program 1 times [2020-12-23 01:49:21,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:21,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326836276] [2020-12-23 01:49:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:21,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326836276] [2020-12-23 01:49:21,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:21,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:21,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793566025] [2020-12-23 01:49:21,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:21,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:21,201 INFO L87 Difference]: Start difference. First operand 740 states and 1129 transitions. Second operand 4 states. [2020-12-23 01:49:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:21,584 INFO L93 Difference]: Finished difference Result 1490 states and 2274 transitions. [2020-12-23 01:49:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:21,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-12-23 01:49:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:21,589 INFO L225 Difference]: With dead ends: 1490 [2020-12-23 01:49:21,589 INFO L226 Difference]: Without dead ends: 769 [2020-12-23 01:49:21,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2020-12-23 01:49:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 740. [2020-12-23 01:49:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 01:49:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1127 transitions. [2020-12-23 01:49:21,627 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1127 transitions. Word has length 131 [2020-12-23 01:49:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:21,628 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1127 transitions. [2020-12-23 01:49:21,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1127 transitions. [2020-12-23 01:49:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 01:49:21,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:21,630 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:21,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-12-23 01:49:21,630 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash 639118678, now seen corresponding path program 1 times [2020-12-23 01:49:21,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:21,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270808154] [2020-12-23 01:49:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:21,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270808154] [2020-12-23 01:49:21,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:21,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:21,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847520919] [2020-12-23 01:49:21,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:21,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:21,711 INFO L87 Difference]: Start difference. First operand 740 states and 1127 transitions. Second operand 4 states. [2020-12-23 01:49:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:22,397 INFO L93 Difference]: Finished difference Result 1660 states and 2533 transitions. [2020-12-23 01:49:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:22,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-12-23 01:49:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:22,402 INFO L225 Difference]: With dead ends: 1660 [2020-12-23 01:49:22,403 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:22,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 764. [2020-12-23 01:49:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2020-12-23 01:49:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1161 transitions. [2020-12-23 01:49:22,433 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1161 transitions. Word has length 131 [2020-12-23 01:49:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:22,433 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 1161 transitions. [2020-12-23 01:49:22,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1161 transitions. [2020-12-23 01:49:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 01:49:22,435 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:22,435 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:22,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-12-23 01:49:22,435 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1249090575, now seen corresponding path program 1 times [2020-12-23 01:49:22,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:22,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090173615] [2020-12-23 01:49:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:22,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090173615] [2020-12-23 01:49:22,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:22,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:22,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861918611] [2020-12-23 01:49:22,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:22,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:22,532 INFO L87 Difference]: Start difference. First operand 764 states and 1161 transitions. Second operand 4 states. [2020-12-23 01:49:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:23,112 INFO L93 Difference]: Finished difference Result 1684 states and 2565 transitions. [2020-12-23 01:49:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:23,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2020-12-23 01:49:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:23,118 INFO L225 Difference]: With dead ends: 1684 [2020-12-23 01:49:23,119 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:23,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 [2020-12-23 01:49:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 766. [2020-12-23 01:49:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2020-12-23 01:49:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1163 transitions. [2020-12-23 01:49:23,149 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1163 transitions. Word has length 132 [2020-12-23 01:49:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:23,150 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1163 transitions. [2020-12-23 01:49:23,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1163 transitions. [2020-12-23 01:49:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 01:49:23,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:23,152 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:23,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-12-23 01:49:23,152 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1275804463, now seen corresponding path program 1 times [2020-12-23 01:49:23,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:23,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169418773] [2020-12-23 01:49:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:23,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169418773] [2020-12-23 01:49:23,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:23,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:23,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52799523] [2020-12-23 01:49:23,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:23,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:23,234 INFO L87 Difference]: Start difference. First operand 766 states and 1163 transitions. Second operand 4 states. [2020-12-23 01:49:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:23,798 INFO L93 Difference]: Finished difference Result 1686 states and 2565 transitions. [2020-12-23 01:49:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:23,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 01:49:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:23,803 INFO L225 Difference]: With dead ends: 1686 [2020-12-23 01:49:23,803 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:23,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 768. [2020-12-23 01:49:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2020-12-23 01:49:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1165 transitions. [2020-12-23 01:49:23,838 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1165 transitions. Word has length 133 [2020-12-23 01:49:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:23,838 INFO L481 AbstractCegarLoop]: Abstraction has 768 states and 1165 transitions. [2020-12-23 01:49:23,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1165 transitions. [2020-12-23 01:49:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 01:49:23,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:23,840 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:23,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-12-23 01:49:23,841 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 569263116, now seen corresponding path program 1 times [2020-12-23 01:49:23,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:23,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350052898] [2020-12-23 01:49:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:23,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350052898] [2020-12-23 01:49:23,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:23,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:23,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751512913] [2020-12-23 01:49:23,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:23,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:23,940 INFO L87 Difference]: Start difference. First operand 768 states and 1165 transitions. Second operand 4 states. [2020-12-23 01:49:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:24,529 INFO L93 Difference]: Finished difference Result 1668 states and 2541 transitions. [2020-12-23 01:49:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:24,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-12-23 01:49:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:24,534 INFO L225 Difference]: With dead ends: 1668 [2020-12-23 01:49:24,534 INFO L226 Difference]: Without dead ends: 919 [2020-12-23 01:49:24,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-12-23 01:49:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 770. [2020-12-23 01:49:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-12-23 01:49:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1167 transitions. [2020-12-23 01:49:24,561 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1167 transitions. Word has length 134 [2020-12-23 01:49:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:24,561 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1167 transitions. [2020-12-23 01:49:24,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1167 transitions. [2020-12-23 01:49:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 01:49:24,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:24,563 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:24,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-12-23 01:49:24,563 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 817580357, now seen corresponding path program 1 times [2020-12-23 01:49:24,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:24,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729996721] [2020-12-23 01:49:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:24,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729996721] [2020-12-23 01:49:24,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:24,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:24,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942494218] [2020-12-23 01:49:24,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:24,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:24,642 INFO L87 Difference]: Start difference. First operand 770 states and 1167 transitions. Second operand 4 states. [2020-12-23 01:49:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:25,261 INFO L93 Difference]: Finished difference Result 1690 states and 2565 transitions. [2020-12-23 01:49:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:25,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-23 01:49:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:25,281 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:25,281 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:25,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 770. [2020-12-23 01:49:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-12-23 01:49:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1165 transitions. [2020-12-23 01:49:25,311 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1165 transitions. Word has length 136 [2020-12-23 01:49:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:25,311 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1165 transitions. [2020-12-23 01:49:25,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1165 transitions. [2020-12-23 01:49:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 01:49:25,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:25,313 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:25,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-12-23 01:49:25,313 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -11745822, now seen corresponding path program 1 times [2020-12-23 01:49:25,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:25,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816783126] [2020-12-23 01:49:25,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:25,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816783126] [2020-12-23 01:49:25,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:25,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:25,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108767145] [2020-12-23 01:49:25,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:25,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:25,401 INFO L87 Difference]: Start difference. First operand 770 states and 1165 transitions. Second operand 4 states. [2020-12-23 01:49:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:26,016 INFO L93 Difference]: Finished difference Result 1690 states and 2561 transitions. [2020-12-23 01:49:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:26,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 01:49:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:26,019 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:26,019 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:26,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 770. [2020-12-23 01:49:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-12-23 01:49:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1163 transitions. [2020-12-23 01:49:26,055 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1163 transitions. Word has length 137 [2020-12-23 01:49:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:26,055 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1163 transitions. [2020-12-23 01:49:26,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1163 transitions. [2020-12-23 01:49:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 01:49:26,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:26,057 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:26,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-12-23 01:49:26,057 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1572822784, now seen corresponding path program 1 times [2020-12-23 01:49:26,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:26,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766966535] [2020-12-23 01:49:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:26,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766966535] [2020-12-23 01:49:26,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:26,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:26,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094693575] [2020-12-23 01:49:26,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:26,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:26,144 INFO L87 Difference]: Start difference. First operand 770 states and 1163 transitions. Second operand 4 states. [2020-12-23 01:49:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:26,820 INFO L93 Difference]: Finished difference Result 1690 states and 2557 transitions. [2020-12-23 01:49:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:26,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2020-12-23 01:49:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:26,828 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:26,828 INFO L226 Difference]: Without dead ends: 939 [2020-12-23 01:49:26,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2020-12-23 01:49:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 770. [2020-12-23 01:49:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-12-23 01:49:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1161 transitions. [2020-12-23 01:49:26,852 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1161 transitions. Word has length 138 [2020-12-23 01:49:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:26,852 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1161 transitions. [2020-12-23 01:49:26,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1161 transitions. [2020-12-23 01:49:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 01:49:26,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:26,855 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:26,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-12-23 01:49:26,855 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -48370243, now seen corresponding path program 1 times [2020-12-23 01:49:26,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:26,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273158465] [2020-12-23 01:49:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:26,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273158465] [2020-12-23 01:49:26,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:26,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:26,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844657268] [2020-12-23 01:49:26,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:26,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:26,954 INFO L87 Difference]: Start difference. First operand 770 states and 1161 transitions. Second operand 4 states. [2020-12-23 01:49:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:27,550 INFO L93 Difference]: Finished difference Result 1670 states and 2529 transitions. [2020-12-23 01:49:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:27,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2020-12-23 01:49:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:27,554 INFO L225 Difference]: With dead ends: 1670 [2020-12-23 01:49:27,554 INFO L226 Difference]: Without dead ends: 919 [2020-12-23 01:49:27,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-12-23 01:49:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 740. [2020-12-23 01:49:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 01:49:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1119 transitions. [2020-12-23 01:49:27,577 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1119 transitions. Word has length 139 [2020-12-23 01:49:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:27,577 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1119 transitions. [2020-12-23 01:49:27,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1119 transitions. [2020-12-23 01:49:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 01:49:27,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:27,578 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:27,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-12-23 01:49:27,579 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash -387817481, now seen corresponding path program 1 times [2020-12-23 01:49:27,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:27,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421275391] [2020-12-23 01:49:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:27,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421275391] [2020-12-23 01:49:27,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:27,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:27,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047281193] [2020-12-23 01:49:27,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:27,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:27,670 INFO L87 Difference]: Start difference. First operand 740 states and 1119 transitions. Second operand 4 states. [2020-12-23 01:49:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:28,248 INFO L93 Difference]: Finished difference Result 1640 states and 2485 transitions. [2020-12-23 01:49:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:28,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2020-12-23 01:49:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:28,251 INFO L225 Difference]: With dead ends: 1640 [2020-12-23 01:49:28,251 INFO L226 Difference]: Without dead ends: 919 [2020-12-23 01:49:28,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-12-23 01:49:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 796. [2020-12-23 01:49:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-12-23 01:49:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1209 transitions. [2020-12-23 01:49:28,290 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1209 transitions. Word has length 141 [2020-12-23 01:49:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:28,290 INFO L481 AbstractCegarLoop]: Abstraction has 796 states and 1209 transitions. [2020-12-23 01:49:28,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1209 transitions. [2020-12-23 01:49:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 01:49:28,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:28,293 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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] [2020-12-23 01:49:28,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-12-23 01:49:28,293 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 221383634, now seen corresponding path program 1 times [2020-12-23 01:49:28,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:28,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172418131] [2020-12-23 01:49:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:28,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172418131] [2020-12-23 01:49:28,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:28,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:28,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020257508] [2020-12-23 01:49:28,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:28,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:28,392 INFO L87 Difference]: Start difference. First operand 796 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:28,922 INFO L93 Difference]: Finished difference Result 1680 states and 2547 transitions. [2020-12-23 01:49:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:28,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-12-23 01:49:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:28,925 INFO L225 Difference]: With dead ends: 1680 [2020-12-23 01:49:28,925 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:49:28,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:49:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 798. [2020-12-23 01:49:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-12-23 01:49:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1211 transitions. [2020-12-23 01:49:28,959 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1211 transitions. Word has length 142 [2020-12-23 01:49:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:28,960 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1211 transitions. [2020-12-23 01:49:28,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1211 transitions. [2020-12-23 01:49:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 01:49:28,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:28,962 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:28,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-12-23 01:49:28,962 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -287480005, now seen corresponding path program 1 times [2020-12-23 01:49:28,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:28,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077944429] [2020-12-23 01:49:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:49:29,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077944429] [2020-12-23 01:49:29,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:29,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:29,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936412071] [2020-12-23 01:49:29,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:29,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:29,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:29,038 INFO L87 Difference]: Start difference. First operand 798 states and 1211 transitions. Second operand 4 states. [2020-12-23 01:49:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:29,569 INFO L93 Difference]: Finished difference Result 1682 states and 2547 transitions. [2020-12-23 01:49:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:29,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-12-23 01:49:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:29,573 INFO L225 Difference]: With dead ends: 1682 [2020-12-23 01:49:29,573 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:49:29,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:49:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 798. [2020-12-23 01:49:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-12-23 01:49:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1209 transitions. [2020-12-23 01:49:29,608 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1209 transitions. Word has length 144 [2020-12-23 01:49:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:29,608 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1209 transitions. [2020-12-23 01:49:29,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1209 transitions. [2020-12-23 01:49:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 01:49:29,610 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:29,610 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:29,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-12-23 01:49:29,610 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -151720512, now seen corresponding path program 1 times [2020-12-23 01:49:29,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:29,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419087339] [2020-12-23 01:49:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:49:29,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419087339] [2020-12-23 01:49:29,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:29,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:29,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562490337] [2020-12-23 01:49:29,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:29,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:29,692 INFO L87 Difference]: Start difference. First operand 798 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:30,197 INFO L93 Difference]: Finished difference Result 1678 states and 2539 transitions. [2020-12-23 01:49:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:30,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 01:49:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:30,199 INFO L225 Difference]: With dead ends: 1678 [2020-12-23 01:49:30,200 INFO L226 Difference]: Without dead ends: 899 [2020-12-23 01:49:30,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2020-12-23 01:49:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 798. [2020-12-23 01:49:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-12-23 01:49:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1207 transitions. [2020-12-23 01:49:30,231 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1207 transitions. Word has length 145 [2020-12-23 01:49:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:30,232 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1207 transitions. [2020-12-23 01:49:30,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1207 transitions. [2020-12-23 01:49:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 01:49:30,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:30,234 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:30,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-12-23 01:49:30,234 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -195389707, now seen corresponding path program 1 times [2020-12-23 01:49:30,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:30,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697165317] [2020-12-23 01:49:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:30,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697165317] [2020-12-23 01:49:30,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:30,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:30,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692398435] [2020-12-23 01:49:30,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:30,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:30,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:30,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:30,338 INFO L87 Difference]: Start difference. First operand 798 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:30,847 INFO L93 Difference]: Finished difference Result 1672 states and 2527 transitions. [2020-12-23 01:49:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:30,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 01:49:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:30,850 INFO L225 Difference]: With dead ends: 1672 [2020-12-23 01:49:30,850 INFO L226 Difference]: Without dead ends: 893 [2020-12-23 01:49:30,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-12-23 01:49:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 804. [2020-12-23 01:49:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1217 transitions. [2020-12-23 01:49:30,877 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1217 transitions. Word has length 145 [2020-12-23 01:49:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:30,877 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1217 transitions. [2020-12-23 01:49:30,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1217 transitions. [2020-12-23 01:49:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 01:49:30,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:30,879 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2020-12-23 01:49:30,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2020-12-23 01:49:30,879 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash -346160540, now seen corresponding path program 1 times [2020-12-23 01:49:30,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:30,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997171335] [2020-12-23 01:49:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:49:30,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997171335] [2020-12-23 01:49:30,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:30,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:30,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132694543] [2020-12-23 01:49:30,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:30,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:30,967 INFO L87 Difference]: Start difference. First operand 804 states and 1217 transitions. Second operand 4 states. [2020-12-23 01:49:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:31,451 INFO L93 Difference]: Finished difference Result 1658 states and 2504 transitions. [2020-12-23 01:49:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:31,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 01:49:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:31,454 INFO L225 Difference]: With dead ends: 1658 [2020-12-23 01:49:31,454 INFO L226 Difference]: Without dead ends: 873 [2020-12-23 01:49:31,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-12-23 01:49:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 804. [2020-12-23 01:49:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1215 transitions. [2020-12-23 01:49:31,489 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1215 transitions. Word has length 145 [2020-12-23 01:49:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:31,490 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1215 transitions. [2020-12-23 01:49:31,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1215 transitions. [2020-12-23 01:49:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 01:49:31,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:31,492 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, 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] [2020-12-23 01:49:31,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-12-23 01:49:31,493 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1679990054, now seen corresponding path program 1 times [2020-12-23 01:49:31,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:31,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48235897] [2020-12-23 01:49:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:31,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48235897] [2020-12-23 01:49:31,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:31,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:31,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149877704] [2020-12-23 01:49:31,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:31,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:31,580 INFO L87 Difference]: Start difference. First operand 804 states and 1215 transitions. Second operand 4 states. [2020-12-23 01:49:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:32,169 INFO L93 Difference]: Finished difference Result 1704 states and 2569 transitions. [2020-12-23 01:49:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:32,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2020-12-23 01:49:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:32,176 INFO L225 Difference]: With dead ends: 1704 [2020-12-23 01:49:32,176 INFO L226 Difference]: Without dead ends: 919 [2020-12-23 01:49:32,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-12-23 01:49:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 804. [2020-12-23 01:49:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1213 transitions. [2020-12-23 01:49:32,202 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1213 transitions. Word has length 146 [2020-12-23 01:49:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:32,202 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1213 transitions. [2020-12-23 01:49:32,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1213 transitions. [2020-12-23 01:49:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 01:49:32,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:32,205 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2020-12-23 01:49:32,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-12-23 01:49:32,205 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1727975261, now seen corresponding path program 1 times [2020-12-23 01:49:32,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:32,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755787405] [2020-12-23 01:49:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:49:32,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755787405] [2020-12-23 01:49:32,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:32,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:32,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581876791] [2020-12-23 01:49:32,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:32,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:32,284 INFO L87 Difference]: Start difference. First operand 804 states and 1213 transitions. Second operand 4 states. [2020-12-23 01:49:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:32,827 INFO L93 Difference]: Finished difference Result 1658 states and 2496 transitions. [2020-12-23 01:49:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:32,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2020-12-23 01:49:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:32,830 INFO L225 Difference]: With dead ends: 1658 [2020-12-23 01:49:32,830 INFO L226 Difference]: Without dead ends: 873 [2020-12-23 01:49:32,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-12-23 01:49:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 804. [2020-12-23 01:49:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1211 transitions. [2020-12-23 01:49:32,860 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1211 transitions. Word has length 146 [2020-12-23 01:49:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:32,860 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1211 transitions. [2020-12-23 01:49:32,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1211 transitions. [2020-12-23 01:49:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 01:49:32,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:32,862 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:32,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2020-12-23 01:49:32,862 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash -101092221, now seen corresponding path program 1 times [2020-12-23 01:49:32,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:32,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804826886] [2020-12-23 01:49:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:32,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804826886] [2020-12-23 01:49:32,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:32,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:32,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932482392] [2020-12-23 01:49:32,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:32,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:32,948 INFO L87 Difference]: Start difference. First operand 804 states and 1211 transitions. Second operand 4 states. [2020-12-23 01:49:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:33,497 INFO L93 Difference]: Finished difference Result 1688 states and 2535 transitions. [2020-12-23 01:49:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:33,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-12-23 01:49:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:33,500 INFO L225 Difference]: With dead ends: 1688 [2020-12-23 01:49:33,500 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:49:33,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:49:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 804. [2020-12-23 01:49:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1209 transitions. [2020-12-23 01:49:33,536 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1209 transitions. Word has length 147 [2020-12-23 01:49:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:33,536 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1209 transitions. [2020-12-23 01:49:33,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1209 transitions. [2020-12-23 01:49:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 01:49:33,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:33,538 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2020-12-23 01:49:33,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-12-23 01:49:33,539 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1058639455, now seen corresponding path program 1 times [2020-12-23 01:49:33,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:33,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581685327] [2020-12-23 01:49:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:49:33,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581685327] [2020-12-23 01:49:33,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:33,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:33,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592820823] [2020-12-23 01:49:33,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:33,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:33,646 INFO L87 Difference]: Start difference. First operand 804 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:34,142 INFO L93 Difference]: Finished difference Result 1658 states and 2488 transitions. [2020-12-23 01:49:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:34,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-12-23 01:49:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:34,144 INFO L225 Difference]: With dead ends: 1658 [2020-12-23 01:49:34,144 INFO L226 Difference]: Without dead ends: 873 [2020-12-23 01:49:34,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-12-23 01:49:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 804. [2020-12-23 01:49:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-12-23 01:49:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1207 transitions. [2020-12-23 01:49:34,179 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1207 transitions. Word has length 147 [2020-12-23 01:49:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:34,179 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1207 transitions. [2020-12-23 01:49:34,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1207 transitions. [2020-12-23 01:49:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 01:49:34,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:34,181 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:34,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-12-23 01:49:34,181 INFO L429 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2114027062, now seen corresponding path program 1 times [2020-12-23 01:49:34,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:34,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414542327] [2020-12-23 01:49:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:34,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414542327] [2020-12-23 01:49:34,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:34,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:34,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617744300] [2020-12-23 01:49:34,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:34,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:34,275 INFO L87 Difference]: Start difference. First operand 804 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:34,795 INFO L93 Difference]: Finished difference Result 1678 states and 2515 transitions. [2020-12-23 01:49:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:34,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 01:49:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:34,797 INFO L225 Difference]: With dead ends: 1678 [2020-12-23 01:49:34,797 INFO L226 Difference]: Without dead ends: 893 [2020-12-23 01:49:34,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-12-23 01:49:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 806. [2020-12-23 01:49:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-12-23 01:49:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1209 transitions. [2020-12-23 01:49:34,824 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1209 transitions. Word has length 148 [2020-12-23 01:49:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:34,825 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1209 transitions. [2020-12-23 01:49:34,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1209 transitions. [2020-12-23 01:49:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 01:49:34,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:34,827 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2020-12-23 01:49:34,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-12-23 01:49:34,827 INFO L429 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -77419458, now seen corresponding path program 1 times [2020-12-23 01:49:34,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:34,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925458872] [2020-12-23 01:49:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:49:34,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925458872] [2020-12-23 01:49:34,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:34,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:34,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754289252] [2020-12-23 01:49:34,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:34,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:34,908 INFO L87 Difference]: Start difference. First operand 806 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:35,382 INFO L93 Difference]: Finished difference Result 1642 states and 2464 transitions. [2020-12-23 01:49:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:35,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 01:49:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:35,385 INFO L225 Difference]: With dead ends: 1642 [2020-12-23 01:49:35,386 INFO L226 Difference]: Without dead ends: 855 [2020-12-23 01:49:35,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2020-12-23 01:49:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 806. [2020-12-23 01:49:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-12-23 01:49:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1207 transitions. [2020-12-23 01:49:35,416 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1207 transitions. Word has length 148 [2020-12-23 01:49:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:35,416 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1207 transitions. [2020-12-23 01:49:35,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1207 transitions. [2020-12-23 01:49:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 01:49:35,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:35,419 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:35,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2020-12-23 01:49:35,419 INFO L429 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash -949131348, now seen corresponding path program 1 times [2020-12-23 01:49:35,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:35,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369292404] [2020-12-23 01:49:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:35,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369292404] [2020-12-23 01:49:35,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:35,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:35,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699378728] [2020-12-23 01:49:35,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:35,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:35,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:35,504 INFO L87 Difference]: Start difference. First operand 806 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:36,111 INFO L93 Difference]: Finished difference Result 1690 states and 2523 transitions. [2020-12-23 01:49:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:36,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2020-12-23 01:49:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:36,115 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:36,115 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:49:36,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:49:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 806. [2020-12-23 01:49:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-12-23 01:49:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1205 transitions. [2020-12-23 01:49:36,158 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1205 transitions. Word has length 149 [2020-12-23 01:49:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:36,158 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1205 transitions. [2020-12-23 01:49:36,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1205 transitions. [2020-12-23 01:49:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 01:49:36,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:36,162 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:36,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2020-12-23 01:49:36,162 INFO L429 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash 264416362, now seen corresponding path program 1 times [2020-12-23 01:49:36,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:36,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303586775] [2020-12-23 01:49:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:36,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303586775] [2020-12-23 01:49:36,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:36,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:36,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956732225] [2020-12-23 01:49:36,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:36,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:36,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:36,257 INFO L87 Difference]: Start difference. First operand 806 states and 1205 transitions. Second operand 4 states. [2020-12-23 01:49:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:36,767 INFO L93 Difference]: Finished difference Result 1668 states and 2491 transitions. [2020-12-23 01:49:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:36,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2020-12-23 01:49:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:36,771 INFO L225 Difference]: With dead ends: 1668 [2020-12-23 01:49:36,771 INFO L226 Difference]: Without dead ends: 881 [2020-12-23 01:49:36,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-12-23 01:49:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 808. [2020-12-23 01:49:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-12-23 01:49:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1207 transitions. [2020-12-23 01:49:36,811 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1207 transitions. Word has length 149 [2020-12-23 01:49:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:36,811 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 1207 transitions. [2020-12-23 01:49:36,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1207 transitions. [2020-12-23 01:49:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 01:49:36,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:36,814 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:49:36,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-12-23 01:49:36,814 INFO L429 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1435910696, now seen corresponding path program 1 times [2020-12-23 01:49:36,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:36,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217084386] [2020-12-23 01:49:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:36,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217084386] [2020-12-23 01:49:36,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:36,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:36,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686658491] [2020-12-23 01:49:36,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:36,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:36,922 INFO L87 Difference]: Start difference. First operand 808 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:37,493 INFO L93 Difference]: Finished difference Result 1670 states and 2491 transitions. [2020-12-23 01:49:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:37,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2020-12-23 01:49:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:37,496 INFO L225 Difference]: With dead ends: 1670 [2020-12-23 01:49:37,496 INFO L226 Difference]: Without dead ends: 881 [2020-12-23 01:49:37,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-12-23 01:49:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 810. [2020-12-23 01:49:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-12-23 01:49:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1209 transitions. [2020-12-23 01:49:37,542 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1209 transitions. Word has length 149 [2020-12-23 01:49:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:37,542 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 1209 transitions. [2020-12-23 01:49:37,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1209 transitions. [2020-12-23 01:49:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 01:49:37,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:37,545 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:37,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-12-23 01:49:37,545 INFO L429 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 811924335, now seen corresponding path program 1 times [2020-12-23 01:49:37,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:37,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467693263] [2020-12-23 01:49:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:37,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467693263] [2020-12-23 01:49:37,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:37,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:37,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051020521] [2020-12-23 01:49:37,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:37,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:37,631 INFO L87 Difference]: Start difference. First operand 810 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:38,224 INFO L93 Difference]: Finished difference Result 1690 states and 2515 transitions. [2020-12-23 01:49:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:38,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-23 01:49:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:38,227 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:38,227 INFO L226 Difference]: Without dead ends: 899 [2020-12-23 01:49:38,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2020-12-23 01:49:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 810. [2020-12-23 01:49:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-12-23 01:49:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1207 transitions. [2020-12-23 01:49:38,260 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1207 transitions. Word has length 150 [2020-12-23 01:49:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:38,261 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 1207 transitions. [2020-12-23 01:49:38,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1207 transitions. [2020-12-23 01:49:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 01:49:38,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:38,262 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:38,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-12-23 01:49:38,263 INFO L429 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 768255140, now seen corresponding path program 1 times [2020-12-23 01:49:38,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:38,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965385788] [2020-12-23 01:49:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:38,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965385788] [2020-12-23 01:49:38,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:38,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:38,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949359637] [2020-12-23 01:49:38,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:38,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:38,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:38,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:38,368 INFO L87 Difference]: Start difference. First operand 810 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:38,872 INFO L93 Difference]: Finished difference Result 1684 states and 2503 transitions. [2020-12-23 01:49:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:38,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-23 01:49:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:38,877 INFO L225 Difference]: With dead ends: 1684 [2020-12-23 01:49:38,877 INFO L226 Difference]: Without dead ends: 893 [2020-12-23 01:49:38,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-12-23 01:49:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 810. [2020-12-23 01:49:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-12-23 01:49:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1205 transitions. [2020-12-23 01:49:38,922 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1205 transitions. Word has length 150 [2020-12-23 01:49:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:38,922 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 1205 transitions. [2020-12-23 01:49:38,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1205 transitions. [2020-12-23 01:49:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 01:49:38,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:38,924 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:49:38,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-12-23 01:49:38,925 INFO L429 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1685212200, now seen corresponding path program 1 times [2020-12-23 01:49:38,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:38,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703006568] [2020-12-23 01:49:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:39,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703006568] [2020-12-23 01:49:39,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:39,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:39,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100581732] [2020-12-23 01:49:39,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:39,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:39,017 INFO L87 Difference]: Start difference. First operand 810 states and 1205 transitions. Second operand 4 states. [2020-12-23 01:49:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:39,584 INFO L93 Difference]: Finished difference Result 1666 states and 2476 transitions. [2020-12-23 01:49:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:39,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-23 01:49:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:39,586 INFO L225 Difference]: With dead ends: 1666 [2020-12-23 01:49:39,586 INFO L226 Difference]: Without dead ends: 875 [2020-12-23 01:49:39,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-12-23 01:49:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 812. [2020-12-23 01:49:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-12-23 01:49:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1207 transitions. [2020-12-23 01:49:39,621 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1207 transitions. Word has length 150 [2020-12-23 01:49:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:39,621 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 1207 transitions. [2020-12-23 01:49:39,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1207 transitions. [2020-12-23 01:49:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 01:49:39,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:39,623 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:49:39,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-12-23 01:49:39,623 INFO L429 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2097408288, now seen corresponding path program 1 times [2020-12-23 01:49:39,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:39,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186888420] [2020-12-23 01:49:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:39,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186888420] [2020-12-23 01:49:39,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:39,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:39,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097247040] [2020-12-23 01:49:39,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:39,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:39,709 INFO L87 Difference]: Start difference. First operand 812 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:40,200 INFO L93 Difference]: Finished difference Result 1668 states and 2476 transitions. [2020-12-23 01:49:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:40,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2020-12-23 01:49:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:40,202 INFO L225 Difference]: With dead ends: 1668 [2020-12-23 01:49:40,202 INFO L226 Difference]: Without dead ends: 875 [2020-12-23 01:49:40,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-12-23 01:49:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 814. [2020-12-23 01:49:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-12-23 01:49:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1209 transitions. [2020-12-23 01:49:40,234 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1209 transitions. Word has length 151 [2020-12-23 01:49:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:40,234 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1209 transitions. [2020-12-23 01:49:40,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1209 transitions. [2020-12-23 01:49:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 01:49:40,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:40,236 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:49:40,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2020-12-23 01:49:40,236 INFO L429 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 790135168, now seen corresponding path program 1 times [2020-12-23 01:49:40,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:40,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787578168] [2020-12-23 01:49:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:40,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787578168] [2020-12-23 01:49:40,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:40,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:40,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637190839] [2020-12-23 01:49:40,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:40,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:40,326 INFO L87 Difference]: Start difference. First operand 814 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:40,840 INFO L93 Difference]: Finished difference Result 1664 states and 2469 transitions. [2020-12-23 01:49:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:40,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-12-23 01:49:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:40,842 INFO L225 Difference]: With dead ends: 1664 [2020-12-23 01:49:40,842 INFO L226 Difference]: Without dead ends: 869 [2020-12-23 01:49:40,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2020-12-23 01:49:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 816. [2020-12-23 01:49:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-12-23 01:49:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1211 transitions. [2020-12-23 01:49:40,870 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1211 transitions. Word has length 152 [2020-12-23 01:49:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:40,870 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1211 transitions. [2020-12-23 01:49:40,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1211 transitions. [2020-12-23 01:49:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 01:49:40,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:40,872 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:40,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2020-12-23 01:49:40,872 INFO L429 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1731796549, now seen corresponding path program 1 times [2020-12-23 01:49:40,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:40,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945006475] [2020-12-23 01:49:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:40,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945006475] [2020-12-23 01:49:40,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:40,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:40,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18482600] [2020-12-23 01:49:40,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:40,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:40,961 INFO L87 Difference]: Start difference. First operand 816 states and 1211 transitions. Second operand 4 states. [2020-12-23 01:49:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:41,475 INFO L93 Difference]: Finished difference Result 1690 states and 2499 transitions. [2020-12-23 01:49:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:41,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 01:49:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:41,477 INFO L225 Difference]: With dead ends: 1690 [2020-12-23 01:49:41,477 INFO L226 Difference]: Without dead ends: 893 [2020-12-23 01:49:41,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-12-23 01:49:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 816. [2020-12-23 01:49:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-12-23 01:49:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1209 transitions. [2020-12-23 01:49:41,514 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1209 transitions. Word has length 153 [2020-12-23 01:49:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:41,514 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1209 transitions. [2020-12-23 01:49:41,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1209 transitions. [2020-12-23 01:49:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 01:49:41,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:41,515 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:41,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-12-23 01:49:41,516 INFO L429 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash -771339623, now seen corresponding path program 1 times [2020-12-23 01:49:41,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:41,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724827626] [2020-12-23 01:49:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:41,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724827626] [2020-12-23 01:49:41,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:41,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:41,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524891271] [2020-12-23 01:49:41,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:41,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:41,613 INFO L87 Difference]: Start difference. First operand 816 states and 1209 transitions. Second operand 4 states. [2020-12-23 01:49:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:42,146 INFO L93 Difference]: Finished difference Result 1678 states and 2479 transitions. [2020-12-23 01:49:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:42,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-12-23 01:49:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:42,148 INFO L225 Difference]: With dead ends: 1678 [2020-12-23 01:49:42,148 INFO L226 Difference]: Without dead ends: 881 [2020-12-23 01:49:42,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-12-23 01:49:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 816. [2020-12-23 01:49:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-12-23 01:49:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1207 transitions. [2020-12-23 01:49:42,196 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1207 transitions. Word has length 154 [2020-12-23 01:49:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:42,196 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1207 transitions. [2020-12-23 01:49:42,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1207 transitions. [2020-12-23 01:49:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 01:49:42,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:42,199 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:42,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-12-23 01:49:42,199 INFO L429 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 400154711, now seen corresponding path program 1 times [2020-12-23 01:49:42,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:42,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784958795] [2020-12-23 01:49:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:42,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784958795] [2020-12-23 01:49:42,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:42,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:42,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415555194] [2020-12-23 01:49:42,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:42,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:42,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:42,288 INFO L87 Difference]: Start difference. First operand 816 states and 1207 transitions. Second operand 4 states. [2020-12-23 01:49:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:42,772 INFO L93 Difference]: Finished difference Result 1678 states and 2475 transitions. [2020-12-23 01:49:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:42,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-12-23 01:49:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:42,774 INFO L225 Difference]: With dead ends: 1678 [2020-12-23 01:49:42,774 INFO L226 Difference]: Without dead ends: 881 [2020-12-23 01:49:42,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-12-23 01:49:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 816. [2020-12-23 01:49:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-12-23 01:49:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1205 transitions. [2020-12-23 01:49:42,807 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1205 transitions. Word has length 154 [2020-12-23 01:49:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:42,807 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1205 transitions. [2020-12-23 01:49:42,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1205 transitions. [2020-12-23 01:49:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 01:49:42,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:42,809 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:42,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-12-23 01:49:42,809 INFO L429 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash -358452263, now seen corresponding path program 1 times [2020-12-23 01:49:42,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:42,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463685102] [2020-12-23 01:49:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:42,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463685102] [2020-12-23 01:49:42,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:42,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:42,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101823677] [2020-12-23 01:49:42,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:42,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:42,911 INFO L87 Difference]: Start difference. First operand 816 states and 1205 transitions. Second operand 4 states. [2020-12-23 01:49:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:43,407 INFO L93 Difference]: Finished difference Result 1672 states and 2464 transitions. [2020-12-23 01:49:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:43,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-12-23 01:49:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:43,410 INFO L225 Difference]: With dead ends: 1672 [2020-12-23 01:49:43,410 INFO L226 Difference]: Without dead ends: 875 [2020-12-23 01:49:43,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-12-23 01:49:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 816. [2020-12-23 01:49:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-12-23 01:49:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1203 transitions. [2020-12-23 01:49:43,453 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1203 transitions. Word has length 155 [2020-12-23 01:49:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:43,453 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1203 transitions. [2020-12-23 01:49:43,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1203 transitions. [2020-12-23 01:49:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 01:49:43,455 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:43,455 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] [2020-12-23 01:49:43,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-12-23 01:49:43,456 INFO L429 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 153336709, now seen corresponding path program 1 times [2020-12-23 01:49:43,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:43,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222032185] [2020-12-23 01:49:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:49:43,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222032185] [2020-12-23 01:49:43,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:43,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:43,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081067702] [2020-12-23 01:49:43,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:43,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:43,547 INFO L87 Difference]: Start difference. First operand 816 states and 1203 transitions. Second operand 4 states. [2020-12-23 01:49:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:44,088 INFO L93 Difference]: Finished difference Result 1746 states and 2588 transitions. [2020-12-23 01:49:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:44,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-12-23 01:49:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:44,090 INFO L225 Difference]: With dead ends: 1746 [2020-12-23 01:49:44,090 INFO L226 Difference]: Without dead ends: 949 [2020-12-23 01:49:44,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-12-23 01:49:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 876. [2020-12-23 01:49:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2020-12-23 01:49:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1309 transitions. [2020-12-23 01:49:44,135 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1309 transitions. Word has length 155 [2020-12-23 01:49:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:44,135 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1309 transitions. [2020-12-23 01:49:44,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1309 transitions. [2020-12-23 01:49:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 01:49:44,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:44,137 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:44,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2020-12-23 01:49:44,138 INFO L429 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1026497201, now seen corresponding path program 1 times [2020-12-23 01:49:44,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:44,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866398703] [2020-12-23 01:49:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:44,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866398703] [2020-12-23 01:49:44,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:44,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:44,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453151535] [2020-12-23 01:49:44,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:44,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:44,218 INFO L87 Difference]: Start difference. First operand 876 states and 1309 transitions. Second operand 4 states. [2020-12-23 01:49:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:44,702 INFO L93 Difference]: Finished difference Result 1792 states and 2672 transitions. [2020-12-23 01:49:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:44,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-12-23 01:49:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:44,705 INFO L225 Difference]: With dead ends: 1792 [2020-12-23 01:49:44,705 INFO L226 Difference]: Without dead ends: 935 [2020-12-23 01:49:44,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-12-23 01:49:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 876. [2020-12-23 01:49:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2020-12-23 01:49:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1307 transitions. [2020-12-23 01:49:44,756 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1307 transitions. Word has length 156 [2020-12-23 01:49:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:44,756 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1307 transitions. [2020-12-23 01:49:44,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1307 transitions. [2020-12-23 01:49:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 01:49:44,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:44,758 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:44,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2020-12-23 01:49:44,759 INFO L429 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -371359503, now seen corresponding path program 1 times [2020-12-23 01:49:44,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:44,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021049233] [2020-12-23 01:49:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:49:44,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021049233] [2020-12-23 01:49:44,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:44,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:44,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464399972] [2020-12-23 01:49:44,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:44,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:44,849 INFO L87 Difference]: Start difference. First operand 876 states and 1307 transitions. Second operand 4 states. [2020-12-23 01:49:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:45,396 INFO L93 Difference]: Finished difference Result 1786 states and 2661 transitions. [2020-12-23 01:49:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:45,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 01:49:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:45,400 INFO L225 Difference]: With dead ends: 1786 [2020-12-23 01:49:45,400 INFO L226 Difference]: Without dead ends: 929 [2020-12-23 01:49:45,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-12-23 01:49:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 800. [2020-12-23 01:49:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-12-23 01:49:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1195 transitions. [2020-12-23 01:49:45,442 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1195 transitions. Word has length 157 [2020-12-23 01:49:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:45,442 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1195 transitions. [2020-12-23 01:49:45,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1195 transitions. [2020-12-23 01:49:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 01:49:45,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:45,444 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2020-12-23 01:49:45,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2020-12-23 01:49:45,444 INFO L429 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -531929954, now seen corresponding path program 1 times [2020-12-23 01:49:45,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:45,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48806855] [2020-12-23 01:49:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:49:45,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48806855] [2020-12-23 01:49:45,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:45,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:45,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300078789] [2020-12-23 01:49:45,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:45,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:45,540 INFO L87 Difference]: Start difference. First operand 800 states and 1195 transitions. Second operand 4 states. [2020-12-23 01:49:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:46,079 INFO L93 Difference]: Finished difference Result 1710 states and 2547 transitions. [2020-12-23 01:49:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:46,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2020-12-23 01:49:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:46,082 INFO L225 Difference]: With dead ends: 1710 [2020-12-23 01:49:46,082 INFO L226 Difference]: Without dead ends: 929 [2020-12-23 01:49:46,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-12-23 01:49:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 860. [2020-12-23 01:49:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2020-12-23 01:49:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1285 transitions. [2020-12-23 01:49:46,120 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1285 transitions. Word has length 158 [2020-12-23 01:49:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:46,120 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 1285 transitions. [2020-12-23 01:49:46,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1285 transitions. [2020-12-23 01:49:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 01:49:46,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:46,121 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:46,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2020-12-23 01:49:46,121 INFO L429 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234899, now seen corresponding path program 1 times [2020-12-23 01:49:46,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:46,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784073503] [2020-12-23 01:49:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 01:49:46,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784073503] [2020-12-23 01:49:46,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:46,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:46,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662353117] [2020-12-23 01:49:46,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:46,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:46,188 INFO L87 Difference]: Start difference. First operand 860 states and 1285 transitions. Second operand 4 states. [2020-12-23 01:49:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:46,706 INFO L93 Difference]: Finished difference Result 1750 states and 2616 transitions. [2020-12-23 01:49:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:46,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2020-12-23 01:49:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:46,709 INFO L225 Difference]: With dead ends: 1750 [2020-12-23 01:49:46,709 INFO L226 Difference]: Without dead ends: 909 [2020-12-23 01:49:46,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2020-12-23 01:49:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 860. [2020-12-23 01:49:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2020-12-23 01:49:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1283 transitions. [2020-12-23 01:49:46,756 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1283 transitions. Word has length 158 [2020-12-23 01:49:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:46,756 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 1283 transitions. [2020-12-23 01:49:46,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1283 transitions. [2020-12-23 01:49:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:49:46,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:46,758 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2020-12-23 01:49:46,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2020-12-23 01:49:46,758 INFO L429 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:46,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1936249539, now seen corresponding path program 1 times [2020-12-23 01:49:46,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:46,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68830767] [2020-12-23 01:49:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:49:46,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68830767] [2020-12-23 01:49:46,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:46,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:46,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269344636] [2020-12-23 01:49:46,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:46,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:46,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:46,839 INFO L87 Difference]: Start difference. First operand 860 states and 1283 transitions. Second operand 4 states. [2020-12-23 01:49:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:47,325 INFO L93 Difference]: Finished difference Result 1766 states and 2627 transitions. [2020-12-23 01:49:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:47,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-23 01:49:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:47,327 INFO L225 Difference]: With dead ends: 1766 [2020-12-23 01:49:47,327 INFO L226 Difference]: Without dead ends: 925 [2020-12-23 01:49:47,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2020-12-23 01:49:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 862. [2020-12-23 01:49:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2020-12-23 01:49:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1285 transitions. [2020-12-23 01:49:47,359 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1285 transitions. Word has length 159 [2020-12-23 01:49:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:47,359 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 1285 transitions. [2020-12-23 01:49:47,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1285 transitions. [2020-12-23 01:49:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:49:47,361 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:47,361 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:47,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2020-12-23 01:49:47,361 INFO L429 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash 814431091, now seen corresponding path program 1 times [2020-12-23 01:49:47,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:47,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000279403] [2020-12-23 01:49:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:47,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000279403] [2020-12-23 01:49:47,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:47,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:47,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104884686] [2020-12-23 01:49:47,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:47,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:47,433 INFO L87 Difference]: Start difference. First operand 862 states and 1285 transitions. Second operand 4 states. [2020-12-23 01:49:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:47,928 INFO L93 Difference]: Finished difference Result 1768 states and 2627 transitions. [2020-12-23 01:49:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:47,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-23 01:49:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:47,930 INFO L225 Difference]: With dead ends: 1768 [2020-12-23 01:49:47,930 INFO L226 Difference]: Without dead ends: 925 [2020-12-23 01:49:47,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2020-12-23 01:49:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 886. [2020-12-23 01:49:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-12-23 01:49:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1313 transitions. [2020-12-23 01:49:47,980 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1313 transitions. Word has length 159 [2020-12-23 01:49:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:47,981 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1313 transitions. [2020-12-23 01:49:47,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1313 transitions. [2020-12-23 01:49:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:49:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:47,982 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:47,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2020-12-23 01:49:47,982 INFO L429 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 417452622, now seen corresponding path program 1 times [2020-12-23 01:49:47,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:47,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294969641] [2020-12-23 01:49:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 01:49:48,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294969641] [2020-12-23 01:49:48,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:48,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:48,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082627485] [2020-12-23 01:49:48,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:48,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:48,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:48,062 INFO L87 Difference]: Start difference. First operand 886 states and 1313 transitions. Second operand 4 states. [2020-12-23 01:49:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:48,524 INFO L93 Difference]: Finished difference Result 1798 states and 2668 transitions. [2020-12-23 01:49:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:48,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-23 01:49:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:48,526 INFO L225 Difference]: With dead ends: 1798 [2020-12-23 01:49:48,526 INFO L226 Difference]: Without dead ends: 931 [2020-12-23 01:49:48,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2020-12-23 01:49:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 886. [2020-12-23 01:49:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-12-23 01:49:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1311 transitions. [2020-12-23 01:49:48,560 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1311 transitions. Word has length 159 [2020-12-23 01:49:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:48,560 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1311 transitions. [2020-12-23 01:49:48,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1311 transitions. [2020-12-23 01:49:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 01:49:48,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:48,562 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:48,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2020-12-23 01:49:48,562 INFO L429 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1528412147, now seen corresponding path program 1 times [2020-12-23 01:49:48,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:48,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870681226] [2020-12-23 01:49:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:49:48,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870681226] [2020-12-23 01:49:48,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:48,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:48,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662513047] [2020-12-23 01:49:48,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:48,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:48,651 INFO L87 Difference]: Start difference. First operand 886 states and 1311 transitions. Second operand 4 states. [2020-12-23 01:49:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:49,131 INFO L93 Difference]: Finished difference Result 1786 states and 2642 transitions. [2020-12-23 01:49:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:49,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2020-12-23 01:49:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:49,133 INFO L225 Difference]: With dead ends: 1786 [2020-12-23 01:49:49,133 INFO L226 Difference]: Without dead ends: 915 [2020-12-23 01:49:49,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2020-12-23 01:49:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 884. [2020-12-23 01:49:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2020-12-23 01:49:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1307 transitions. [2020-12-23 01:49:49,182 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1307 transitions. Word has length 160 [2020-12-23 01:49:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:49,182 INFO L481 AbstractCegarLoop]: Abstraction has 884 states and 1307 transitions. [2020-12-23 01:49:49,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1307 transitions. [2020-12-23 01:49:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 01:49:49,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:49,184 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] [2020-12-23 01:49:49,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2020-12-23 01:49:49,184 INFO L429 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash -565142878, now seen corresponding path program 1 times [2020-12-23 01:49:49,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:49,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733543922] [2020-12-23 01:49:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:49:49,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733543922] [2020-12-23 01:49:49,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:49,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:49:49,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180002822] [2020-12-23 01:49:49,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:49:49,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:49:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:49,385 INFO L87 Difference]: Start difference. First operand 884 states and 1307 transitions. Second operand 5 states. [2020-12-23 01:49:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:50,214 INFO L93 Difference]: Finished difference Result 1906 states and 2832 transitions. [2020-12-23 01:49:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:49:50,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2020-12-23 01:49:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:50,216 INFO L225 Difference]: With dead ends: 1906 [2020-12-23 01:49:50,216 INFO L226 Difference]: Without dead ends: 1041 [2020-12-23 01:49:50,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:49:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2020-12-23 01:49:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 950. [2020-12-23 01:49:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-12-23 01:49:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1425 transitions. [2020-12-23 01:49:50,256 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1425 transitions. Word has length 161 [2020-12-23 01:49:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:50,256 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1425 transitions. [2020-12-23 01:49:50,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:49:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1425 transitions. [2020-12-23 01:49:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-12-23 01:49:50,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:50,257 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:49:50,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2020-12-23 01:49:50,257 INFO L429 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 649415503, now seen corresponding path program 1 times [2020-12-23 01:49:50,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:50,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143911697] [2020-12-23 01:49:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:50,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143911697] [2020-12-23 01:49:50,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:50,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:50,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408876514] [2020-12-23 01:49:50,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:50,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:50,370 INFO L87 Difference]: Start difference. First operand 950 states and 1425 transitions. Second operand 4 states. [2020-12-23 01:49:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:50,881 INFO L93 Difference]: Finished difference Result 1930 states and 2893 transitions. [2020-12-23 01:49:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:50,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2020-12-23 01:49:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:50,883 INFO L225 Difference]: With dead ends: 1930 [2020-12-23 01:49:50,883 INFO L226 Difference]: Without dead ends: 999 [2020-12-23 01:49:50,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2020-12-23 01:49:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 950. [2020-12-23 01:49:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-12-23 01:49:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1423 transitions. [2020-12-23 01:49:50,950 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1423 transitions. Word has length 163 [2020-12-23 01:49:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:50,951 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1423 transitions. [2020-12-23 01:49:50,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1423 transitions. [2020-12-23 01:49:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:49:50,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:50,952 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:49:50,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2020-12-23 01:49:50,953 INFO L429 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -96746958, now seen corresponding path program 1 times [2020-12-23 01:49:50,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:50,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947741032] [2020-12-23 01:49:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:49:51,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947741032] [2020-12-23 01:49:51,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:49:51,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:49:51,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267878749] [2020-12-23 01:49:51,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:49:51,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:49:51,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:49:51,087 INFO L87 Difference]: Start difference. First operand 950 states and 1423 transitions. Second operand 4 states. [2020-12-23 01:49:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:49:51,666 INFO L93 Difference]: Finished difference Result 1926 states and 2885 transitions. [2020-12-23 01:49:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:49:51,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2020-12-23 01:49:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:49:51,668 INFO L225 Difference]: With dead ends: 1926 [2020-12-23 01:49:51,668 INFO L226 Difference]: Without dead ends: 995 [2020-12-23 01:49:51,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:49:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-12-23 01:49:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 950. [2020-12-23 01:49:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-12-23 01:49:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1421 transitions. [2020-12-23 01:49:51,706 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1421 transitions. Word has length 164 [2020-12-23 01:49:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:49:51,707 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1421 transitions. [2020-12-23 01:49:51,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:49:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1421 transitions. [2020-12-23 01:49:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:49:51,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:49:51,708 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:49:51,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2020-12-23 01:49:51,708 INFO L429 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:49:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:49:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1218565406, now seen corresponding path program 1 times [2020-12-23 01:49:51,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:49:51,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663329808] [2020-12-23 01:49:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:49:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:52,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663329808] [2020-12-23 01:49:52,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235170268] [2020-12-23 01:49:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:49:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:49:52,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 01:49:52,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:49:52,977 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:52,978 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2020-12-23 01:49:52,989 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,109 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-23 01:49:53,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,117 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2020-12-23 01:49:53,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,173 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2020-12-23 01:49:53,175 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:49:53,262 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,344 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:49:53,345 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:49:53,348 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,366 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,367 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2020-12-23 01:49:53,436 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:49:53,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:49:53,439 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:49:53,524 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:49:53,525 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:49:53,528 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,539 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:49:53,553 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2020-12-23 01:49:53,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,564 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2020-12-23 01:49:53,565 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,621 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:53,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,675 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2020-12-23 01:49:53,677 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,699 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,699 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2020-12-23 01:49:53,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:53,781 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 01:49:53,783 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,797 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2020-12-23 01:49:53,889 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:49:53,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:49:53,893 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,905 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,905 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:49:53,957 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:49:53,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:49:53,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:53,972 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:53,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:49:54,051 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2020-12-23 01:49:54,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:54,057 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2020-12-23 01:49:54,059 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:54,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:54,323 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-12-23 01:49:54,324 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2020-12-23 01:49:54,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2020-12-23 01:49:54,340 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:54,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 01:49:54,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:49:54,351 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:49:54,353 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:54,355 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:54,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2020-12-23 01:49:54,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 01:49:54,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:49:54,367 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:49:54,368 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:54,370 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:54,378 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:54,410 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2020-12-23 01:49:54,412 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:54,413 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2020-12-23 01:49:54,489 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2020-12-23 01:49:54,494 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:54,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:54,792 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2020-12-23 01:49:54,793 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2020-12-23 01:49:54,794 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2020-12-23 01:49:54,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2020-12-23 01:49:54,801 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:54,805 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:54,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:54,823 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:54,824 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2020-12-23 01:49:55,034 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2020-12-23 01:49:55,040 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 01:49:55,041 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:55,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,290 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-12-23 01:49:55,291 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2020-12-23 01:49:55,291 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2020-12-23 01:49:55,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 01:49:55,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 01:49:55,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 01:49:55,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:49:55,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:49:55,301 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:49:55,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:49:55,302 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:55,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:49:55,304 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:49:55,304 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:49:55,305 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,314 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:55,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,332 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:55,332 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2020-12-23 01:49:55,404 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_180|], 20=[|v_#memory_$Pointer$.base_171|]} [2020-12-23 01:49:55,409 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2020-12-23 01:49:55,411 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:55,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2020-12-23 01:49:55,441 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:55,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:49:55,569 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,570 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2020-12-23 01:49:55,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:49:55,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:49:55,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:49:55,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:55,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:49:55,582 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:49:55,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:49:55,584 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,589 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,590 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,591 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,593 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,594 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,595 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,598 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:55,602 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,604 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:49:55,607 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:49:55,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:49:55,610 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,611 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,613 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,615 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,618 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,619 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:49:55,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,624 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,626 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:55,627 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,629 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,631 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,634 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:49:55,635 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:49:55,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:49:55,639 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,640 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,641 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,642 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,643 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,647 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,648 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,649 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,652 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,653 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:49:55,657 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,657 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,661 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,663 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,664 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,664 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,668 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,671 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,674 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,675 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,676 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,680 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,682 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,683 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,686 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:49:55,688 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,691 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-23 01:49:55,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:49:55,693 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,695 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:49:55,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:49:55,699 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,701 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-23 01:49:55,702 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:49:55,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:49:55,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:49:55,708 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:49:55,712 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:55,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:55,723 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2020-12-23 01:49:55,782 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 01:49:55,782 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 01:49:55,784 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:55,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:55,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:49:55,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-12-23 01:49:56,061 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:49:56,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 01:49:56,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:49:56,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:49:56,071 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:49:56,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2020-12-23 01:49:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 130 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:49:56,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:49:56,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-12-23 01:49:56,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67532548] [2020-12-23 01:49:56,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 01:49:56,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:49:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 01:49:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-12-23 01:49:56,421 INFO L87 Difference]: Start difference. First operand 950 states and 1421 transitions. Second operand 17 states. [2020-12-23 01:50:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:05,065 INFO L93 Difference]: Finished difference Result 3594 states and 5338 transitions. [2020-12-23 01:50:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 01:50:05,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 164 [2020-12-23 01:50:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:05,083 INFO L225 Difference]: With dead ends: 3594 [2020-12-23 01:50:05,083 INFO L226 Difference]: Without dead ends: 2663 [2020-12-23 01:50:05,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2020-12-23 01:50:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2020-12-23 01:50:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 1771. [2020-12-23 01:50:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2020-12-23 01:50:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2649 transitions. [2020-12-23 01:50:05,246 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2649 transitions. Word has length 164 [2020-12-23 01:50:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:05,247 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 2649 transitions. [2020-12-23 01:50:05,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 01:50:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2649 transitions. [2020-12-23 01:50:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 01:50:05,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:05,251 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] [2020-12-23 01:50:05,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2020-12-23 01:50:05,467 INFO L429 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -441914768, now seen corresponding path program 1 times [2020-12-23 01:50:05,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:05,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350984865] [2020-12-23 01:50:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:05,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350984865] [2020-12-23 01:50:05,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:05,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:50:05,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437747860] [2020-12-23 01:50:05,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:50:05,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:50:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:50:05,583 INFO L87 Difference]: Start difference. First operand 1771 states and 2649 transitions. Second operand 4 states. [2020-12-23 01:50:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:06,380 INFO L93 Difference]: Finished difference Result 2828 states and 4216 transitions. [2020-12-23 01:50:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:06,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-12-23 01:50:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:06,385 INFO L225 Difference]: With dead ends: 2828 [2020-12-23 01:50:06,385 INFO L226 Difference]: Without dead ends: 1897 [2020-12-23 01:50:06,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2020-12-23 01:50:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1771. [2020-12-23 01:50:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2020-12-23 01:50:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2645 transitions. [2020-12-23 01:50:06,530 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2645 transitions. Word has length 170 [2020-12-23 01:50:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:06,530 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 2645 transitions. [2020-12-23 01:50:06,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:50:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2645 transitions. [2020-12-23 01:50:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 01:50:06,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:06,533 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] [2020-12-23 01:50:06,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2020-12-23 01:50:06,533 INFO L429 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash -401389033, now seen corresponding path program 1 times [2020-12-23 01:50:06,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:06,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721689561] [2020-12-23 01:50:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:06,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721689561] [2020-12-23 01:50:06,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:06,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:50:06,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447374274] [2020-12-23 01:50:06,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:50:06,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:06,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:50:06,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:50:06,685 INFO L87 Difference]: Start difference. First operand 1771 states and 2645 transitions. Second operand 4 states. [2020-12-23 01:50:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:07,461 INFO L93 Difference]: Finished difference Result 2828 states and 4210 transitions. [2020-12-23 01:50:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:07,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 01:50:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:07,466 INFO L225 Difference]: With dead ends: 2828 [2020-12-23 01:50:07,466 INFO L226 Difference]: Without dead ends: 1897 [2020-12-23 01:50:07,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2020-12-23 01:50:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1771. [2020-12-23 01:50:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2020-12-23 01:50:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2641 transitions. [2020-12-23 01:50:07,598 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2641 transitions. Word has length 171 [2020-12-23 01:50:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:07,598 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 2641 transitions. [2020-12-23 01:50:07,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:50:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2641 transitions. [2020-12-23 01:50:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-23 01:50:07,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:07,601 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] [2020-12-23 01:50:07,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2020-12-23 01:50:07,601 INFO L429 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash -766860437, now seen corresponding path program 1 times [2020-12-23 01:50:07,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:07,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207369848] [2020-12-23 01:50:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:07,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207369848] [2020-12-23 01:50:07,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:07,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:50:07,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021248909] [2020-12-23 01:50:07,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:50:07,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:50:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:50:07,698 INFO L87 Difference]: Start difference. First operand 1771 states and 2641 transitions. Second operand 4 states. [2020-12-23 01:50:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:08,409 INFO L93 Difference]: Finished difference Result 2828 states and 4204 transitions. [2020-12-23 01:50:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:08,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2020-12-23 01:50:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:08,413 INFO L225 Difference]: With dead ends: 2828 [2020-12-23 01:50:08,413 INFO L226 Difference]: Without dead ends: 1897 [2020-12-23 01:50:08,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2020-12-23 01:50:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1771. [2020-12-23 01:50:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2020-12-23 01:50:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2637 transitions. [2020-12-23 01:50:08,551 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2637 transitions. Word has length 172 [2020-12-23 01:50:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:08,551 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 2637 transitions. [2020-12-23 01:50:08,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:50:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2637 transitions. [2020-12-23 01:50:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:50:08,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:08,553 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] [2020-12-23 01:50:08,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2020-12-23 01:50:08,554 INFO L429 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash -833341262, now seen corresponding path program 1 times [2020-12-23 01:50:08,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:08,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884307191] [2020-12-23 01:50:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:08,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884307191] [2020-12-23 01:50:08,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:08,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:50:08,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753759646] [2020-12-23 01:50:08,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:50:08,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:50:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:50:08,675 INFO L87 Difference]: Start difference. First operand 1771 states and 2637 transitions. Second operand 4 states. [2020-12-23 01:50:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:09,329 INFO L93 Difference]: Finished difference Result 2808 states and 4174 transitions. [2020-12-23 01:50:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:09,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2020-12-23 01:50:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:09,333 INFO L225 Difference]: With dead ends: 2808 [2020-12-23 01:50:09,334 INFO L226 Difference]: Without dead ends: 1877 [2020-12-23 01:50:09,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2020-12-23 01:50:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1771. [2020-12-23 01:50:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2020-12-23 01:50:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2633 transitions. [2020-12-23 01:50:09,474 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2633 transitions. Word has length 173 [2020-12-23 01:50:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:09,474 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 2633 transitions. [2020-12-23 01:50:09,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:50:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2633 transitions. [2020-12-23 01:50:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 01:50:09,476 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:09,476 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] [2020-12-23 01:50:09,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2020-12-23 01:50:09,477 INFO L429 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash 818433459, now seen corresponding path program 1 times [2020-12-23 01:50:09,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:09,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440242600] [2020-12-23 01:50:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2020-12-23 01:50:09,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440242600] [2020-12-23 01:50:09,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:09,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:50:09,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579656298] [2020-12-23 01:50:09,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:50:09,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:09,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:50:09,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:09,622 INFO L87 Difference]: Start difference. First operand 1771 states and 2633 transitions. Second operand 5 states. [2020-12-23 01:50:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:10,516 INFO L93 Difference]: Finished difference Result 4037 states and 6051 transitions. [2020-12-23 01:50:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:10,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2020-12-23 01:50:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:10,520 INFO L225 Difference]: With dead ends: 4037 [2020-12-23 01:50:10,521 INFO L226 Difference]: Without dead ends: 2285 [2020-12-23 01:50:10,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:50:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2020-12-23 01:50:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1929. [2020-12-23 01:50:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2020-12-23 01:50:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2919 transitions. [2020-12-23 01:50:10,700 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2919 transitions. Word has length 176 [2020-12-23 01:50:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:10,701 INFO L481 AbstractCegarLoop]: Abstraction has 1929 states and 2919 transitions. [2020-12-23 01:50:10,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:50:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2919 transitions. [2020-12-23 01:50:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-23 01:50:10,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:10,703 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] [2020-12-23 01:50:10,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2020-12-23 01:50:10,704 INFO L429 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -406150069, now seen corresponding path program 1 times [2020-12-23 01:50:10,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:10,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510371298] [2020-12-23 01:50:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2020-12-23 01:50:10,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510371298] [2020-12-23 01:50:10,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:10,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:50:10,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583620228] [2020-12-23 01:50:10,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:50:10,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:10,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:50:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:10,866 INFO L87 Difference]: Start difference. First operand 1929 states and 2919 transitions. Second operand 5 states. [2020-12-23 01:50:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:11,908 INFO L93 Difference]: Finished difference Result 4241 states and 6441 transitions. [2020-12-23 01:50:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:50:11,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2020-12-23 01:50:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:11,912 INFO L225 Difference]: With dead ends: 4241 [2020-12-23 01:50:11,912 INFO L226 Difference]: Without dead ends: 2331 [2020-12-23 01:50:11,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:50:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2020-12-23 01:50:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2037. [2020-12-23 01:50:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2020-12-23 01:50:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3139 transitions. [2020-12-23 01:50:12,016 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3139 transitions. Word has length 177 [2020-12-23 01:50:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:12,017 INFO L481 AbstractCegarLoop]: Abstraction has 2037 states and 3139 transitions. [2020-12-23 01:50:12,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:50:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3139 transitions. [2020-12-23 01:50:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-23 01:50:12,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:12,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:50:12,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-12-23 01:50:12,019 INFO L429 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1660399470, now seen corresponding path program 1 times [2020-12-23 01:50:12,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:12,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740731051] [2020-12-23 01:50:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-12-23 01:50:12,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740731051] [2020-12-23 01:50:12,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:50:12,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:50:12,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032407651] [2020-12-23 01:50:12,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:50:12,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:50:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:50:12,342 INFO L87 Difference]: Start difference. First operand 2037 states and 3139 transitions. Second operand 5 states. [2020-12-23 01:50:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:13,893 INFO L93 Difference]: Finished difference Result 5869 states and 9052 transitions. [2020-12-23 01:50:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:50:13,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2020-12-23 01:50:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:13,901 INFO L225 Difference]: With dead ends: 5869 [2020-12-23 01:50:13,901 INFO L226 Difference]: Without dead ends: 3851 [2020-12-23 01:50:13,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:50:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2020-12-23 01:50:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 2846. [2020-12-23 01:50:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2020-12-23 01:50:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4434 transitions. [2020-12-23 01:50:14,127 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4434 transitions. Word has length 190 [2020-12-23 01:50:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:14,127 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 4434 transitions. [2020-12-23 01:50:14,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:50:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4434 transitions. [2020-12-23 01:50:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-23 01:50:14,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:14,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:50:14,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2020-12-23 01:50:14,131 INFO L429 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 601173780, now seen corresponding path program 1 times [2020-12-23 01:50:14,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:14,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535405248] [2020-12-23 01:50:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:14,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535405248] [2020-12-23 01:50:14,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892334824] [2020-12-23 01:50:14,513 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 [2020-12-23 01:50:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:50:14,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-23 01:50:14,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:50:14,950 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 [2020-12-23 01:50:14,953 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,013 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_179|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2020-12-23 01:50:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,047 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 [2020-12-23 01:50:15,048 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,113 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:50:15,117 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,187 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:50:15,188 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 6 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:50:15,190 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,206 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:10 [2020-12-23 01:50:15,224 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:50:15,224 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 [2020-12-23 01:50:15,225 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:50:15,267 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:50:15,268 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 [2020-12-23 01:50:15,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,274 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:50:15,286 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:15,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,334 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2020-12-23 01:50:15,334 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 2 case distinctions, treesize of input 35 treesize of output 23 [2020-12-23 01:50:15,336 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,345 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,345 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:50:15,392 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:50:15,392 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 [2020-12-23 01:50:15,394 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,398 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:50:15,420 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:50:15,420 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 [2020-12-23 01:50:15,422 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,426 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:50:15,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,465 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 [2020-12-23 01:50:15,467 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,492 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:50:15,492 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 [2020-12-23 01:50:15,494 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,498 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,498 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:50:15,533 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 2=[|v_#memory_$Pointer$.base_186|]} [2020-12-23 01:50:15,537 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 49 treesize of output 37 [2020-12-23 01:50:15,539 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:15,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,574 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,575 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2020-12-23 01:50:15,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2020-12-23 01:50:15,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:50:15,579 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,583 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2020-12-23 01:50:15,596 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:15,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,640 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2020-12-23 01:50:15,640 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 2 case distinctions, treesize of input 35 treesize of output 23 [2020-12-23 01:50:15,642 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,654 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,654 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:50:15,690 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 2=[|v_#memory_$Pointer$.base_188|]} [2020-12-23 01:50:15,694 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 49 treesize of output 37 [2020-12-23 01:50:15,695 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:15,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,734 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,735 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2020-12-23 01:50:15,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2020-12-23 01:50:15,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:50:15,739 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,742 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,743 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2020-12-23 01:50:15,754 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_189|, |v_#memory_$Pointer$.base_177|], 6=[|v_#memory_$Pointer$.base_178|]} [2020-12-23 01:50:15,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,777 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2020-12-23 01:50:15,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,867 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:15,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,941 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 146 treesize of output 80 [2020-12-23 01:50:15,943 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:15,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:15,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:15,999 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 [2020-12-23 01:50:16,000 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,036 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:16,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:50:16,134 INFO L348 Elim1Store]: treesize reduction 68, result has 47.3 percent of original size [2020-12-23 01:50:16,134 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 2 case distinctions, treesize of input 128 treesize of output 98 [2020-12-23 01:50:16,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 1] term [2020-12-23 01:50:16,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 01:50:16,139 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,160 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,161 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:275, output treesize:50 [2020-12-23 01:50:16,241 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_190|, |v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_int_183|]} [2020-12-23 01:50:16,245 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 63 treesize of output 45 [2020-12-23 01:50:16,248 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:16,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 [2020-12-23 01:50:16,273 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:16,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,311 INFO L348 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2020-12-23 01:50:16,311 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 2 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:50:16,315 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:50:16,329 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:38 [2020-12-23 01:50:16,548 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:50:16,548 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 [2020-12-23 01:50:16,550 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:50:16,557 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:50:16,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2020-12-23 01:50:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:50:16,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:50:16,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-23 01:50:16,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339605622] [2020-12-23 01:50:16,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:50:16,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:50:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:50:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:50:16,762 INFO L87 Difference]: Start difference. First operand 2846 states and 4434 transitions. Second operand 9 states. [2020-12-23 01:50:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:50:20,423 INFO L93 Difference]: Finished difference Result 7119 states and 10977 transitions. [2020-12-23 01:50:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:50:20,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2020-12-23 01:50:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:50:20,431 INFO L225 Difference]: With dead ends: 7119 [2020-12-23 01:50:20,431 INFO L226 Difference]: Without dead ends: 4292 [2020-12-23 01:50:20,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:50:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2020-12-23 01:50:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 3158. [2020-12-23 01:50:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3158 states. [2020-12-23 01:50:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 4986 transitions. [2020-12-23 01:50:20,598 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 4986 transitions. Word has length 190 [2020-12-23 01:50:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:50:20,598 INFO L481 AbstractCegarLoop]: Abstraction has 3158 states and 4986 transitions. [2020-12-23 01:50:20,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:50:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 4986 transitions. [2020-12-23 01:50:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:50:20,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:50:20,627 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:50:20,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2020-12-23 01:50:20,828 INFO L429 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:50:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:50:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885074, now seen corresponding path program 1 times [2020-12-23 01:50:20,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:50:20,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499269059] [2020-12-23 01:50:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:50:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:50:20,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:50:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:50:21,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:50:21,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:50:21,165 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:50:21,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2020-12-23 01:50:21,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:50:21 BoogieIcfgContainer [2020-12-23 01:50:21,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:50:21,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:50:21,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:50:21,419 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:50:21,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:48:41" (3/4) ... [2020-12-23 01:50:21,427 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:50:21,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:50:21,429 INFO L168 Benchmark]: Toolchain (without parser) took 102510.76 ms. Allocated memory was 157.3 MB in the beginning and 701.5 MB in the end (delta: 544.2 MB). Free memory was 130.2 MB in the beginning and 566.1 MB in the end (delta: -435.9 MB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,429 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:50:21,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.75 ms. Allocated memory is still 157.3 MB. Free memory was 130.1 MB in the beginning and 129.3 MB in the end (delta: 808.4 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.86 ms. Allocated memory is still 157.3 MB. Free memory was 129.3 MB in the beginning and 124.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,431 INFO L168 Benchmark]: Boogie Preprocessor took 101.76 ms. Allocated memory is still 157.3 MB. Free memory was 124.6 MB in the beginning and 117.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,431 INFO L168 Benchmark]: RCFGBuilder took 1711.26 ms. Allocated memory is still 157.3 MB. Free memory was 117.7 MB in the beginning and 110.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,433 INFO L168 Benchmark]: TraceAbstraction took 99671.42 ms. Allocated memory was 157.3 MB in the beginning and 701.5 MB in the end (delta: 544.2 MB). Free memory was 110.0 MB in the beginning and 566.6 MB in the end (delta: -456.6 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,433 INFO L168 Benchmark]: Witness Printer took 9.06 ms. Allocated memory is still 701.5 MB. Free memory was 566.6 MB in the beginning and 566.1 MB in the end (delta: 526.3 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:50:21,438 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 858.75 ms. Allocated memory is still 157.3 MB. Free memory was 130.1 MB in the beginning and 129.3 MB in the end (delta: 808.4 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 147.86 ms. Allocated memory is still 157.3 MB. Free memory was 129.3 MB in the beginning and 124.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 101.76 ms. Allocated memory is still 157.3 MB. Free memory was 124.6 MB in the beginning and 117.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1711.26 ms. Allocated memory is still 157.3 MB. Free memory was 117.7 MB in the beginning and 110.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 99671.42 ms. Allocated memory was 157.3 MB in the beginning and 701.5 MB in the end (delta: 544.2 MB). Free memory was 110.0 MB in the beginning and 566.6 MB in the end (delta: -456.6 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. * Witness Printer took 9.06 ms. Allocated memory is still 701.5 MB. Free memory was 566.6 MB in the beginning and 566.1 MB in the end (delta: 526.3 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1740]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1699] EXPR s->s3 [L1699] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1699] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1728] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1699] EXPR s->s3 [L1699] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1699] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1728] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1592] EXPR s->session [L1592] EXPR s->s3 [L1592] EXPR (s->s3)->tmp.new_cipher [L1592] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1593] COND FALSE !(! tmp___9) [L1599] ret = __VERIFIER_nondet_int() [L1600] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1605] COND FALSE !(ret <= 0) [L1610] s->state = 8672 [L1611] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1612] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1699] EXPR s->s3 [L1699] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1699] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1728] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1621] ret = __VERIFIER_nondet_int() [L1622] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1627] COND FALSE !(ret <= 0) [L1632] s->state = 8448 [L1633] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1633] COND TRUE s->hit [L1634] EXPR s->s3 [L1634] (s->s3)->tmp.next_state = 8640 [L1638] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1699] EXPR s->s3 [L1699] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1699] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1728] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1699] EXPR s->s3 [L1699] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1699] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1728] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND TRUE s->state == 8640 [L1572] ret = __VERIFIER_nondet_int() [L1573] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1740] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 99.3s, OverallIterations: 120, TraceHistogramMax: 7, AutomataDifference: 75.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26544 SDtfs, 9614 SDslu, 42933 SDs, 0 SdLazy, 29248 SolverSat, 1422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1047 GetRequests, 605 SyntacticMatches, 45 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3158occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 119 MinimizatonAttempts, 10475 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 14906 NumberOfCodeBlocks, 14906 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 14592 ConstructedInterpolants, 113 QuantifiedInterpolants, 7663492 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1342 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 121 InterpolantComputations, 117 PerfectInterpolantSequences, 16049/16680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...