/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:41:33,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:41:33,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:41:33,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:41:33,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:41:33,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:41:33,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:41:33,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:41:33,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:41:33,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:41:33,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:41:33,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:41:33,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:41:33,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:41:33,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:41:33,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:41:33,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:41:33,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:41:33,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:41:33,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:41:33,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:41:33,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:41:33,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:41:33,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:41:33,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:41:33,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:41:33,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:41:33,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:41:33,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:41:33,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:41:33,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:41:33,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:41:33,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:41:33,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:41:33,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:41:33,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:41:33,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:41:33,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:41:33,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:41:33,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:41:33,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:41:33,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:41:33,238 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:41:33,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:41:33,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:41:33,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:41:33,244 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:41:33,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:41:33,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:41:33,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:41:33,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:41:33,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:41:33,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:41:33,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:41:33,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:41:33,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:41:33,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:41:33,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:41:33,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:41:33,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:41:33,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:41:33,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:41:33,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:41:33,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:41:33,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:41:33,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:41:33,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:41:33,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:41:33,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:41:33,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:41:33,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:41:33,775 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:41:33,776 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:41:33,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2021-01-06 11:41:33,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0c3407e5d/21be8fc6f61449d49a4d1e0283d4a843/FLAG76a0d11dc [2021-01-06 11:41:34,814 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:41:34,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2021-01-06 11:41:34,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0c3407e5d/21be8fc6f61449d49a4d1e0283d4a843/FLAG76a0d11dc [2021-01-06 11:41:34,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0c3407e5d/21be8fc6f61449d49a4d1e0283d4a843 [2021-01-06 11:41:34,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:41:34,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:41:34,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:41:34,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:41:34,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:41:34,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:41:34" (1/1) ... [2021-01-06 11:41:34,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9716742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:34, skipping insertion in model container [2021-01-06 11:41:34,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:41:34" (1/1) ... [2021-01-06 11:41:34,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:41:35,085 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:41:35,691 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:41:35,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:41:35,729 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:41:35,969 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:41:35,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:41:36,029 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:41:36,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36 WrapperNode [2021-01-06 11:41:36,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:41:36,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:41:36,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:41:36,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:41:36,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:41:36,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:41:36,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:41:36,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:41:36,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... [2021-01-06 11:41:36,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:41:36,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:41:36,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:41:36,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:41:36,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:41:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:41:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:41:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:41:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:41:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:41:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:41:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:41:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:41:36,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:41:36,672 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:41:37,880 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:41:37,881 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:41:37,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:41:37,892 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:41:37,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:37 BoogieIcfgContainer [2021-01-06 11:41:37,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:41:37,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:41:37,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:41:37,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:41:37,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:41:34" (1/3) ... [2021-01-06 11:41:37,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56af3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:37, skipping insertion in model container [2021-01-06 11:41:37,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:36" (2/3) ... [2021-01-06 11:41:37,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56af3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:37, skipping insertion in model container [2021-01-06 11:41:37,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:37" (3/3) ... [2021-01-06 11:41:37,905 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2021-01-06 11:41:37,913 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:41:37,919 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:41:37,939 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:41:37,967 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:41:37,968 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:41:37,968 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:41:37,968 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:41:37,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:41:37,968 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:41:37,969 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:41:37,969 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:41:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 11:41:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:41:38,000 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:38,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:38,001 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2021-01-06 11:41:38,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:38,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558414554] [2021-01-06 11:41:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:38,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558414554] [2021-01-06 11:41:38,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:38,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:38,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566227805] [2021-01-06 11:41:38,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:38,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:38,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:38,515 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2021-01-06 11:41:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:39,050 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2021-01-06 11:41:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:39,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:41:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:39,065 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:41:39,066 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:41:39,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:41:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:41:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2021-01-06 11:41:39,126 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2021-01-06 11:41:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:39,127 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2021-01-06 11:41:39,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2021-01-06 11:41:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:41:39,130 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:39,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:39,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:41:39,131 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2021-01-06 11:41:39,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:39,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516343036] [2021-01-06 11:41:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:39,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516343036] [2021-01-06 11:41:39,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:39,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:39,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425011510] [2021-01-06 11:41:39,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:39,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:39,297 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2021-01-06 11:41:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:39,824 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2021-01-06 11:41:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:39,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-01-06 11:41:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:39,828 INFO L225 Difference]: With dead ends: 290 [2021-01-06 11:41:39,828 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:41:39,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:41:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:41:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2021-01-06 11:41:39,848 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2021-01-06 11:41:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:39,848 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2021-01-06 11:41:39,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2021-01-06 11:41:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:39,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:39,853 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:39,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:41:39,853 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2021-01-06 11:41:39,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:39,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417703883] [2021-01-06 11:41:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:39,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417703883] [2021-01-06 11:41:39,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:39,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:39,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22189002] [2021-01-06 11:41:39,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:39,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:39,956 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2021-01-06 11:41:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:40,386 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2021-01-06 11:41:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:40,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:40,391 INFO L225 Difference]: With dead ends: 289 [2021-01-06 11:41:40,392 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 11:41:40,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 11:41:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-01-06 11:41:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2021-01-06 11:41:40,421 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2021-01-06 11:41:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:40,422 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2021-01-06 11:41:40,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2021-01-06 11:41:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:40,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:40,427 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:40,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:41:40,429 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2021-01-06 11:41:40,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:40,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186229797] [2021-01-06 11:41:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:40,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186229797] [2021-01-06 11:41:40,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:40,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:40,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528060442] [2021-01-06 11:41:40,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:40,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:40,598 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2021-01-06 11:41:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:41,153 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2021-01-06 11:41:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:41,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:41,155 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:41:41,156 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:41:41,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:41:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-01-06 11:41:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2021-01-06 11:41:41,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2021-01-06 11:41:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:41,176 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2021-01-06 11:41:41,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2021-01-06 11:41:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:41,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:41,182 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:41,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:41:41,182 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2021-01-06 11:41:41,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:41,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917362798] [2021-01-06 11:41:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:41,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917362798] [2021-01-06 11:41:41,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:41,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:41,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123037406] [2021-01-06 11:41:41,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:41,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:41,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:41,340 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2021-01-06 11:41:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:41,773 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2021-01-06 11:41:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:41,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:41,775 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:41,775 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:41,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2021-01-06 11:41:41,800 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2021-01-06 11:41:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:41,801 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2021-01-06 11:41:41,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2021-01-06 11:41:41,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:41,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:41,805 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:41,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:41:41,809 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2021-01-06 11:41:41,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:41,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26246831] [2021-01-06 11:41:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:41,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26246831] [2021-01-06 11:41:41,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:41,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:41,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871110490] [2021-01-06 11:41:41,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:41,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:41,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:41,924 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2021-01-06 11:41:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:42,297 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2021-01-06 11:41:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:42,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:42,300 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:42,300 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:42,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2021-01-06 11:41:42,312 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2021-01-06 11:41:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:42,312 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2021-01-06 11:41:42,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2021-01-06 11:41:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:41:42,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:42,314 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:42,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:41:42,315 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2021-01-06 11:41:42,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:42,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313940056] [2021-01-06 11:41:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:42,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313940056] [2021-01-06 11:41:42,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:42,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:42,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172657334] [2021-01-06 11:41:42,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:42,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:42,415 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2021-01-06 11:41:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:42,789 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2021-01-06 11:41:42,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:42,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2021-01-06 11:41:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:42,793 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:42,793 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:42,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2021-01-06 11:41:42,802 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2021-01-06 11:41:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:42,802 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2021-01-06 11:41:42,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-01-06 11:41:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:41:42,804 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:42,804 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:42,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:41:42,804 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2021-01-06 11:41:42,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:42,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805128859] [2021-01-06 11:41:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:42,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805128859] [2021-01-06 11:41:42,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:42,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:42,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306318065] [2021-01-06 11:41:42,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:42,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:42,875 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2021-01-06 11:41:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:43,273 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2021-01-06 11:41:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:43,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 11:41:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:43,276 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:43,276 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:43,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-01-06 11:41:43,285 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2021-01-06 11:41:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:43,285 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-01-06 11:41:43,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-01-06 11:41:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:41:43,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:43,289 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:43,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:41:43,289 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2021-01-06 11:41:43,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:43,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567510133] [2021-01-06 11:41:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:43,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567510133] [2021-01-06 11:41:43,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:43,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:43,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463192767] [2021-01-06 11:41:43,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:43,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:43,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:43,409 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2021-01-06 11:41:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:43,771 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2021-01-06 11:41:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:43,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:41:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:43,774 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:41:43,774 INFO L226 Difference]: Without dead ends: 149 [2021-01-06 11:41:43,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 [2021-01-06 11:41:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-01-06 11:41:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-01-06 11:41:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2021-01-06 11:41:43,782 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2021-01-06 11:41:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:43,783 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2021-01-06 11:41:43,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2021-01-06 11:41:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:41:43,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:43,784 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:43,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:41:43,785 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2021-01-06 11:41:43,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:43,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091768148] [2021-01-06 11:41:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:43,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091768148] [2021-01-06 11:41:43,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:43,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:43,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382033852] [2021-01-06 11:41:43,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:43,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:43,909 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2021-01-06 11:41:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:44,305 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-01-06 11:41:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:44,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:41:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:44,308 INFO L225 Difference]: With dead ends: 316 [2021-01-06 11:41:44,311 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:41:44,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:41:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:41:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2021-01-06 11:41:44,324 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2021-01-06 11:41:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:44,325 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2021-01-06 11:41:44,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2021-01-06 11:41:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 11:41:44,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:44,328 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:44,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:41:44,329 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2021-01-06 11:41:44,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:44,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212640261] [2021-01-06 11:41:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:44,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212640261] [2021-01-06 11:41:44,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:44,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:44,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385965556] [2021-01-06 11:41:44,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:44,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:44,432 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2021-01-06 11:41:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:44,867 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2021-01-06 11:41:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:44,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 11:41:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:44,869 INFO L225 Difference]: With dead ends: 338 [2021-01-06 11:41:44,869 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:41:44,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:41:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:41:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-01-06 11:41:44,880 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2021-01-06 11:41:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:44,881 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-01-06 11:41:44,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-01-06 11:41:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:44,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:44,882 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:44,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:41:44,883 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2021-01-06 11:41:44,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:44,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897296115] [2021-01-06 11:41:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:44,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897296115] [2021-01-06 11:41:44,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:44,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:44,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998459882] [2021-01-06 11:41:44,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:44,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:44,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:44,983 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2021-01-06 11:41:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:45,352 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2021-01-06 11:41:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:45,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:45,354 INFO L225 Difference]: With dead ends: 337 [2021-01-06 11:41:45,354 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 11:41:45,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 11:41:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2021-01-06 11:41:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2021-01-06 11:41:45,362 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2021-01-06 11:41:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:45,362 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2021-01-06 11:41:45,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2021-01-06 11:41:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:45,363 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:45,364 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:45,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:41:45,364 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2021-01-06 11:41:45,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:45,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361495585] [2021-01-06 11:41:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:45,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361495585] [2021-01-06 11:41:45,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:45,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:45,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351093000] [2021-01-06 11:41:45,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:45,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:45,506 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2021-01-06 11:41:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:45,892 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2021-01-06 11:41:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:45,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:45,897 INFO L225 Difference]: With dead ends: 335 [2021-01-06 11:41:45,898 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:41:45,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:41:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2021-01-06 11:41:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2021-01-06 11:41:45,910 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2021-01-06 11:41:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:45,911 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2021-01-06 11:41:45,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2021-01-06 11:41:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:45,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:45,913 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:45,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:41:45,913 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2021-01-06 11:41:45,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:45,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527007350] [2021-01-06 11:41:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:45,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527007350] [2021-01-06 11:41:45,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:45,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:45,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412119725] [2021-01-06 11:41:45,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:45,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:45,994 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2021-01-06 11:41:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:46,356 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2021-01-06 11:41:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:46,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:46,358 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:46,359 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:46,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2021-01-06 11:41:46,369 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2021-01-06 11:41:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:46,369 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2021-01-06 11:41:46,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2021-01-06 11:41:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:46,371 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:46,371 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:46,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:41:46,371 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2021-01-06 11:41:46,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:46,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237244398] [2021-01-06 11:41:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:46,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237244398] [2021-01-06 11:41:46,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:46,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:46,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729072524] [2021-01-06 11:41:46,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:46,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:46,447 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2021-01-06 11:41:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:46,774 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-01-06 11:41:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:46,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:46,777 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:46,777 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:46,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-01-06 11:41:46,786 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2021-01-06 11:41:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:46,786 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-01-06 11:41:46,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2021-01-06 11:41:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 11:41:46,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:46,787 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:46,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:41:46,788 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2021-01-06 11:41:46,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:46,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66165714] [2021-01-06 11:41:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:46,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66165714] [2021-01-06 11:41:46,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:46,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:46,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191650917] [2021-01-06 11:41:46,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:46,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:46,851 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2021-01-06 11:41:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:47,208 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2021-01-06 11:41:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:47,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 11:41:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:47,211 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:47,211 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:47,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 [2021-01-06 11:41:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-01-06 11:41:47,219 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2021-01-06 11:41:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:47,219 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-01-06 11:41:47,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2021-01-06 11:41:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:41:47,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:47,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] [2021-01-06 11:41:47,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:41:47,221 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2021-01-06 11:41:47,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:47,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612642361] [2021-01-06 11:41:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:47,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612642361] [2021-01-06 11:41:47,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:47,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:47,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776700029] [2021-01-06 11:41:47,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:47,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:47,289 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2021-01-06 11:41:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:47,662 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2021-01-06 11:41:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:47,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 11:41:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:47,665 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:47,665 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:47,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2021-01-06 11:41:47,672 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2021-01-06 11:41:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:47,672 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2021-01-06 11:41:47,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2021-01-06 11:41:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 11:41:47,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:47,674 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:47,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:41:47,675 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:47,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2021-01-06 11:41:47,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:47,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011183174] [2021-01-06 11:41:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:47,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011183174] [2021-01-06 11:41:47,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:47,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:47,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042952111] [2021-01-06 11:41:47,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:47,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:47,752 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2021-01-06 11:41:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:48,092 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2021-01-06 11:41:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:48,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 11:41:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:48,094 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:41:48,094 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:41:48,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:41:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-01-06 11:41:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2021-01-06 11:41:48,101 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2021-01-06 11:41:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:48,102 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2021-01-06 11:41:48,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2021-01-06 11:41:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:41:48,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:48,103 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:48,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:41:48,104 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2021-01-06 11:41:48,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:48,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801032663] [2021-01-06 11:41:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:48,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801032663] [2021-01-06 11:41:48,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:48,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:48,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845114369] [2021-01-06 11:41:48,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:48,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:48,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:48,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:48,187 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2021-01-06 11:41:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:48,825 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2021-01-06 11:41:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:48,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:41:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:48,828 INFO L225 Difference]: With dead ends: 424 [2021-01-06 11:41:48,828 INFO L226 Difference]: Without dead ends: 275 [2021-01-06 11:41:48,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-06 11:41:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2021-01-06 11:41:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 11:41:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2021-01-06 11:41:48,838 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2021-01-06 11:41:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:48,839 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2021-01-06 11:41:48,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2021-01-06 11:41:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:41:48,840 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:48,841 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:48,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:41:48,841 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2021-01-06 11:41:48,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:48,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142812236] [2021-01-06 11:41:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:48,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142812236] [2021-01-06 11:41:48,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:48,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:48,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133785744] [2021-01-06 11:41:48,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:48,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:48,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:48,924 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2021-01-06 11:41:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:49,374 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2021-01-06 11:41:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:49,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:41:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:49,377 INFO L225 Difference]: With dead ends: 427 [2021-01-06 11:41:49,377 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 11:41:49,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 11:41:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2021-01-06 11:41:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-06 11:41:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-01-06 11:41:49,387 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2021-01-06 11:41:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:49,387 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-01-06 11:41:49,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2021-01-06 11:41:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:41:49,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:49,389 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:49,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:41:49,389 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2021-01-06 11:41:49,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:49,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726271544] [2021-01-06 11:41:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:49,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726271544] [2021-01-06 11:41:49,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:49,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:49,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796145881] [2021-01-06 11:41:49,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:49,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:49,482 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2021-01-06 11:41:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:50,076 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2021-01-06 11:41:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:50,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:41:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:50,079 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:41:50,079 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:41:50,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:41:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2021-01-06 11:41:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 11:41:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2021-01-06 11:41:50,091 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2021-01-06 11:41:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:50,091 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2021-01-06 11:41:50,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2021-01-06 11:41:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 11:41:50,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:50,092 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:50,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:41:50,093 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2021-01-06 11:41:50,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:50,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589663450] [2021-01-06 11:41:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:50,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589663450] [2021-01-06 11:41:50,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:50,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:50,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662141855] [2021-01-06 11:41:50,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:50,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:50,204 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2021-01-06 11:41:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:50,719 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2021-01-06 11:41:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:50,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 11:41:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:50,722 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:41:50,722 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:41:50,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:41:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2021-01-06 11:41:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-01-06 11:41:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2021-01-06 11:41:50,732 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2021-01-06 11:41:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:50,733 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2021-01-06 11:41:50,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2021-01-06 11:41:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:41:50,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:50,734 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:50,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:41:50,735 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2021-01-06 11:41:50,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:50,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46996142] [2021-01-06 11:41:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:50,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46996142] [2021-01-06 11:41:50,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:50,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:50,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139671139] [2021-01-06 11:41:50,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:50,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:50,831 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2021-01-06 11:41:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:51,374 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2021-01-06 11:41:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:51,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:41:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:51,376 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:41:51,377 INFO L226 Difference]: Without dead ends: 285 [2021-01-06 11:41:51,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-06 11:41:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2021-01-06 11:41:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2021-01-06 11:41:51,386 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2021-01-06 11:41:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:51,387 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2021-01-06 11:41:51,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2021-01-06 11:41:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:41:51,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:51,389 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:51,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:41:51,389 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2021-01-06 11:41:51,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:51,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990512779] [2021-01-06 11:41:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:51,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990512779] [2021-01-06 11:41:51,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:51,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:51,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748081941] [2021-01-06 11:41:51,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:51,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:51,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:51,475 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2021-01-06 11:41:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:52,007 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2021-01-06 11:41:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:52,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:41:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:52,010 INFO L225 Difference]: With dead ends: 500 [2021-01-06 11:41:52,010 INFO L226 Difference]: Without dead ends: 285 [2021-01-06 11:41:52,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-06 11:41:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2021-01-06 11:41:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2021-01-06 11:41:52,019 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2021-01-06 11:41:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:52,019 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2021-01-06 11:41:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2021-01-06 11:41:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:41:52,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:52,021 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:52,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:41:52,021 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2021-01-06 11:41:52,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:52,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455472517] [2021-01-06 11:41:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:52,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455472517] [2021-01-06 11:41:52,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:52,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:52,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091945697] [2021-01-06 11:41:52,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:52,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:52,098 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2021-01-06 11:41:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:52,584 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2021-01-06 11:41:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:52,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:41:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:52,587 INFO L225 Difference]: With dead ends: 475 [2021-01-06 11:41:52,587 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 11:41:52,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 11:41:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2021-01-06 11:41:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2021-01-06 11:41:52,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2021-01-06 11:41:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:52,598 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2021-01-06 11:41:52,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2021-01-06 11:41:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:52,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:52,601 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:52,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:41:52,601 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2021-01-06 11:41:52,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:52,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033157657] [2021-01-06 11:41:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:52,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033157657] [2021-01-06 11:41:52,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:52,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:52,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404183687] [2021-01-06 11:41:52,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:52,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:52,688 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2021-01-06 11:41:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:53,239 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2021-01-06 11:41:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:53,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:53,242 INFO L225 Difference]: With dead ends: 499 [2021-01-06 11:41:53,242 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:41:53,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:41:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2021-01-06 11:41:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2021-01-06 11:41:53,253 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2021-01-06 11:41:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:53,253 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2021-01-06 11:41:53,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2021-01-06 11:41:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:53,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:53,255 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:53,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:41:53,255 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2021-01-06 11:41:53,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:53,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970460069] [2021-01-06 11:41:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:53,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970460069] [2021-01-06 11:41:53,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:53,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:53,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818791236] [2021-01-06 11:41:53,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:53,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:53,349 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2021-01-06 11:41:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:53,883 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2021-01-06 11:41:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:53,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:53,886 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:41:53,886 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:41:53,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:41:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2021-01-06 11:41:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2021-01-06 11:41:53,897 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2021-01-06 11:41:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:53,898 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2021-01-06 11:41:53,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2021-01-06 11:41:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:53,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:53,900 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:53,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:41:53,900 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2021-01-06 11:41:53,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:53,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431211239] [2021-01-06 11:41:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:53,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431211239] [2021-01-06 11:41:53,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:53,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:53,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265539522] [2021-01-06 11:41:53,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:53,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:53,992 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2021-01-06 11:41:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:54,580 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2021-01-06 11:41:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:54,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:54,583 INFO L225 Difference]: With dead ends: 496 [2021-01-06 11:41:54,584 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:41:54,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:41:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2021-01-06 11:41:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2021-01-06 11:41:54,597 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2021-01-06 11:41:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:54,597 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2021-01-06 11:41:54,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2021-01-06 11:41:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:54,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:54,600 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:54,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:41:54,601 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2021-01-06 11:41:54,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:54,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514656733] [2021-01-06 11:41:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:41:54,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514656733] [2021-01-06 11:41:54,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:54,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:41:54,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419928427] [2021-01-06 11:41:54,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:41:54,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:41:54,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:54,784 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2021-01-06 11:41:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:55,356 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2021-01-06 11:41:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:41:55,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 11:41:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:55,359 INFO L225 Difference]: With dead ends: 470 [2021-01-06 11:41:55,359 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:41:55,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:41:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:41:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-01-06 11:41:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2021-01-06 11:41:55,373 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2021-01-06 11:41:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:55,374 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2021-01-06 11:41:55,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:41:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2021-01-06 11:41:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:55,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:55,376 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:55,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:41:55,376 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2021-01-06 11:41:55,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:55,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929276731] [2021-01-06 11:41:55,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:55,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929276731] [2021-01-06 11:41:55,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:55,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:55,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238551560] [2021-01-06 11:41:55,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:55,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:55,462 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2021-01-06 11:41:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:55,909 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2021-01-06 11:41:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:55,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:55,912 INFO L225 Difference]: With dead ends: 512 [2021-01-06 11:41:55,912 INFO L226 Difference]: Without dead ends: 277 [2021-01-06 11:41:55,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-06 11:41:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2021-01-06 11:41:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2021-01-06 11:41:55,924 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2021-01-06 11:41:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:55,924 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2021-01-06 11:41:55,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2021-01-06 11:41:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:55,926 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:55,926 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:55,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:41:55,927 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2021-01-06 11:41:55,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:55,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997361689] [2021-01-06 11:41:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:56,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997361689] [2021-01-06 11:41:56,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:56,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:56,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983558071] [2021-01-06 11:41:56,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:56,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:56,013 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2021-01-06 11:41:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:56,479 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2021-01-06 11:41:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:56,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:56,482 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:56,482 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:56,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2021-01-06 11:41:56,494 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2021-01-06 11:41:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:56,494 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2021-01-06 11:41:56,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2021-01-06 11:41:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:41:56,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:56,496 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:56,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:41:56,497 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2021-01-06 11:41:56,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:56,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028969917] [2021-01-06 11:41:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:56,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028969917] [2021-01-06 11:41:56,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:56,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:56,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316122556] [2021-01-06 11:41:56,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:56,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:56,592 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2021-01-06 11:41:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:57,155 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2021-01-06 11:41:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:57,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:41:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:57,157 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:41:57,157 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:41:57,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:41:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:41:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-01-06 11:41:57,173 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2021-01-06 11:41:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:57,174 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-01-06 11:41:57,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-01-06 11:41:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:41:57,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:57,176 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:57,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:41:57,176 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2021-01-06 11:41:57,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:57,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678150646] [2021-01-06 11:41:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:57,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678150646] [2021-01-06 11:41:57,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:57,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:57,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891709290] [2021-01-06 11:41:57,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:57,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:57,266 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2021-01-06 11:41:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:57,676 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-01-06 11:41:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:57,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:41:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:57,679 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:57,679 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:57,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2021-01-06 11:41:57,692 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2021-01-06 11:41:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:57,693 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2021-01-06 11:41:57,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2021-01-06 11:41:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:41:57,694 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:57,694 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:57,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:41:57,694 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2021-01-06 11:41:57,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:57,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822567146] [2021-01-06 11:41:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:57,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822567146] [2021-01-06 11:41:57,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:57,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:57,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220537909] [2021-01-06 11:41:57,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:57,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:57,789 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2021-01-06 11:41:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:58,298 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2021-01-06 11:41:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:58,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:41:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:58,302 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:41:58,302 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:41:58,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:41:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:41:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2021-01-06 11:41:58,315 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2021-01-06 11:41:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:58,316 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2021-01-06 11:41:58,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2021-01-06 11:41:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:41:58,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:58,318 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:58,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:41:58,318 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2021-01-06 11:41:58,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:58,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705459891] [2021-01-06 11:41:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:58,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705459891] [2021-01-06 11:41:58,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:58,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:58,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474336520] [2021-01-06 11:41:58,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:58,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:58,397 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2021-01-06 11:41:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:58,841 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2021-01-06 11:41:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:58,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:41:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:58,844 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:58,844 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:58,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2021-01-06 11:41:58,854 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2021-01-06 11:41:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:58,855 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2021-01-06 11:41:58,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2021-01-06 11:41:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:41:58,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:58,857 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:58,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:41:58,858 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2021-01-06 11:41:58,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:58,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008845087] [2021-01-06 11:41:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:58,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008845087] [2021-01-06 11:41:58,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:58,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:58,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731859373] [2021-01-06 11:41:58,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:58,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:58,945 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2021-01-06 11:41:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:59,477 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2021-01-06 11:41:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:59,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:41:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:59,480 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:41:59,480 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:41:59,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:41:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2021-01-06 11:41:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2021-01-06 11:41:59,493 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2021-01-06 11:41:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:59,493 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2021-01-06 11:41:59,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2021-01-06 11:41:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:41:59,494 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:59,494 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:59,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:41:59,495 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2021-01-06 11:41:59,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:59,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22456790] [2021-01-06 11:41:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:59,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22456790] [2021-01-06 11:41:59,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:59,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:59,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061432867] [2021-01-06 11:41:59,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:59,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:59,591 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2021-01-06 11:41:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:59,978 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2021-01-06 11:41:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:59,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:41:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:59,981 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:59,981 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:59,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2021-01-06 11:41:59,994 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2021-01-06 11:41:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:59,994 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2021-01-06 11:41:59,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2021-01-06 11:41:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:41:59,996 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:59,996 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:59,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:41:59,997 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2021-01-06 11:41:59,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:59,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806700527] [2021-01-06 11:41:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:00,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806700527] [2021-01-06 11:42:00,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:00,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:00,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924470597] [2021-01-06 11:42:00,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:00,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:00,079 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2021-01-06 11:42:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:00,643 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2021-01-06 11:42:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:00,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:42:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:00,646 INFO L225 Difference]: With dead ends: 526 [2021-01-06 11:42:00,646 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:42:00,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:42:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2021-01-06 11:42:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2021-01-06 11:42:00,660 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2021-01-06 11:42:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:00,660 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2021-01-06 11:42:00,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2021-01-06 11:42:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:42:00,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:00,662 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:00,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:42:00,663 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2021-01-06 11:42:00,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:00,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856397495] [2021-01-06 11:42:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:00,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856397495] [2021-01-06 11:42:00,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:00,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:00,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613373024] [2021-01-06 11:42:00,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:00,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:00,761 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2021-01-06 11:42:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:01,164 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2021-01-06 11:42:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:01,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:42:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:01,166 INFO L225 Difference]: With dead ends: 501 [2021-01-06 11:42:01,166 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:42:01,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:42:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2021-01-06 11:42:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2021-01-06 11:42:01,177 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2021-01-06 11:42:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:01,177 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2021-01-06 11:42:01,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2021-01-06 11:42:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:42:01,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:01,178 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:01,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:42:01,179 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2021-01-06 11:42:01,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:01,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881646453] [2021-01-06 11:42:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:01,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881646453] [2021-01-06 11:42:01,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:01,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:01,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777644477] [2021-01-06 11:42:01,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:01,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:01,278 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2021-01-06 11:42:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:01,748 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2021-01-06 11:42:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:01,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:42:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:01,751 INFO L225 Difference]: With dead ends: 526 [2021-01-06 11:42:01,751 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:42:01,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:42:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2021-01-06 11:42:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2021-01-06 11:42:01,762 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2021-01-06 11:42:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:01,763 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2021-01-06 11:42:01,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2021-01-06 11:42:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:42:01,764 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:01,764 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:01,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:42:01,765 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2021-01-06 11:42:01,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:01,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020503750] [2021-01-06 11:42:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:42:01,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020503750] [2021-01-06 11:42:01,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:01,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:01,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319177817] [2021-01-06 11:42:01,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:01,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:01,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:01,843 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2021-01-06 11:42:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:01,935 INFO L93 Difference]: Finished difference Result 719 states and 1071 transitions. [2021-01-06 11:42:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:01,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:42:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:01,939 INFO L225 Difference]: With dead ends: 719 [2021-01-06 11:42:01,939 INFO L226 Difference]: Without dead ends: 484 [2021-01-06 11:42:01,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-06 11:42:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-01-06 11:42:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2021-01-06 11:42:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 710 transitions. [2021-01-06 11:42:01,959 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 710 transitions. Word has length 96 [2021-01-06 11:42:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:01,960 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 710 transitions. [2021-01-06 11:42:01,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 710 transitions. [2021-01-06 11:42:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:42:01,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:01,961 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:01,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:42:01,962 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash 149915310, now seen corresponding path program 1 times [2021-01-06 11:42:01,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:01,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995058139] [2021-01-06 11:42:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:42:02,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995058139] [2021-01-06 11:42:02,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:02,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175896000] [2021-01-06 11:42:02,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:02,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:02,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,021 INFO L87 Difference]: Start difference. First operand 484 states and 710 transitions. Second operand 3 states. [2021-01-06 11:42:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:02,098 INFO L93 Difference]: Finished difference Result 976 states and 1435 transitions. [2021-01-06 11:42:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:02,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:42:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:02,102 INFO L225 Difference]: With dead ends: 976 [2021-01-06 11:42:02,102 INFO L226 Difference]: Without dead ends: 511 [2021-01-06 11:42:02,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-06 11:42:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-01-06 11:42:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2021-01-06 11:42:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2021-01-06 11:42:02,129 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2021-01-06 11:42:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:02,129 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2021-01-06 11:42:02,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2021-01-06 11:42:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:42:02,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:02,132 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:02,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:42:02,132 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash 176980912, now seen corresponding path program 1 times [2021-01-06 11:42:02,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:02,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685758349] [2021-01-06 11:42:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:42:02,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685758349] [2021-01-06 11:42:02,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:02,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715127932] [2021-01-06 11:42:02,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:02,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:02,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,181 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2021-01-06 11:42:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:02,219 INFO L93 Difference]: Finished difference Result 1005 states and 1471 transitions. [2021-01-06 11:42:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:02,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:42:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:02,223 INFO L225 Difference]: With dead ends: 1005 [2021-01-06 11:42:02,223 INFO L226 Difference]: Without dead ends: 513 [2021-01-06 11:42:02,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-01-06 11:42:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-01-06 11:42:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2021-01-06 11:42:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 747 transitions. [2021-01-06 11:42:02,247 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 747 transitions. Word has length 96 [2021-01-06 11:42:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:02,247 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 747 transitions. [2021-01-06 11:42:02,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 747 transitions. [2021-01-06 11:42:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:42:02,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:02,249 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:02,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:42:02,250 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2021-01-06 11:42:02,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:02,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482069103] [2021-01-06 11:42:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:42:02,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482069103] [2021-01-06 11:42:02,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:02,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573835211] [2021-01-06 11:42:02,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:02,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,337 INFO L87 Difference]: Start difference. First operand 513 states and 747 transitions. Second operand 3 states. [2021-01-06 11:42:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:02,421 INFO L93 Difference]: Finished difference Result 1240 states and 1821 transitions. [2021-01-06 11:42:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:02,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:42:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:02,428 INFO L225 Difference]: With dead ends: 1240 [2021-01-06 11:42:02,429 INFO L226 Difference]: Without dead ends: 748 [2021-01-06 11:42:02,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-01-06 11:42:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2021-01-06 11:42:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2021-01-06 11:42:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2021-01-06 11:42:02,488 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 98 [2021-01-06 11:42:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:02,489 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2021-01-06 11:42:02,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2021-01-06 11:42:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 11:42:02,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:02,492 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:02,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:42:02,493 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2021-01-06 11:42:02,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:02,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863109596] [2021-01-06 11:42:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:42:02,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863109596] [2021-01-06 11:42:02,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:02,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316994037] [2021-01-06 11:42:02,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:02,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,579 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 3 states. [2021-01-06 11:42:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:02,698 INFO L93 Difference]: Finished difference Result 1706 states and 2515 transitions. [2021-01-06 11:42:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:02,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-06 11:42:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:02,704 INFO L225 Difference]: With dead ends: 1706 [2021-01-06 11:42:02,704 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:42:02,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:42:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2021-01-06 11:42:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2021-01-06 11:42:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2021-01-06 11:42:02,749 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 104 [2021-01-06 11:42:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:02,750 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2021-01-06 11:42:02,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2021-01-06 11:42:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:42:02,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:02,754 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:02,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:42:02,755 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2021-01-06 11:42:02,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:02,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167791417] [2021-01-06 11:42:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:42:02,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167791417] [2021-01-06 11:42:02,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:02,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627028396] [2021-01-06 11:42:02,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:02,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,847 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand 3 states. [2021-01-06 11:42:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:02,937 INFO L93 Difference]: Finished difference Result 2170 states and 3182 transitions. [2021-01-06 11:42:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:02,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:42:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:02,945 INFO L225 Difference]: With dead ends: 2170 [2021-01-06 11:42:02,945 INFO L226 Difference]: Without dead ends: 1212 [2021-01-06 11:42:02,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-01-06 11:42:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2021-01-06 11:42:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2021-01-06 11:42:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1774 transitions. [2021-01-06 11:42:03,002 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1774 transitions. Word has length 121 [2021-01-06 11:42:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:03,002 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 1774 transitions. [2021-01-06 11:42:03,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1774 transitions. [2021-01-06 11:42:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 11:42:03,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:03,005 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:03,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:42:03,006 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2021-01-06 11:42:03,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:03,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465380657] [2021-01-06 11:42:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:42:03,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465380657] [2021-01-06 11:42:03,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:03,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:03,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280909780] [2021-01-06 11:42:03,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:03,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:03,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:03,095 INFO L87 Difference]: Start difference. First operand 1212 states and 1774 transitions. Second operand 3 states. [2021-01-06 11:42:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:03,177 INFO L93 Difference]: Finished difference Result 1449 states and 2119 transitions. [2021-01-06 11:42:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:03,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 11:42:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:03,187 INFO L225 Difference]: With dead ends: 1449 [2021-01-06 11:42:03,187 INFO L226 Difference]: Without dead ends: 1447 [2021-01-06 11:42:03,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2021-01-06 11:42:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2021-01-06 11:42:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2021-01-06 11:42:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2116 transitions. [2021-01-06 11:42:03,249 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2116 transitions. Word has length 127 [2021-01-06 11:42:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:03,250 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2116 transitions. [2021-01-06 11:42:03,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2116 transitions. [2021-01-06 11:42:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 11:42:03,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:03,254 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:03,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:42:03,255 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2021-01-06 11:42:03,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:03,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731258] [2021-01-06 11:42:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:42:03,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731258] [2021-01-06 11:42:03,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:03,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:42:03,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470636655] [2021-01-06 11:42:03,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:42:03,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:42:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:03,450 INFO L87 Difference]: Start difference. First operand 1445 states and 2116 transitions. Second operand 3 states. [2021-01-06 11:42:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:03,555 INFO L93 Difference]: Finished difference Result 2146 states and 3150 transitions. [2021-01-06 11:42:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:42:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2021-01-06 11:42:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:03,566 INFO L225 Difference]: With dead ends: 2146 [2021-01-06 11:42:03,567 INFO L226 Difference]: Without dead ends: 1678 [2021-01-06 11:42:03,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:42:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2021-01-06 11:42:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2021-01-06 11:42:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2021-01-06 11:42:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2462 transitions. [2021-01-06 11:42:03,643 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2462 transitions. Word has length 164 [2021-01-06 11:42:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:03,644 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 2462 transitions. [2021-01-06 11:42:03,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:42:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2462 transitions. [2021-01-06 11:42:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 11:42:03,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:03,649 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:03,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 11:42:03,649 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2021-01-06 11:42:03,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:03,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873613258] [2021-01-06 11:42:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:42:03,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873613258] [2021-01-06 11:42:03,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:03,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:03,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608885422] [2021-01-06 11:42:03,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:03,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:03,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:03,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:03,789 INFO L87 Difference]: Start difference. First operand 1678 states and 2462 transitions. Second operand 4 states. [2021-01-06 11:42:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:04,338 INFO L93 Difference]: Finished difference Result 3776 states and 5574 transitions. [2021-01-06 11:42:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:04,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2021-01-06 11:42:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:04,350 INFO L225 Difference]: With dead ends: 3776 [2021-01-06 11:42:04,350 INFO L226 Difference]: Without dead ends: 2119 [2021-01-06 11:42:04,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-01-06 11:42:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1874. [2021-01-06 11:42:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2805 transitions. [2021-01-06 11:42:04,442 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2805 transitions. Word has length 172 [2021-01-06 11:42:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:04,443 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2805 transitions. [2021-01-06 11:42:04,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2805 transitions. [2021-01-06 11:42:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-06 11:42:04,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:04,449 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:04,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:42:04,449 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1861094142, now seen corresponding path program 1 times [2021-01-06 11:42:04,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:04,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065743740] [2021-01-06 11:42:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:04,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065743740] [2021-01-06 11:42:04,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:04,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:04,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169287409] [2021-01-06 11:42:04,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:04,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:04,603 INFO L87 Difference]: Start difference. First operand 1874 states and 2805 transitions. Second operand 4 states. [2021-01-06 11:42:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:05,184 INFO L93 Difference]: Finished difference Result 3972 states and 5910 transitions. [2021-01-06 11:42:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:05,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2021-01-06 11:42:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:05,196 INFO L225 Difference]: With dead ends: 3972 [2021-01-06 11:42:05,197 INFO L226 Difference]: Without dead ends: 2119 [2021-01-06 11:42:05,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-01-06 11:42:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1874. [2021-01-06 11:42:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2798 transitions. [2021-01-06 11:42:05,276 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2798 transitions. Word has length 185 [2021-01-06 11:42:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:05,276 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2798 transitions. [2021-01-06 11:42:05,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2798 transitions. [2021-01-06 11:42:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:42:05,281 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:05,281 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:05,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:42:05,282 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash 593014019, now seen corresponding path program 1 times [2021-01-06 11:42:05,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:05,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279347406] [2021-01-06 11:42:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:05,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279347406] [2021-01-06 11:42:05,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:05,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:05,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306193330] [2021-01-06 11:42:05,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:05,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:05,408 INFO L87 Difference]: Start difference. First operand 1874 states and 2798 transitions. Second operand 4 states. [2021-01-06 11:42:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:05,974 INFO L93 Difference]: Finished difference Result 3958 states and 5882 transitions. [2021-01-06 11:42:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:05,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-06 11:42:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:05,985 INFO L225 Difference]: With dead ends: 3958 [2021-01-06 11:42:05,986 INFO L226 Difference]: Without dead ends: 2105 [2021-01-06 11:42:05,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2021-01-06 11:42:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1874. [2021-01-06 11:42:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2791 transitions. [2021-01-06 11:42:06,060 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2791 transitions. Word has length 186 [2021-01-06 11:42:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:06,061 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2791 transitions. [2021-01-06 11:42:06,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2791 transitions. [2021-01-06 11:42:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:42:06,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:06,066 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:06,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 11:42:06,066 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2021-01-06 11:42:06,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:06,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603716892] [2021-01-06 11:42:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:06,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603716892] [2021-01-06 11:42:06,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:06,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:06,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775664052] [2021-01-06 11:42:06,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:06,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:06,199 INFO L87 Difference]: Start difference. First operand 1874 states and 2791 transitions. Second operand 4 states. [2021-01-06 11:42:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:06,745 INFO L93 Difference]: Finished difference Result 3951 states and 5861 transitions. [2021-01-06 11:42:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:06,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-06 11:42:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:06,778 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:42:06,778 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:42:06,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:42:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:42:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2784 transitions. [2021-01-06 11:42:06,867 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2784 transitions. Word has length 186 [2021-01-06 11:42:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:06,867 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2784 transitions. [2021-01-06 11:42:06,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2784 transitions. [2021-01-06 11:42:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-06 11:42:06,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:06,873 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:06,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 11:42:06,873 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2021-01-06 11:42:06,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:06,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151516642] [2021-01-06 11:42:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:07,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151516642] [2021-01-06 11:42:07,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:07,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:07,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097474341] [2021-01-06 11:42:07,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:07,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:07,033 INFO L87 Difference]: Start difference. First operand 1874 states and 2784 transitions. Second operand 4 states. [2021-01-06 11:42:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:07,520 INFO L93 Difference]: Finished difference Result 3951 states and 5847 transitions. [2021-01-06 11:42:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:07,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2021-01-06 11:42:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:07,529 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:42:07,529 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:42:07,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 [2021-01-06 11:42:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:42:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:42:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2777 transitions. [2021-01-06 11:42:07,614 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2777 transitions. Word has length 187 [2021-01-06 11:42:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:07,614 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2777 transitions. [2021-01-06 11:42:07,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2777 transitions. [2021-01-06 11:42:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-01-06 11:42:07,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:07,620 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:07,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 11:42:07,620 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2021-01-06 11:42:07,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:07,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499830374] [2021-01-06 11:42:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:07,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499830374] [2021-01-06 11:42:07,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:07,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:07,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376880799] [2021-01-06 11:42:07,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:07,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:07,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:07,741 INFO L87 Difference]: Start difference. First operand 1874 states and 2777 transitions. Second operand 4 states. [2021-01-06 11:42:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:08,314 INFO L93 Difference]: Finished difference Result 3951 states and 5833 transitions. [2021-01-06 11:42:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:08,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2021-01-06 11:42:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:08,320 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:42:08,321 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:42:08,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:42:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:42:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2770 transitions. [2021-01-06 11:42:08,399 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2770 transitions. Word has length 188 [2021-01-06 11:42:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:08,399 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2770 transitions. [2021-01-06 11:42:08,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2770 transitions. [2021-01-06 11:42:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-01-06 11:42:08,405 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:08,405 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:08,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 11:42:08,405 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2021-01-06 11:42:08,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:08,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391184474] [2021-01-06 11:42:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:08,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391184474] [2021-01-06 11:42:08,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:08,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:08,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906535716] [2021-01-06 11:42:08,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:08,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:08,530 INFO L87 Difference]: Start difference. First operand 1874 states and 2770 transitions. Second operand 4 states. [2021-01-06 11:42:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:09,013 INFO L93 Difference]: Finished difference Result 3951 states and 5819 transitions. [2021-01-06 11:42:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:09,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2021-01-06 11:42:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:09,021 INFO L225 Difference]: With dead ends: 3951 [2021-01-06 11:42:09,022 INFO L226 Difference]: Without dead ends: 2098 [2021-01-06 11:42:09,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2021-01-06 11:42:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1874. [2021-01-06 11:42:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2763 transitions. [2021-01-06 11:42:09,092 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2763 transitions. Word has length 189 [2021-01-06 11:42:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:09,092 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2763 transitions. [2021-01-06 11:42:09,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2763 transitions. [2021-01-06 11:42:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-01-06 11:42:09,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:09,098 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:09,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 11:42:09,098 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2021-01-06 11:42:09,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:09,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324040156] [2021-01-06 11:42:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:09,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324040156] [2021-01-06 11:42:09,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:09,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:09,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793373950] [2021-01-06 11:42:09,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:09,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:09,264 INFO L87 Difference]: Start difference. First operand 1874 states and 2763 transitions. Second operand 4 states. [2021-01-06 11:42:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:09,773 INFO L93 Difference]: Finished difference Result 3881 states and 5721 transitions. [2021-01-06 11:42:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:09,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2021-01-06 11:42:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:09,780 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:42:09,780 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:42:09,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:42:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:42:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2756 transitions. [2021-01-06 11:42:09,872 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2756 transitions. Word has length 190 [2021-01-06 11:42:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:09,872 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2756 transitions. [2021-01-06 11:42:09,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2756 transitions. [2021-01-06 11:42:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 11:42:09,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:09,879 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:09,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 11:42:09,879 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1447453746, now seen corresponding path program 1 times [2021-01-06 11:42:09,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:09,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431815680] [2021-01-06 11:42:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:10,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431815680] [2021-01-06 11:42:10,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:10,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:10,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799413156] [2021-01-06 11:42:10,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:10,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:10,006 INFO L87 Difference]: Start difference. First operand 1874 states and 2756 transitions. Second operand 4 states. [2021-01-06 11:42:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:10,449 INFO L93 Difference]: Finished difference Result 3881 states and 5707 transitions. [2021-01-06 11:42:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:10,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2021-01-06 11:42:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:10,457 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:42:10,457 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:42:10,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:42:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:42:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2749 transitions. [2021-01-06 11:42:10,521 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2749 transitions. Word has length 194 [2021-01-06 11:42:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:10,521 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2749 transitions. [2021-01-06 11:42:10,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2749 transitions. [2021-01-06 11:42:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 11:42:10,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:10,526 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:10,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 11:42:10,526 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 161862790, now seen corresponding path program 1 times [2021-01-06 11:42:10,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:10,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444653770] [2021-01-06 11:42:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:10,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444653770] [2021-01-06 11:42:10,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:10,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:10,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863950274] [2021-01-06 11:42:10,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:10,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:10,686 INFO L87 Difference]: Start difference. First operand 1874 states and 2749 transitions. Second operand 4 states. [2021-01-06 11:42:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:11,150 INFO L93 Difference]: Finished difference Result 3881 states and 5693 transitions. [2021-01-06 11:42:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:11,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2021-01-06 11:42:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:11,157 INFO L225 Difference]: With dead ends: 3881 [2021-01-06 11:42:11,158 INFO L226 Difference]: Without dead ends: 2028 [2021-01-06 11:42:11,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2021-01-06 11:42:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1874. [2021-01-06 11:42:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2742 transitions. [2021-01-06 11:42:11,220 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2742 transitions. Word has length 194 [2021-01-06 11:42:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:11,221 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2742 transitions. [2021-01-06 11:42:11,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2742 transitions. [2021-01-06 11:42:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 11:42:11,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:11,226 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:11,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 11:42:11,226 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -345495059, now seen corresponding path program 1 times [2021-01-06 11:42:11,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:11,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945799359] [2021-01-06 11:42:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:11,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945799359] [2021-01-06 11:42:11,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:11,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:11,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612412350] [2021-01-06 11:42:11,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:11,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:11,358 INFO L87 Difference]: Start difference. First operand 1874 states and 2742 transitions. Second operand 4 states. [2021-01-06 11:42:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:11,915 INFO L93 Difference]: Finished difference Result 3853 states and 5641 transitions. [2021-01-06 11:42:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:11,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2021-01-06 11:42:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:11,924 INFO L225 Difference]: With dead ends: 3853 [2021-01-06 11:42:11,924 INFO L226 Difference]: Without dead ends: 2000 [2021-01-06 11:42:11,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2021-01-06 11:42:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1874. [2021-01-06 11:42:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2735 transitions. [2021-01-06 11:42:11,999 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2735 transitions. Word has length 195 [2021-01-06 11:42:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:11,999 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2735 transitions. [2021-01-06 11:42:11,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2735 transitions. [2021-01-06 11:42:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 11:42:12,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:12,004 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:12,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 11:42:12,005 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1457997217, now seen corresponding path program 1 times [2021-01-06 11:42:12,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:12,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151826905] [2021-01-06 11:42:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:12,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151826905] [2021-01-06 11:42:12,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:12,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:12,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584833286] [2021-01-06 11:42:12,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:12,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:12,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:12,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:12,167 INFO L87 Difference]: Start difference. First operand 1874 states and 2735 transitions. Second operand 4 states. [2021-01-06 11:42:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:12,586 INFO L93 Difference]: Finished difference Result 3819 states and 5583 transitions. [2021-01-06 11:42:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:12,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2021-01-06 11:42:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:12,591 INFO L225 Difference]: With dead ends: 3819 [2021-01-06 11:42:12,591 INFO L226 Difference]: Without dead ends: 1966 [2021-01-06 11:42:12,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-01-06 11:42:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1874. [2021-01-06 11:42:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2021-01-06 11:42:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2728 transitions. [2021-01-06 11:42:12,651 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2728 transitions. Word has length 195 [2021-01-06 11:42:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:12,654 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 2728 transitions. [2021-01-06 11:42:12,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2728 transitions. [2021-01-06 11:42:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-01-06 11:42:12,657 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:12,657 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:12,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-06 11:42:12,658 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2120220672, now seen corresponding path program 1 times [2021-01-06 11:42:12,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:12,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800265972] [2021-01-06 11:42:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:42:12,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800265972] [2021-01-06 11:42:12,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:12,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:12,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479786955] [2021-01-06 11:42:12,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:12,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:12,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:12,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:12,790 INFO L87 Difference]: Start difference. First operand 1874 states and 2728 transitions. Second operand 4 states. [2021-01-06 11:42:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:13,314 INFO L93 Difference]: Finished difference Result 4196 states and 6148 transitions. [2021-01-06 11:42:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:13,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2021-01-06 11:42:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:13,321 INFO L225 Difference]: With dead ends: 4196 [2021-01-06 11:42:13,321 INFO L226 Difference]: Without dead ends: 2343 [2021-01-06 11:42:13,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2021-01-06 11:42:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2084. [2021-01-06 11:42:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2021-01-06 11:42:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3099 transitions. [2021-01-06 11:42:13,387 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3099 transitions. Word has length 197 [2021-01-06 11:42:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:13,387 INFO L481 AbstractCegarLoop]: Abstraction has 2084 states and 3099 transitions. [2021-01-06 11:42:13,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3099 transitions. [2021-01-06 11:42:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-01-06 11:42:13,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:13,392 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:13,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 11:42:13,393 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash 650332099, now seen corresponding path program 1 times [2021-01-06 11:42:13,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:13,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460637246] [2021-01-06 11:42:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:42:13,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460637246] [2021-01-06 11:42:13,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:13,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:42:13,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048801694] [2021-01-06 11:42:13,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:42:13,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:13,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:42:13,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:13,651 INFO L87 Difference]: Start difference. First operand 2084 states and 3099 transitions. Second operand 5 states. [2021-01-06 11:42:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:14,610 INFO L93 Difference]: Finished difference Result 4686 states and 6995 transitions. [2021-01-06 11:42:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:42:14,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2021-01-06 11:42:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:14,619 INFO L225 Difference]: With dead ends: 4686 [2021-01-06 11:42:14,619 INFO L226 Difference]: Without dead ends: 2623 [2021-01-06 11:42:14,622 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 [2021-01-06 11:42:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-01-06 11:42:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2315. [2021-01-06 11:42:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2021-01-06 11:42:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3512 transitions. [2021-01-06 11:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3512 transitions. Word has length 203 [2021-01-06 11:42:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:14,704 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 3512 transitions. [2021-01-06 11:42:14,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:42:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3512 transitions. [2021-01-06 11:42:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-01-06 11:42:14,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:14,710 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:42:14,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-06 11:42:14,710 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1414950854, now seen corresponding path program 1 times [2021-01-06 11:42:14,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:14,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347616894] [2021-01-06 11:42:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 235 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-06 11:42:15,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347616894] [2021-01-06 11:42:15,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381634210] [2021-01-06 11:42:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:42:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:15,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:42:15,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:42:15,573 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:42:15,574 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:42:15,577 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,584 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:15,585 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,586 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:42:15,737 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:42:15,738 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:42:15,746 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:15,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:42:15,942 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 0 case distinctions, treesize of input 23 treesize of output 13 [2021-01-06 11:42:15,945 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:15,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:15,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2021-01-06 11:42:15,978 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_158|, |v_#memory_$Pointer$.offset_158|], 2=[|v_#memory_int_180|]} [2021-01-06 11:42:15,985 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-01-06 11:42:15,987 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:15,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:15,998 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-01-06 11:42:16,000 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:16,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:16,030 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:16,030 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:42:16,038 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:16,070 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:42:16,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:16,082 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:16,082 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:42:16,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:16,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:16,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:16,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:16,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:16,199 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:42:16,203 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:16,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:16,240 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:16,240 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:42:16,253 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:16,318 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:42:16,326 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:42:16,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:42:16,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:16,494 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:42:16,496 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:16,501 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:42:16,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:42:16,503 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:16,507 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:16,509 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:42:16,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:42:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 229 proven. 63 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 11:42:16,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:42:16,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2021-01-06 11:42:16,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315878787] [2021-01-06 11:42:16,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 11:42:16,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 11:42:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-01-06 11:42:16,700 INFO L87 Difference]: Start difference. First operand 2315 states and 3512 transitions. Second operand 18 states. [2021-01-06 11:42:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:23,634 INFO L93 Difference]: Finished difference Result 8447 states and 12862 transitions. [2021-01-06 11:42:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-06 11:42:23,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 208 [2021-01-06 11:42:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:23,649 INFO L225 Difference]: With dead ends: 8447 [2021-01-06 11:42:23,649 INFO L226 Difference]: Without dead ends: 6153 [2021-01-06 11:42:23,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 11:42:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2021-01-06 11:42:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 3798. [2021-01-06 11:42:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3798 states. [2021-01-06 11:42:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 6200 transitions. [2021-01-06 11:42:23,835 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 6200 transitions. Word has length 208 [2021-01-06 11:42:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:23,835 INFO L481 AbstractCegarLoop]: Abstraction has 3798 states and 6200 transitions. [2021-01-06 11:42:23,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 11:42:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 6200 transitions. [2021-01-06 11:42:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 11:42:23,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:23,845 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:42:24,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2021-01-06 11:42:24,059 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 79355886, now seen corresponding path program 1 times [2021-01-06 11:42:24,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:24,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996593829] [2021-01-06 11:42:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 236 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 11:42:24,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996593829] [2021-01-06 11:42:24,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032016613] [2021-01-06 11:42:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:42:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:24,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-06 11:42:24,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:42:24,715 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:42:24,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:42:24,716 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:24,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:42:24,779 INFO L348 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-01-06 11:42:24,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:42:24,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:24,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:1 [2021-01-06 11:42:24,859 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:42:24,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:24,866 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:42:24,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-01-06 11:42:24,890 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_159|], 6=[|v_#memory_int_184|]} [2021-01-06 11:42:24,894 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-01-06 11:42:24,895 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:24,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:24,907 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-06 11:42:24,908 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:24,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:24,987 INFO L348 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2021-01-06 11:42:24,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 102 [2021-01-06 11:42:24,990 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:25,036 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2021-01-06 11:42:25,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:25,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:25,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:42:25,042 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:48 [2021-01-06 11:42:25,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:25,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:25,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:25,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:25,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:42:25,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:25,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:42:25,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:25,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:42:25,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:42:25,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,115 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-01-06 11:42:25,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:25,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-01-06 11:42:25,137 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:25,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:42:25,180 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:42:25,180 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 112 [2021-01-06 11:42:25,184 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:42:25,257 INFO L625 ElimStorePlain]: treesize reduction 42, result has 71.2 percent of original size [2021-01-06 11:42:25,260 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-06 11:42:25,261 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:85 [2021-01-06 11:42:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 231 proven. 51 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-01-06 11:42:25,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:42:25,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-01-06 11:42:25,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730233711] [2021-01-06 11:42:25,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:42:25,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:42:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:42:25,579 INFO L87 Difference]: Start difference. First operand 3798 states and 6200 transitions. Second operand 13 states. [2021-01-06 11:42:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:48,214 INFO L93 Difference]: Finished difference Result 12181 states and 19263 transitions. [2021-01-06 11:42:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:42:48,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2021-01-06 11:42:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:48,236 INFO L225 Difference]: With dead ends: 12181 [2021-01-06 11:42:48,236 INFO L226 Difference]: Without dead ends: 8376 [2021-01-06 11:42:48,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-01-06 11:42:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8376 states. [2021-01-06 11:42:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8376 to 6099. [2021-01-06 11:42:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9839 transitions. [2021-01-06 11:42:48,514 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9839 transitions. Word has length 209 [2021-01-06 11:42:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:48,515 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9839 transitions. [2021-01-06 11:42:48,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:42:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9839 transitions. [2021-01-06 11:42:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 11:42:48,524 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:48,524 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:48,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:42:48,738 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash 836137251, now seen corresponding path program 1 times [2021-01-06 11:42:48,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:48,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359692959] [2021-01-06 11:42:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-01-06 11:42:48,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359692959] [2021-01-06 11:42:48,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:48,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:48,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87760176] [2021-01-06 11:42:48,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:48,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:48,864 INFO L87 Difference]: Start difference. First operand 6099 states and 9839 transitions. Second operand 4 states. [2021-01-06 11:42:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:49,516 INFO L93 Difference]: Finished difference Result 12354 states and 19921 transitions. [2021-01-06 11:42:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:49,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2021-01-06 11:42:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:49,532 INFO L225 Difference]: With dead ends: 12354 [2021-01-06 11:42:49,532 INFO L226 Difference]: Without dead ends: 6276 [2021-01-06 11:42:49,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2021-01-06 11:42:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 6099. [2021-01-06 11:42:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9825 transitions. [2021-01-06 11:42:49,753 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9825 transitions. Word has length 212 [2021-01-06 11:42:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:49,753 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9825 transitions. [2021-01-06 11:42:49,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9825 transitions. [2021-01-06 11:42:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 11:42:49,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:49,763 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:49,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-01-06 11:42:49,763 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1284368952, now seen corresponding path program 1 times [2021-01-06 11:42:49,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:49,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216973114] [2021-01-06 11:42:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-01-06 11:42:49,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216973114] [2021-01-06 11:42:49,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:49,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:49,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917644138] [2021-01-06 11:42:49,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:49,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:49,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:49,905 INFO L87 Difference]: Start difference. First operand 6099 states and 9825 transitions. Second operand 4 states. [2021-01-06 11:42:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:50,573 INFO L93 Difference]: Finished difference Result 12576 states and 20169 transitions. [2021-01-06 11:42:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:50,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2021-01-06 11:42:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:50,590 INFO L225 Difference]: With dead ends: 12576 [2021-01-06 11:42:50,591 INFO L226 Difference]: Without dead ends: 6498 [2021-01-06 11:42:50,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6498 states. [2021-01-06 11:42:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6498 to 6099. [2021-01-06 11:42:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9811 transitions. [2021-01-06 11:42:50,821 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9811 transitions. Word has length 212 [2021-01-06 11:42:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:50,822 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9811 transitions. [2021-01-06 11:42:50,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9811 transitions. [2021-01-06 11:42:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 11:42:50,831 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:50,832 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:50,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-01-06 11:42:50,832 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 932670371, now seen corresponding path program 1 times [2021-01-06 11:42:50,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:50,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844351501] [2021-01-06 11:42:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-01-06 11:42:50,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844351501] [2021-01-06 11:42:50,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:50,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:50,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222859351] [2021-01-06 11:42:50,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:50,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:50,944 INFO L87 Difference]: Start difference. First operand 6099 states and 9811 transitions. Second operand 4 states. [2021-01-06 11:42:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:51,504 INFO L93 Difference]: Finished difference Result 12354 states and 19865 transitions. [2021-01-06 11:42:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:51,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-06 11:42:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:51,517 INFO L225 Difference]: With dead ends: 12354 [2021-01-06 11:42:51,518 INFO L226 Difference]: Without dead ends: 6276 [2021-01-06 11:42:51,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2021-01-06 11:42:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 6099. [2021-01-06 11:42:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9797 transitions. [2021-01-06 11:42:51,737 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9797 transitions. Word has length 213 [2021-01-06 11:42:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:51,737 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9797 transitions. [2021-01-06 11:42:51,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9797 transitions. [2021-01-06 11:42:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 11:42:51,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:51,746 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:51,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-01-06 11:42:51,747 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1303373159, now seen corresponding path program 1 times [2021-01-06 11:42:51,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:51,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334856418] [2021-01-06 11:42:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-01-06 11:42:51,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334856418] [2021-01-06 11:42:51,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:51,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:51,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191361285] [2021-01-06 11:42:51,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:51,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:51,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:51,875 INFO L87 Difference]: Start difference. First operand 6099 states and 9797 transitions. Second operand 4 states. [2021-01-06 11:42:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:52,525 INFO L93 Difference]: Finished difference Result 12576 states and 20113 transitions. [2021-01-06 11:42:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:52,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-06 11:42:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:52,538 INFO L225 Difference]: With dead ends: 12576 [2021-01-06 11:42:52,538 INFO L226 Difference]: Without dead ends: 6498 [2021-01-06 11:42:52,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6498 states. [2021-01-06 11:42:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6498 to 6099. [2021-01-06 11:42:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9783 transitions. [2021-01-06 11:42:52,821 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9783 transitions. Word has length 213 [2021-01-06 11:42:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:52,821 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9783 transitions. [2021-01-06 11:42:52,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9783 transitions. [2021-01-06 11:42:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-01-06 11:42:52,830 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:52,831 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:52,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-01-06 11:42:52,831 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 989195624, now seen corresponding path program 1 times [2021-01-06 11:42:52,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:52,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941467485] [2021-01-06 11:42:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-01-06 11:42:52,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941467485] [2021-01-06 11:42:52,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:52,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:52,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79170293] [2021-01-06 11:42:52,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:52,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:52,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:52,955 INFO L87 Difference]: Start difference. First operand 6099 states and 9783 transitions. Second operand 4 states. [2021-01-06 11:42:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:53,503 INFO L93 Difference]: Finished difference Result 12310 states and 19759 transitions. [2021-01-06 11:42:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:53,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2021-01-06 11:42:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:53,513 INFO L225 Difference]: With dead ends: 12310 [2021-01-06 11:42:53,513 INFO L226 Difference]: Without dead ends: 6232 [2021-01-06 11:42:53,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2021-01-06 11:42:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 6099. [2021-01-06 11:42:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9769 transitions. [2021-01-06 11:42:53,801 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9769 transitions. Word has length 214 [2021-01-06 11:42:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:53,801 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9769 transitions. [2021-01-06 11:42:53,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9769 transitions. [2021-01-06 11:42:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-01-06 11:42:53,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:53,810 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:53,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-01-06 11:42:53,810 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash 638034548, now seen corresponding path program 1 times [2021-01-06 11:42:53,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:53,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808681261] [2021-01-06 11:42:53,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-01-06 11:42:53,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808681261] [2021-01-06 11:42:53,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:53,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:53,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754470149] [2021-01-06 11:42:53,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:53,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:53,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:53,968 INFO L87 Difference]: Start difference. First operand 6099 states and 9769 transitions. Second operand 4 states. [2021-01-06 11:42:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:54,657 INFO L93 Difference]: Finished difference Result 12576 states and 20057 transitions. [2021-01-06 11:42:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:54,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2021-01-06 11:42:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:54,666 INFO L225 Difference]: With dead ends: 12576 [2021-01-06 11:42:54,666 INFO L226 Difference]: Without dead ends: 6498 [2021-01-06 11:42:54,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6498 states. [2021-01-06 11:42:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6498 to 6099. [2021-01-06 11:42:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9755 transitions. [2021-01-06 11:42:54,856 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9755 transitions. Word has length 214 [2021-01-06 11:42:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:54,856 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9755 transitions. [2021-01-06 11:42:54,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9755 transitions. [2021-01-06 11:42:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-06 11:42:54,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:54,863 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:54,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-01-06 11:42:54,864 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1261579230, now seen corresponding path program 1 times [2021-01-06 11:42:54,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:54,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405852355] [2021-01-06 11:42:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-01-06 11:42:55,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405852355] [2021-01-06 11:42:55,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:55,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:55,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342426621] [2021-01-06 11:42:55,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:55,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:55,080 INFO L87 Difference]: Start difference. First operand 6099 states and 9755 transitions. Second operand 4 states. [2021-01-06 11:42:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:55,803 INFO L93 Difference]: Finished difference Result 12576 states and 20029 transitions. [2021-01-06 11:42:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:55,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2021-01-06 11:42:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:55,812 INFO L225 Difference]: With dead ends: 12576 [2021-01-06 11:42:55,812 INFO L226 Difference]: Without dead ends: 6498 [2021-01-06 11:42:55,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6498 states. [2021-01-06 11:42:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6498 to 6099. [2021-01-06 11:42:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9741 transitions. [2021-01-06 11:42:56,005 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9741 transitions. Word has length 215 [2021-01-06 11:42:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:56,005 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9741 transitions. [2021-01-06 11:42:56,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9741 transitions. [2021-01-06 11:42:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2021-01-06 11:42:56,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:56,012 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:56,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-01-06 11:42:56,012 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1525949775, now seen corresponding path program 1 times [2021-01-06 11:42:56,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:56,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278328544] [2021-01-06 11:42:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-01-06 11:42:56,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278328544] [2021-01-06 11:42:56,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:56,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:56,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732776632] [2021-01-06 11:42:56,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:56,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:56,143 INFO L87 Difference]: Start difference. First operand 6099 states and 9741 transitions. Second operand 4 states. [2021-01-06 11:42:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:56,767 INFO L93 Difference]: Finished difference Result 12506 states and 19917 transitions. [2021-01-06 11:42:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:56,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2021-01-06 11:42:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:56,775 INFO L225 Difference]: With dead ends: 12506 [2021-01-06 11:42:56,775 INFO L226 Difference]: Without dead ends: 6428 [2021-01-06 11:42:56,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2021-01-06 11:42:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 6099. [2021-01-06 11:42:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6099 states. [2021-01-06 11:42:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6099 states to 6099 states and 9727 transitions. [2021-01-06 11:42:56,976 INFO L78 Accepts]: Start accepts. Automaton has 6099 states and 9727 transitions. Word has length 216 [2021-01-06 11:42:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:56,976 INFO L481 AbstractCegarLoop]: Abstraction has 6099 states and 9727 transitions. [2021-01-06 11:42:56,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6099 states and 9727 transitions. [2021-01-06 11:42:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-01-06 11:42:56,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:56,981 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:56,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-01-06 11:42:56,981 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1548762091, now seen corresponding path program 1 times [2021-01-06 11:42:56,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:56,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517363941] [2021-01-06 11:42:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2021-01-06 11:42:57,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517363941] [2021-01-06 11:42:57,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:57,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:57,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68685414] [2021-01-06 11:42:57,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:57,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:57,134 INFO L87 Difference]: Start difference. First operand 6099 states and 9727 transitions. Second operand 4 states. [2021-01-06 11:42:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:58,012 INFO L93 Difference]: Finished difference Result 13404 states and 21320 transitions. [2021-01-06 11:42:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2021-01-06 11:42:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:58,019 INFO L225 Difference]: With dead ends: 13404 [2021-01-06 11:42:58,020 INFO L226 Difference]: Without dead ends: 7298 [2021-01-06 11:42:58,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7298 states. [2021-01-06 11:42:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7298 to 6372. [2021-01-06 11:42:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6372 states. [2021-01-06 11:42:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6372 states to 6372 states and 10224 transitions. [2021-01-06 11:42:58,190 INFO L78 Accepts]: Start accepts. Automaton has 6372 states and 10224 transitions. Word has length 218 [2021-01-06 11:42:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:58,190 INFO L481 AbstractCegarLoop]: Abstraction has 6372 states and 10224 transitions. [2021-01-06 11:42:58,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6372 states and 10224 transitions. [2021-01-06 11:42:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-01-06 11:42:58,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:58,196 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:58,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-01-06 11:42:58,196 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash -624343254, now seen corresponding path program 1 times [2021-01-06 11:42:58,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:58,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426187875] [2021-01-06 11:42:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-01-06 11:42:58,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426187875] [2021-01-06 11:42:58,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:58,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:42:58,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404915856] [2021-01-06 11:42:58,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:42:58,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:42:58,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:58,390 INFO L87 Difference]: Start difference. First operand 6372 states and 10224 transitions. Second operand 5 states. [2021-01-06 11:42:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:59,272 INFO L93 Difference]: Finished difference Result 13189 states and 21044 transitions. [2021-01-06 11:42:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:59,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2021-01-06 11:42:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:59,281 INFO L225 Difference]: With dead ends: 13189 [2021-01-06 11:42:59,281 INFO L226 Difference]: Without dead ends: 6810 [2021-01-06 11:42:59,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:42:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2021-01-06 11:42:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 3791. [2021-01-06 11:42:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3791 states. [2021-01-06 11:42:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 6130 transitions. [2021-01-06 11:42:59,479 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 6130 transitions. Word has length 219 [2021-01-06 11:42:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:59,479 INFO L481 AbstractCegarLoop]: Abstraction has 3791 states and 6130 transitions. [2021-01-06 11:42:59,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:42:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 6130 transitions. [2021-01-06 11:42:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-06 11:42:59,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:59,485 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:59,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-01-06 11:42:59,485 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1167711913, now seen corresponding path program 1 times [2021-01-06 11:42:59,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:59,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514680992] [2021-01-06 11:42:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 144 proven. 6 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2021-01-06 11:42:59,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514680992] [2021-01-06 11:42:59,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043750487] [2021-01-06 11:42:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:42:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:42:59,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:00,006 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:00,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:00,008 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,013 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,013 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:00,053 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:00,053 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:00,055 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,057 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:00,156 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 20 treesize of output 8 [2021-01-06 11:43:00,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,160 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2021-01-06 11:43:00,195 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:00,196 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,199 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:00,214 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_160|, |v_#memory_$Pointer$.offset_160|], 2=[|v_#memory_int_188|]} [2021-01-06 11:43:00,217 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-01-06 11:43:00,219 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:00,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,228 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-01-06 11:43:00,229 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:00,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,254 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,255 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:43:00,257 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,285 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:43:00,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:00,290 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:00,290 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:43:00,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:00,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:00,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:00,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:00,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:00,365 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:43:00,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:00,383 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:43:00,384 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,436 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:43:00,441 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:00,441 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:43:00,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:00,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:00,530 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:00,532 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,536 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:00,536 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:00,540 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:00,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:00,545 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:00,545 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:43:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 138 proven. 108 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-01-06 11:43:00,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:00,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2021-01-06 11:43:00,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866693189] [2021-01-06 11:43:00,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:43:00,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:43:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:43:00,673 INFO L87 Difference]: Start difference. First operand 3791 states and 6130 transitions. Second operand 13 states. [2021-01-06 11:43:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:04,731 INFO L93 Difference]: Finished difference Result 8911 states and 14035 transitions. [2021-01-06 11:43:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:43:04,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 232 [2021-01-06 11:43:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:04,737 INFO L225 Difference]: With dead ends: 8911 [2021-01-06 11:43:04,738 INFO L226 Difference]: Without dead ends: 5141 [2021-01-06 11:43:04,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-01-06 11:43:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2021-01-06 11:43:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 3791. [2021-01-06 11:43:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3791 states. [2021-01-06 11:43:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 6075 transitions. [2021-01-06 11:43:04,932 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 6075 transitions. Word has length 232 [2021-01-06 11:43:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:04,933 INFO L481 AbstractCegarLoop]: Abstraction has 3791 states and 6075 transitions. [2021-01-06 11:43:04,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:43:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 6075 transitions. [2021-01-06 11:43:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-01-06 11:43:04,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:04,938 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:05,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:05,139 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -66998368, now seen corresponding path program 1 times [2021-01-06 11:43:05,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:05,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152168175] [2021-01-06 11:43:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2021-01-06 11:43:05,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152168175] [2021-01-06 11:43:05,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596545919] [2021-01-06 11:43:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:05,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:43:05,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:05,655 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:05,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:05,657 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,662 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:05,698 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:05,699 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:05,701 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,704 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:05,796 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 20 treesize of output 8 [2021-01-06 11:43:05,797 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,799 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2021-01-06 11:43:05,832 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:05,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,835 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:05,850 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_161|, |v_#memory_$Pointer$.offset_161|], 2=[|v_#memory_int_192|]} [2021-01-06 11:43:05,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-01-06 11:43:05,854 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:05,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,864 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-01-06 11:43:05,868 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:05,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:05,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:43:05,898 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:05,930 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:43:05,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:05,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:05,934 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:43:05,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:05,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:05,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:05,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:05,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:06,014 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:06,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:43:06,017 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:06,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:06,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:43:06,028 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:06,084 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:43:06,087 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:06,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:43:06,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:06,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:06,175 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:06,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:06,188 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:06,189 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:06,191 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:06,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:06,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:06,196 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:43:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 139 proven. 107 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-01-06 11:43:06,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:06,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2021-01-06 11:43:06,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725796287] [2021-01-06 11:43:06,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:43:06,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:43:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:43:06,326 INFO L87 Difference]: Start difference. First operand 3791 states and 6075 transitions. Second operand 13 states. [2021-01-06 11:43:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:10,159 INFO L93 Difference]: Finished difference Result 8743 states and 13652 transitions. [2021-01-06 11:43:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:43:10,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2021-01-06 11:43:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:10,167 INFO L225 Difference]: With dead ends: 8743 [2021-01-06 11:43:10,168 INFO L226 Difference]: Without dead ends: 4973 [2021-01-06 11:43:10,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-01-06 11:43:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2021-01-06 11:43:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 3791. [2021-01-06 11:43:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3791 states. [2021-01-06 11:43:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 6020 transitions. [2021-01-06 11:43:10,334 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 6020 transitions. Word has length 233 [2021-01-06 11:43:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:10,334 INFO L481 AbstractCegarLoop]: Abstraction has 3791 states and 6020 transitions. [2021-01-06 11:43:10,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:43:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 6020 transitions. [2021-01-06 11:43:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-01-06 11:43:10,338 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:10,338 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:43:10,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:10,552 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:10,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1284472874, now seen corresponding path program 1 times [2021-01-06 11:43:10,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:10,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212966146] [2021-01-06 11:43:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 286 proven. 17 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-01-06 11:43:11,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212966146] [2021-01-06 11:43:11,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398726251] [2021-01-06 11:43:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:11,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 11:43:11,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:11,446 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:11,446 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:11,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:11,502 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:11,502 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:11,504 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,507 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,507 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:11,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:11,596 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,599 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:11,695 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|, |v_#memory_$Pointer$.offset_162|], 12=[|v_#memory_int_196|]} [2021-01-06 11:43:11,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:11,701 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 51 treesize of output 35 [2021-01-06 11:43:11,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:11,725 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 51 treesize of output 35 [2021-01-06 11:43:11,726 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,788 INFO L348 Elim1Store]: treesize reduction 136, result has 30.3 percent of original size [2021-01-06 11:43:11,788 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 5 case distinctions, treesize of input 50 treesize of output 74 [2021-01-06 11:43:11,791 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:11,807 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:11,807 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:69 [2021-01-06 11:43:12,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:12,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:12,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:43:12,044 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_163|, |v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_int_197|]} [2021-01-06 11:43:12,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,060 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 57 treesize of output 35 [2021-01-06 11:43:12,061 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,077 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 47 treesize of output 31 [2021-01-06 11:43:12,078 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,158 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 47 treesize of output 31 [2021-01-06 11:43:12,160 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,168 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 59 treesize of output 37 [2021-01-06 11:43:12,170 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:12,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,240 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 0 case distinctions, treesize of input 59 treesize of output 49 [2021-01-06 11:43:12,244 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:12,266 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:12,266 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 2 case distinctions, treesize of input 59 treesize of output 77 [2021-01-06 11:43:12,269 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,298 INFO L625 ElimStorePlain]: treesize reduction 113, result has 26.1 percent of original size [2021-01-06 11:43:12,299 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,299 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:217, output treesize:40 [2021-01-06 11:43:12,351 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 12=[|v_#memory_int_198|]} [2021-01-06 11:43:12,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2021-01-06 11:43:12,356 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:12,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:12,372 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 41 treesize of output 23 [2021-01-06 11:43:12,374 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:12,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:12,508 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 11:43:12,509 INFO L348 Elim1Store]: treesize reduction 12, result has 90.8 percent of original size [2021-01-06 11:43:12,509 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 5 case distinctions, treesize of input 41 treesize of output 137 [2021-01-06 11:43:12,512 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,547 INFO L625 ElimStorePlain]: treesize reduction 82, result has 25.5 percent of original size [2021-01-06 11:43:12,549 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:12,549 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:28 [2021-01-06 11:43:12,678 INFO L348 Elim1Store]: treesize reduction 54, result has 56.1 percent of original size [2021-01-06 11:43:12,679 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 5 case distinctions, treesize of input 41 treesize of output 87 [2021-01-06 11:43:12,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:12,705 INFO L625 ElimStorePlain]: treesize reduction 41, result has 40.6 percent of original size [2021-01-06 11:43:12,706 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:12,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2021-01-06 11:43:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 305 proven. 113 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-01-06 11:43:13,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:13,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2021-01-06 11:43:13,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78998073] [2021-01-06 11:43:13,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 11:43:13,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 11:43:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-01-06 11:43:13,084 INFO L87 Difference]: Start difference. First operand 3791 states and 6020 transitions. Second operand 23 states. [2021-01-06 11:43:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:23,635 INFO L93 Difference]: Finished difference Result 12488 states and 19272 transitions. [2021-01-06 11:43:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-06 11:43:23,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 237 [2021-01-06 11:43:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:23,645 INFO L225 Difference]: With dead ends: 12488 [2021-01-06 11:43:23,645 INFO L226 Difference]: Without dead ends: 8718 [2021-01-06 11:43:23,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=1624, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 11:43:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8718 states. [2021-01-06 11:43:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8718 to 3999. [2021-01-06 11:43:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2021-01-06 11:43:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 6375 transitions. [2021-01-06 11:43:23,850 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 6375 transitions. Word has length 237 [2021-01-06 11:43:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:23,850 INFO L481 AbstractCegarLoop]: Abstraction has 3999 states and 6375 transitions. [2021-01-06 11:43:23,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 11:43:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 6375 transitions. [2021-01-06 11:43:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-01-06 11:43:23,856 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:23,856 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-01-06 11:43:24,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2021-01-06 11:43:24,072 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1088573054, now seen corresponding path program 1 times [2021-01-06 11:43:24,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:24,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133335482] [2021-01-06 11:43:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 379 proven. 54 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:43:24,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133335482] [2021-01-06 11:43:24,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522224630] [2021-01-06 11:43:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:24,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:43:24,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:24,696 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:24,696 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:24,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:24,742 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:24,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:24,745 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,747 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:24,817 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 20 treesize of output 8 [2021-01-06 11:43:24,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,820 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2021-01-06 11:43:24,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:24,863 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:24,890 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.base_165|], 2=[|v_#memory_int_202|]} [2021-01-06 11:43:24,893 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-01-06 11:43:24,895 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:24,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-06 11:43:24,907 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:24,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,941 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:24,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:43:24,944 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:24,975 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:43:24,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:24,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:24,978 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:43:24,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:25,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:25,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:25,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:25,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:25,070 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:25,071 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:43:25,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:25,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:25,085 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:43:25,087 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:25,149 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:43:25,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:25,156 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:43:25,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:25,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:25,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:25,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:25,277 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:25,277 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:25,279 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:25,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:25,284 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:25,284 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:43:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 362 proven. 71 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:43:25,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:25,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2021-01-06 11:43:25,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76803129] [2021-01-06 11:43:25,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 11:43:25,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 11:43:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:43:25,504 INFO L87 Difference]: Start difference. First operand 3999 states and 6375 transitions. Second operand 16 states. [2021-01-06 11:43:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:32,137 INFO L93 Difference]: Finished difference Result 11094 states and 17163 transitions. [2021-01-06 11:43:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 11:43:32,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2021-01-06 11:43:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:32,146 INFO L225 Difference]: With dead ends: 11094 [2021-01-06 11:43:32,146 INFO L226 Difference]: Without dead ends: 7116 [2021-01-06 11:43:32,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 11:43:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7116 states. [2021-01-06 11:43:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7116 to 4006. [2021-01-06 11:43:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4006 states. [2021-01-06 11:43:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 6376 transitions. [2021-01-06 11:43:32,348 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 6376 transitions. Word has length 249 [2021-01-06 11:43:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:32,348 INFO L481 AbstractCegarLoop]: Abstraction has 4006 states and 6376 transitions. [2021-01-06 11:43:32,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 11:43:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 6376 transitions. [2021-01-06 11:43:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-01-06 11:43:32,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:32,354 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-01-06 11:43:32,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:32,570 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash -783801876, now seen corresponding path program 1 times [2021-01-06 11:43:32,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:32,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8269259] [2021-01-06 11:43:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-01-06 11:43:32,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8269259] [2021-01-06 11:43:32,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:32,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:43:32,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147608735] [2021-01-06 11:43:32,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:43:32,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:43:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:43:32,891 INFO L87 Difference]: Start difference. First operand 4006 states and 6376 transitions. Second operand 7 states. [2021-01-06 11:43:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:35,818 INFO L93 Difference]: Finished difference Result 11252 states and 17510 transitions. [2021-01-06 11:43:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:43:35,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2021-01-06 11:43:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:35,827 INFO L225 Difference]: With dead ends: 11252 [2021-01-06 11:43:35,827 INFO L226 Difference]: Without dead ends: 7241 [2021-01-06 11:43:35,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:43:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2021-01-06 11:43:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 4286. [2021-01-06 11:43:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2021-01-06 11:43:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 6859 transitions. [2021-01-06 11:43:35,999 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 6859 transitions. Word has length 250 [2021-01-06 11:43:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:35,999 INFO L481 AbstractCegarLoop]: Abstraction has 4286 states and 6859 transitions. [2021-01-06 11:43:35,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:43:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 6859 transitions. [2021-01-06 11:43:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-01-06 11:43:36,003 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:36,003 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:43:36,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-01-06 11:43:36,003 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:36,004 INFO L82 PathProgramCache]: Analyzing trace with hash 769294694, now seen corresponding path program 1 times [2021-01-06 11:43:36,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:36,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537359616] [2021-01-06 11:43:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2021-01-06 11:43:36,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537359616] [2021-01-06 11:43:36,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:36,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:36,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907336627] [2021-01-06 11:43:36,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:36,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:36,161 INFO L87 Difference]: Start difference. First operand 4286 states and 6859 transitions. Second operand 4 states. [2021-01-06 11:43:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:36,907 INFO L93 Difference]: Finished difference Result 8816 states and 14010 transitions. [2021-01-06 11:43:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:36,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2021-01-06 11:43:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:36,913 INFO L225 Difference]: With dead ends: 8816 [2021-01-06 11:43:36,913 INFO L226 Difference]: Without dead ends: 4537 [2021-01-06 11:43:36,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2021-01-06 11:43:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4278. [2021-01-06 11:43:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4278 states. [2021-01-06 11:43:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6844 transitions. [2021-01-06 11:43:37,112 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6844 transitions. Word has length 252 [2021-01-06 11:43:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:37,112 INFO L481 AbstractCegarLoop]: Abstraction has 4278 states and 6844 transitions. [2021-01-06 11:43:37,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6844 transitions. [2021-01-06 11:43:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 11:43:37,117 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:37,118 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:43:37,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-01-06 11:43:37,118 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1024130447, now seen corresponding path program 1 times [2021-01-06 11:43:37,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:37,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508587828] [2021-01-06 11:43:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2021-01-06 11:43:37,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508587828] [2021-01-06 11:43:37,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:37,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:43:37,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175564976] [2021-01-06 11:43:37,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:43:37,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:43:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:37,320 INFO L87 Difference]: Start difference. First operand 4278 states and 6844 transitions. Second operand 5 states. [2021-01-06 11:43:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:38,233 INFO L93 Difference]: Finished difference Result 8999 states and 14275 transitions. [2021-01-06 11:43:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:38,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2021-01-06 11:43:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:38,239 INFO L225 Difference]: With dead ends: 8999 [2021-01-06 11:43:38,239 INFO L226 Difference]: Without dead ends: 4736 [2021-01-06 11:43:38,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:43:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2021-01-06 11:43:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4032. [2021-01-06 11:43:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2021-01-06 11:43:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 6399 transitions. [2021-01-06 11:43:38,409 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 6399 transitions. Word has length 253 [2021-01-06 11:43:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:38,409 INFO L481 AbstractCegarLoop]: Abstraction has 4032 states and 6399 transitions. [2021-01-06 11:43:38,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:43:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 6399 transitions. [2021-01-06 11:43:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-01-06 11:43:38,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:38,413 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:38,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-01-06 11:43:38,414 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1335699359, now seen corresponding path program 1 times [2021-01-06 11:43:38,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:38,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721078855] [2021-01-06 11:43:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-01-06 11:43:38,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721078855] [2021-01-06 11:43:38,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749294144] [2021-01-06 11:43:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:38,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:43:38,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:39,024 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:39,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:39,025 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:39,070 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:39,070 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:39,072 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,074 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:39,172 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 20 treesize of output 8 [2021-01-06 11:43:39,173 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2021-01-06 11:43:39,211 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:39,211 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:39,230 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|, |v_#memory_$Pointer$.base_166|], 2=[|v_#memory_int_206|]} [2021-01-06 11:43:39,233 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-01-06 11:43:39,237 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:39,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,250 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-06 11:43:39,251 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:39,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,290 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,290 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:43:39,292 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,328 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:43:39,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:39,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:39,331 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:43:39,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:39,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:39,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:39,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:39,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:39,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:43:39,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:39,428 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:43:39,432 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,488 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:43:39,491 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:39,492 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:43:39,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:39,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:39,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:39,575 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,579 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:39,579 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:39,581 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:39,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:39,587 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:39,588 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:43:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 298 proven. 110 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2021-01-06 11:43:39,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:39,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2021-01-06 11:43:39,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674714207] [2021-01-06 11:43:39,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:43:39,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:43:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:43:39,723 INFO L87 Difference]: Start difference. First operand 4032 states and 6399 transitions. Second operand 13 states. [2021-01-06 11:43:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:43,509 INFO L93 Difference]: Finished difference Result 10011 states and 15685 transitions. [2021-01-06 11:43:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 11:43:43,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 260 [2021-01-06 11:43:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:43,517 INFO L225 Difference]: With dead ends: 10011 [2021-01-06 11:43:43,517 INFO L226 Difference]: Without dead ends: 6000 [2021-01-06 11:43:43,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-01-06 11:43:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2021-01-06 11:43:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 4214. [2021-01-06 11:43:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4214 states. [2021-01-06 11:43:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 6653 transitions. [2021-01-06 11:43:43,706 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 6653 transitions. Word has length 260 [2021-01-06 11:43:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:43,706 INFO L481 AbstractCegarLoop]: Abstraction has 4214 states and 6653 transitions. [2021-01-06 11:43:43,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:43:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 6653 transitions. [2021-01-06 11:43:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 11:43:43,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:43,711 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:43,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:43,916 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -752619464, now seen corresponding path program 1 times [2021-01-06 11:43:43,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:43,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052705461] [2021-01-06 11:43:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:44,762 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2021-01-06 11:43:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 339 proven. 297 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 11:43:45,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052705461] [2021-01-06 11:43:45,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873667370] [2021-01-06 11:43:45,795 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:43:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:46,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 11:43:46,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:43:46,100 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:43:46,101 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:43:46,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,108 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2021-01-06 11:43:46,159 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:46,160 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:46,161 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,164 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2021-01-06 11:43:46,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-01-06 11:43:46,325 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 24 treesize of output 16 [2021-01-06 11:43:46,326 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,329 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,331 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,332 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2021-01-06 11:43:46,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:43:46,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,389 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:43:46,421 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_167|, |v_#memory_$Pointer$.offset_167|], 2=[|v_#memory_int_210|]} [2021-01-06 11:43:46,424 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-01-06 11:43:46,425 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:46,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-01-06 11:43:46,437 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:46,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,470 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,471 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2021-01-06 11:43:46,473 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,505 INFO L625 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2021-01-06 11:43:46,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:46,508 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:43:46,508 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-01-06 11:43:46,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:46,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:46,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:43:46,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:46,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:46,576 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 11:43:46,577 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:46,617 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,617 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2021-01-06 11:43:46,620 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,680 INFO L625 ElimStorePlain]: treesize reduction 31, result has 65.2 percent of original size [2021-01-06 11:43:46,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:46,687 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2021-01-06 11:43:46,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:43:46,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:43:46,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 [2021-01-06 11:43:46,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,793 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:43:46,794 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-01-06 11:43:46,796 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:43:46,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:43:46,802 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 11:43:46,802 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2021-01-06 11:43:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 300 proven. 109 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-01-06 11:43:46,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:43:46,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-01-06 11:43:46,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971395966] [2021-01-06 11:43:46,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 11:43:46,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 11:43:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-01-06 11:43:46,987 INFO L87 Difference]: Start difference. First operand 4214 states and 6653 transitions. Second operand 22 states. [2021-01-06 11:43:59,982 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2021-01-06 11:44:00,820 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2021-01-06 11:44:01,937 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-01-06 11:44:02,802 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-01-06 11:44:04,808 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-01-06 11:44:05,044 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-01-06 11:44:06,884 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-01-06 11:44:07,210 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-01-06 11:44:07,567 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-01-06 11:44:08,060 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2021-01-06 11:44:08,600 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-01-06 11:44:09,242 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-06 11:44:09,714 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2021-01-06 11:44:10,429 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-01-06 11:44:11,627 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-01-06 11:44:13,013 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2021-01-06 11:44:13,217 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-01-06 11:44:13,829 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2021-01-06 11:44:14,420 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-01-06 11:44:14,605 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-06 11:44:15,370 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2021-01-06 11:44:16,112 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2021-01-06 11:44:16,356 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-01-06 11:44:17,034 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-01-06 11:44:18,061 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-01-06 11:44:18,229 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2021-01-06 11:44:19,965 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2021-01-06 11:44:20,428 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2021-01-06 11:44:20,687 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-01-06 11:44:21,238 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-01-06 11:44:22,307 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-01-06 11:44:22,542 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-06 11:44:25,580 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-01-06 11:44:25,857 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2021-01-06 11:44:26,435 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-01-06 11:44:26,716 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2021-01-06 11:44:27,814 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-01-06 11:44:28,038 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2021-01-06 11:44:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:30,874 INFO L93 Difference]: Finished difference Result 25960 states and 39509 transitions. [2021-01-06 11:44:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-01-06 11:44:30,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 261 [2021-01-06 11:44:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:30,896 INFO L225 Difference]: With dead ends: 25960 [2021-01-06 11:44:30,897 INFO L226 Difference]: Without dead ends: 21767 [2021-01-06 11:44:30,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 283 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4569 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1803, Invalid=12239, Unknown=0, NotChecked=0, Total=14042 [2021-01-06 11:44:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21767 states. [2021-01-06 11:44:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21767 to 8487. [2021-01-06 11:44:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8487 states. [2021-01-06 11:44:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 13170 transitions. [2021-01-06 11:44:31,493 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 13170 transitions. Word has length 261 [2021-01-06 11:44:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:31,493 INFO L481 AbstractCegarLoop]: Abstraction has 8487 states and 13170 transitions. [2021-01-06 11:44:31,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 11:44:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 13170 transitions. [2021-01-06 11:44:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 11:44:31,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:31,500 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:31,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:44:31,704 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1475487551, now seen corresponding path program 2 times [2021-01-06 11:44:31,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:31,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846950410] [2021-01-06 11:44:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 375 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-01-06 11:44:32,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846950410] [2021-01-06 11:44:32,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321324928] [2021-01-06 11:44:32,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:44:32,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 11:44:32,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:44:32,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 11:44:33,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:44:33,210 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_212|], 2=[|v_#memory_$Pointer$.base_169|, |v_#memory_$Pointer$.base_168|, |v_#memory_$Pointer$.offset_168|, |v_#memory_$Pointer$.offset_169|]} [2021-01-06 11:44:33,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,365 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-01-06 11:44:33,366 INFO L348 Elim1Store]: treesize reduction 34, result has 78.6 percent of original size [2021-01-06 11:44:33,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 134 [2021-01-06 11:44:33,373 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:44:33,629 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-01-06 11:44:33,630 INFO L625 ElimStorePlain]: treesize reduction 44, result has 83.3 percent of original size [2021-01-06 11:44:33,673 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:33,673 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 173 treesize of output 185 [2021-01-06 11:44:33,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-06 11:44:33,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:44:33,680 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-06 11:44:33,972 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2021-01-06 11:44:33,973 INFO L625 ElimStorePlain]: treesize reduction 71, result has 77.2 percent of original size [2021-01-06 11:44:33,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:44:33,984 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 212 treesize of output 166 [2021-01-06 11:44:33,987 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-01-06 11:44:34,124 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-06 11:44:34,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:44:34,129 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-01-06 11:44:34,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:44:34,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 11:44:34,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342198004] [2021-01-06 11:44:34,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:44:34,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:44:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:44:34,131 INFO L87 Difference]: Start difference. First operand 8487 states and 13170 transitions. Second operand 7 states. [2021-01-06 11:44:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 11:44:34,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:44:34,337 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7baa554f at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateAllErrorsAtOnce(TraceAbstractionStarter.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-01-06 11:44:34,342 INFO L168 Benchmark]: Toolchain (without parser) took 179388.83 ms. Allocated memory was 155.2 MB in the beginning and 1.0 GB in the end (delta: 882.9 MB). Free memory was 128.6 MB in the beginning and 462.0 MB in the end (delta: -333.4 MB). Peak memory consumption was 550.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,342 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 155.2 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:44:34,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1074.78 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 130.4 MB in the end (delta: -2.2 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.17 ms. Allocated memory is still 155.2 MB. Free memory was 130.4 MB in the beginning and 125.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,343 INFO L168 Benchmark]: Boogie Preprocessor took 102.63 ms. Allocated memory is still 155.2 MB. Free memory was 125.7 MB in the beginning and 118.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,343 INFO L168 Benchmark]: RCFGBuilder took 1642.73 ms. Allocated memory was 155.2 MB in the beginning and 207.6 MB in the end (delta: 52.4 MB). Free memory was 118.8 MB in the beginning and 161.2 MB in the end (delta: -42.4 MB). Peak memory consumption was 75.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,343 INFO L168 Benchmark]: TraceAbstraction took 176443.77 ms. Allocated memory was 207.6 MB in the beginning and 1.0 GB in the end (delta: 830.5 MB). Free memory was 160.7 MB in the beginning and 462.0 MB in the end (delta: -301.3 MB). Peak memory consumption was 529.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:44:34,345 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.21 ms. Allocated memory is still 155.2 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1074.78 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 130.4 MB in the end (delta: -2.2 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 112.17 ms. Allocated memory is still 155.2 MB. Free memory was 130.4 MB in the beginning and 125.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 102.63 ms. Allocated memory is still 155.2 MB. Free memory was 125.7 MB in the beginning and 118.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1642.73 ms. Allocated memory was 155.2 MB in the beginning and 207.6 MB in the end (delta: 52.4 MB). Free memory was 118.8 MB in the beginning and 161.2 MB in the end (delta: -42.4 MB). Peak memory consumption was 75.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 176443.77 ms. Allocated memory was 207.6 MB in the beginning and 1.0 GB in the end (delta: 830.5 MB). Free memory was 160.7 MB in the beginning and 462.0 MB in the end (delta: -301.3 MB). Peak memory consumption was 529.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7baa554f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7baa554f: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...