/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.16.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:44:25,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:44:25,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:44:25,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:44:25,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:44:25,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:44:25,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:44:25,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:44:25,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:44:25,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:44:25,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:44:25,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:44:25,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:44:25,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:44:25,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:44:25,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:44:25,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:44:25,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:44:25,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:44:25,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:44:25,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:44:25,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:44:25,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:44:25,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:44:25,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:44:25,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:44:25,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:44:25,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:44:25,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:44:25,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:44:25,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:44:25,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:44:25,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:44:25,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:44:25,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:44:25,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:44:25,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:44:25,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:44:25,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:44:25,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:44:25,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:44:25,685 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:44:25,715 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:44:25,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:44:25,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:44:25,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:44:25,719 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:44:25,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:44:25,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:44:25,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:44:25,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:44:25,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:44:25,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:44:25,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:44:25,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:44:25,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:44:25,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:44:25,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:44:25,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:44:25,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:44:25,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:44:25,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:44:25,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:44:25,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:44:25,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:44:25,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:44:25,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:44:25,725 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:44:26,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:44:26,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:44:26,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:44:26,227 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:44:26,227 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:44:26,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2021-01-06 11:44:26,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d776ae767/945fb120969f4454abe6369c707e4697/FLAGa246be0e3 [2021-01-06 11:44:27,061 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:44:27,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2021-01-06 11:44:27,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d776ae767/945fb120969f4454abe6369c707e4697/FLAGa246be0e3 [2021-01-06 11:44:27,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d776ae767/945fb120969f4454abe6369c707e4697 [2021-01-06 11:44:27,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:44:27,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:44:27,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:44:27,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:44:27,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:44:27,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:44:27" (1/1) ... [2021-01-06 11:44:27,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44149d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:27, skipping insertion in model container [2021-01-06 11:44:27,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:44:27" (1/1) ... [2021-01-06 11:44:27,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:44:27,343 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: 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:44:27,876 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.16.i.cil-1.c[76197,76210] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:44:27,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:44:27,939 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: 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:44:28,099 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.16.i.cil-1.c[76197,76210] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:44:28,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:44:28,131 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:44:28,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28 WrapperNode [2021-01-06 11:44:28,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:44:28,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:44:28,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:44:28,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:44:28,144 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:44:28" (1/1) ... [2021-01-06 11:44:28,174 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:44:28" (1/1) ... [2021-01-06 11:44:28,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:44:28,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:44:28,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:44:28,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:44:28,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (1/1) ... [2021-01-06 11:44:28,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:44:28,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:44:28,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:44:28,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:44:28,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (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:44:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:44:28,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:44:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:44:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:44:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:44:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:44:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:44:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:44:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:44:29,068 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:44:30,046 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:44:30,046 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:44:30,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:44:30,057 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:44:30,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:44:30 BoogieIcfgContainer [2021-01-06 11:44:30,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:44:30,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:44:30,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:44:30,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:44:30,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:44:27" (1/3) ... [2021-01-06 11:44:30,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e77ca7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:44:30, skipping insertion in model container [2021-01-06 11:44:30,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:44:28" (2/3) ... [2021-01-06 11:44:30,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e77ca7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:44:30, skipping insertion in model container [2021-01-06 11:44:30,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:44:30" (3/3) ... [2021-01-06 11:44:30,068 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2021-01-06 11:44:30,075 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:44:30,080 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:44:30,098 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:44:30,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:44:30,127 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:44:30,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:44:30,128 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:44:30,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:44:30,128 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:44:30,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:44:30,128 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:44:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2021-01-06 11:44:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 11:44:30,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:30,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:30,160 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 102131673, now seen corresponding path program 1 times [2021-01-06 11:44:30,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:30,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125080568] [2021-01-06 11:44:30,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:30,681 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:44:30,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125080568] [2021-01-06 11:44:30,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:30,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:30,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560619969] [2021-01-06 11:44:30,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:30,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:30,711 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2021-01-06 11:44:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:31,345 INFO L93 Difference]: Finished difference Result 339 states and 579 transitions. [2021-01-06 11:44:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:31,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2021-01-06 11:44:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:31,361 INFO L225 Difference]: With dead ends: 339 [2021-01-06 11:44:31,361 INFO L226 Difference]: Without dead ends: 171 [2021-01-06 11:44:31,365 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:44:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-01-06 11:44:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2021-01-06 11:44:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 242 transitions. [2021-01-06 11:44:31,417 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 242 transitions. Word has length 43 [2021-01-06 11:44:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:31,417 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 242 transitions. [2021-01-06 11:44:31,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 242 transitions. [2021-01-06 11:44:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:44:31,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:31,421 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:31,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:44:31,421 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 862077968, now seen corresponding path program 1 times [2021-01-06 11:44:31,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:31,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477515270] [2021-01-06 11:44:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:31,592 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:44:31,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477515270] [2021-01-06 11:44:31,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:31,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:31,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598280105] [2021-01-06 11:44:31,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:31,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:31,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:31,597 INFO L87 Difference]: Start difference. First operand 154 states and 242 transitions. Second operand 4 states. [2021-01-06 11:44:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:32,158 INFO L93 Difference]: Finished difference Result 306 states and 475 transitions. [2021-01-06 11:44:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:32,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 11:44:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:32,162 INFO L225 Difference]: With dead ends: 306 [2021-01-06 11:44:32,162 INFO L226 Difference]: Without dead ends: 171 [2021-01-06 11:44:32,164 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:44:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-01-06 11:44:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2021-01-06 11:44:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2021-01-06 11:44:32,179 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 56 [2021-01-06 11:44:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:32,180 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2021-01-06 11:44:32,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2021-01-06 11:44:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:44:32,183 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:32,183 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:32,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:44:32,184 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1995784866, now seen corresponding path program 1 times [2021-01-06 11:44:32,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:32,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300352791] [2021-01-06 11:44:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:32,306 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:44:32,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300352791] [2021-01-06 11:44:32,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:32,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:32,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952348464] [2021-01-06 11:44:32,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:32,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:32,314 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand 4 states. [2021-01-06 11:44:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:32,835 INFO L93 Difference]: Finished difference Result 305 states and 473 transitions. [2021-01-06 11:44:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:32,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 11:44:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:32,840 INFO L225 Difference]: With dead ends: 305 [2021-01-06 11:44:32,840 INFO L226 Difference]: Without dead ends: 170 [2021-01-06 11:44:32,841 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:44:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-01-06 11:44:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2021-01-06 11:44:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2021-01-06 11:44:32,854 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 57 [2021-01-06 11:44:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:32,855 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2021-01-06 11:44:32,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2021-01-06 11:44:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:44:32,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:32,864 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:32,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:44:32,865 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1027351245, now seen corresponding path program 1 times [2021-01-06 11:44:32,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:32,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571842482] [2021-01-06 11:44:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:33,018 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:44:33,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571842482] [2021-01-06 11:44:33,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:33,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:33,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717341928] [2021-01-06 11:44:33,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:33,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:33,021 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand 4 states. [2021-01-06 11:44:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:33,438 INFO L93 Difference]: Finished difference Result 303 states and 470 transitions. [2021-01-06 11:44:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:33,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 11:44:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:33,440 INFO L225 Difference]: With dead ends: 303 [2021-01-06 11:44:33,440 INFO L226 Difference]: Without dead ends: 168 [2021-01-06 11:44:33,441 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:44:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-06 11:44:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-01-06 11:44:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2021-01-06 11:44:33,451 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 57 [2021-01-06 11:44:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:33,451 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2021-01-06 11:44:33,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2021-01-06 11:44:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:44:33,453 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:33,454 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:33,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:44:33,454 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1264395763, now seen corresponding path program 1 times [2021-01-06 11:44:33,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:33,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578801333] [2021-01-06 11:44:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:33,546 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:44:33,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578801333] [2021-01-06 11:44:33,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:33,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:33,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58645270] [2021-01-06 11:44:33,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:33,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:33,549 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand 4 states. [2021-01-06 11:44:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:33,971 INFO L93 Difference]: Finished difference Result 302 states and 468 transitions. [2021-01-06 11:44:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:33,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 11:44:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:33,973 INFO L225 Difference]: With dead ends: 302 [2021-01-06 11:44:33,973 INFO L226 Difference]: Without dead ends: 167 [2021-01-06 11:44:33,974 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:44:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-06 11:44:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2021-01-06 11:44:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2021-01-06 11:44:33,983 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 57 [2021-01-06 11:44:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:33,983 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2021-01-06 11:44:33,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2021-01-06 11:44:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:44:33,985 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:33,985 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:33,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:44:33,985 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash -412278986, now seen corresponding path program 1 times [2021-01-06 11:44:33,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:33,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895563307] [2021-01-06 11:44:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:34,052 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:44:34,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895563307] [2021-01-06 11:44:34,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:34,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:34,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609757529] [2021-01-06 11:44:34,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:34,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:34,055 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand 4 states. [2021-01-06 11:44:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:34,447 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2021-01-06 11:44:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:34,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 11:44:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:34,449 INFO L225 Difference]: With dead ends: 302 [2021-01-06 11:44:34,449 INFO L226 Difference]: Without dead ends: 167 [2021-01-06 11:44:34,450 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:44:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-06 11:44:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2021-01-06 11:44:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 237 transitions. [2021-01-06 11:44:34,457 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 237 transitions. Word has length 57 [2021-01-06 11:44:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:34,457 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 237 transitions. [2021-01-06 11:44:34,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 237 transitions. [2021-01-06 11:44:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 11:44:34,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:34,459 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:34,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:44:34,459 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 728780505, now seen corresponding path program 1 times [2021-01-06 11:44:34,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:34,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756043273] [2021-01-06 11:44:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:34,519 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:44:34,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756043273] [2021-01-06 11:44:34,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:34,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:34,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47160083] [2021-01-06 11:44:34,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:34,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:34,522 INFO L87 Difference]: Start difference. First operand 154 states and 237 transitions. Second operand 4 states. [2021-01-06 11:44:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:34,933 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2021-01-06 11:44:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:34,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 11:44:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:34,938 INFO L225 Difference]: With dead ends: 302 [2021-01-06 11:44:34,939 INFO L226 Difference]: Without dead ends: 167 [2021-01-06 11:44:34,940 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:44:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-06 11:44:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2021-01-06 11:44:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2021-01-06 11:44:34,948 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 58 [2021-01-06 11:44:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:34,949 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2021-01-06 11:44:34,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2021-01-06 11:44:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:44:34,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:34,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:34,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:44:34,952 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1288318245, now seen corresponding path program 1 times [2021-01-06 11:44:34,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:34,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959924032] [2021-01-06 11:44:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:35,059 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:44:35,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959924032] [2021-01-06 11:44:35,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:35,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:35,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266664694] [2021-01-06 11:44:35,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:35,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:35,062 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand 4 states. [2021-01-06 11:44:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:35,464 INFO L93 Difference]: Finished difference Result 302 states and 465 transitions. [2021-01-06 11:44:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:35,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:44:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:35,466 INFO L225 Difference]: With dead ends: 302 [2021-01-06 11:44:35,466 INFO L226 Difference]: Without dead ends: 167 [2021-01-06 11:44:35,467 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:44:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-06 11:44:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2021-01-06 11:44:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2021-01-06 11:44:35,473 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 59 [2021-01-06 11:44:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:35,474 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2021-01-06 11:44:35,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2021-01-06 11:44:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 11:44:35,475 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:35,475 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:35,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:44:35,475 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1870892638, now seen corresponding path program 1 times [2021-01-06 11:44:35,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:35,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718050542] [2021-01-06 11:44:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:35,534 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:44:35,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718050542] [2021-01-06 11:44:35,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:35,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:35,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739756382] [2021-01-06 11:44:35,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:35,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:35,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:35,537 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand 4 states. [2021-01-06 11:44:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:35,895 INFO L93 Difference]: Finished difference Result 292 states and 451 transitions. [2021-01-06 11:44:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:35,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 11:44:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:35,898 INFO L225 Difference]: With dead ends: 292 [2021-01-06 11:44:35,899 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 11:44:35,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 11:44:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2021-01-06 11:44:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-01-06 11:44:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2021-01-06 11:44:35,906 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 60 [2021-01-06 11:44:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:35,907 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2021-01-06 11:44:35,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2021-01-06 11:44:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 11:44:35,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:35,908 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:35,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:44:35,909 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1259019206, now seen corresponding path program 1 times [2021-01-06 11:44:35,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:35,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011595973] [2021-01-06 11:44:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:35,972 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:44:35,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011595973] [2021-01-06 11:44:35,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:35,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:35,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244046487] [2021-01-06 11:44:35,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:35,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:35,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:35,975 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand 4 states. [2021-01-06 11:44:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:36,369 INFO L93 Difference]: Finished difference Result 332 states and 512 transitions. [2021-01-06 11:44:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:36,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 11:44:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:36,373 INFO L225 Difference]: With dead ends: 332 [2021-01-06 11:44:36,373 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 11:44:36,374 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:44:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 11:44:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2021-01-06 11:44:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 272 transitions. [2021-01-06 11:44:36,381 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 272 transitions. Word has length 60 [2021-01-06 11:44:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:36,381 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 272 transitions. [2021-01-06 11:44:36,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 272 transitions. [2021-01-06 11:44:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:44:36,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:36,383 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:36,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:44:36,383 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -918808253, now seen corresponding path program 1 times [2021-01-06 11:44:36,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:36,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993271202] [2021-01-06 11:44:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:36,446 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:44:36,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993271202] [2021-01-06 11:44:36,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:36,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:36,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629240692] [2021-01-06 11:44:36,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:36,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:36,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:36,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:36,449 INFO L87 Difference]: Start difference. First operand 176 states and 272 transitions. Second operand 4 states. [2021-01-06 11:44:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:36,868 INFO L93 Difference]: Finished difference Result 354 states and 549 transitions. [2021-01-06 11:44:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:36,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:44:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:36,871 INFO L225 Difference]: With dead ends: 354 [2021-01-06 11:44:36,871 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 11:44:36,872 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:44:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 11:44:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2021-01-06 11:44:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2021-01-06 11:44:36,879 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 73 [2021-01-06 11:44:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:36,879 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2021-01-06 11:44:36,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2021-01-06 11:44:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:44:36,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:36,881 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:36,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:44:36,881 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1672080433, now seen corresponding path program 1 times [2021-01-06 11:44:36,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:36,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727704019] [2021-01-06 11:44:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:36,972 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:44:36,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727704019] [2021-01-06 11:44:36,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:36,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:36,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928569897] [2021-01-06 11:44:36,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:36,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:36,975 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand 4 states. [2021-01-06 11:44:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:37,378 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2021-01-06 11:44:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:37,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:44:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:37,380 INFO L225 Difference]: With dead ends: 353 [2021-01-06 11:44:37,380 INFO L226 Difference]: Without dead ends: 196 [2021-01-06 11:44:37,380 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:44:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-06 11:44:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2021-01-06 11:44:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2021-01-06 11:44:37,387 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 74 [2021-01-06 11:44:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:37,390 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2021-01-06 11:44:37,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2021-01-06 11:44:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:44:37,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:37,391 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:37,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:44:37,392 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1654453242, now seen corresponding path program 1 times [2021-01-06 11:44:37,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:37,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883086928] [2021-01-06 11:44:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:37,498 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:44:37,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883086928] [2021-01-06 11:44:37,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:37,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:37,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588466436] [2021-01-06 11:44:37,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:37,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:37,501 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand 4 states. [2021-01-06 11:44:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:37,969 INFO L93 Difference]: Finished difference Result 351 states and 542 transitions. [2021-01-06 11:44:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:37,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:44:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:37,972 INFO L225 Difference]: With dead ends: 351 [2021-01-06 11:44:37,972 INFO L226 Difference]: Without dead ends: 194 [2021-01-06 11:44:37,976 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:44:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-06 11:44:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2021-01-06 11:44:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 269 transitions. [2021-01-06 11:44:37,991 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 269 transitions. Word has length 74 [2021-01-06 11:44:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:37,996 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 269 transitions. [2021-01-06 11:44:37,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 269 transitions. [2021-01-06 11:44:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:44:37,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:37,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:37,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:44:37,998 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash -637293766, now seen corresponding path program 1 times [2021-01-06 11:44:37,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:37,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094408138] [2021-01-06 11:44:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:38,085 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:44:38,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094408138] [2021-01-06 11:44:38,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:38,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:38,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826188412] [2021-01-06 11:44:38,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:38,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:38,087 INFO L87 Difference]: Start difference. First operand 176 states and 269 transitions. Second operand 4 states. [2021-01-06 11:44:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:38,471 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2021-01-06 11:44:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:38,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:44:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:38,473 INFO L225 Difference]: With dead ends: 350 [2021-01-06 11:44:38,473 INFO L226 Difference]: Without dead ends: 193 [2021-01-06 11:44:38,474 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:44:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-06 11:44:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2021-01-06 11:44:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2021-01-06 11:44:38,483 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 268 transitions. Word has length 74 [2021-01-06 11:44:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:38,483 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 268 transitions. [2021-01-06 11:44:38,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 268 transitions. [2021-01-06 11:44:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:44:38,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:38,485 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:38,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:44:38,485 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash 214823011, now seen corresponding path program 1 times [2021-01-06 11:44:38,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:38,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610631189] [2021-01-06 11:44:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:38,545 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:44:38,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610631189] [2021-01-06 11:44:38,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:38,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:38,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895421001] [2021-01-06 11:44:38,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:38,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:38,549 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. Second operand 4 states. [2021-01-06 11:44:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:38,949 INFO L93 Difference]: Finished difference Result 350 states and 537 transitions. [2021-01-06 11:44:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:38,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:44:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:38,951 INFO L225 Difference]: With dead ends: 350 [2021-01-06 11:44:38,951 INFO L226 Difference]: Without dead ends: 193 [2021-01-06 11:44:38,952 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:44:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-06 11:44:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2021-01-06 11:44:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 267 transitions. [2021-01-06 11:44:38,958 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 267 transitions. Word has length 74 [2021-01-06 11:44:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:38,959 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 267 transitions. [2021-01-06 11:44:38,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 267 transitions. [2021-01-06 11:44:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:44:38,960 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:38,960 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:38,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:44:38,960 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1305894068, now seen corresponding path program 1 times [2021-01-06 11:44:38,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:38,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133376714] [2021-01-06 11:44:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:39,015 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:44:39,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133376714] [2021-01-06 11:44:39,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:39,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:39,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214766272] [2021-01-06 11:44:39,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:39,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:39,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:39,018 INFO L87 Difference]: Start difference. First operand 176 states and 267 transitions. Second operand 4 states. [2021-01-06 11:44:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:39,402 INFO L93 Difference]: Finished difference Result 350 states and 535 transitions. [2021-01-06 11:44:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:39,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:44:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:39,405 INFO L225 Difference]: With dead ends: 350 [2021-01-06 11:44:39,405 INFO L226 Difference]: Without dead ends: 193 [2021-01-06 11:44:39,406 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:44:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-06 11:44:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2021-01-06 11:44:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2021-01-06 11:44:39,413 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 75 [2021-01-06 11:44:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:39,413 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2021-01-06 11:44:39,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2021-01-06 11:44:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:44:39,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:39,415 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:39,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:44:39,415 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 61279432, now seen corresponding path program 1 times [2021-01-06 11:44:39,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:39,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054904749] [2021-01-06 11:44:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:39,475 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:44:39,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054904749] [2021-01-06 11:44:39,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:39,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:39,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957832245] [2021-01-06 11:44:39,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:39,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:39,478 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand 4 states. [2021-01-06 11:44:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:39,848 INFO L93 Difference]: Finished difference Result 350 states and 533 transitions. [2021-01-06 11:44:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:39,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:44:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:39,850 INFO L225 Difference]: With dead ends: 350 [2021-01-06 11:44:39,850 INFO L226 Difference]: Without dead ends: 193 [2021-01-06 11:44:39,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-06 11:44:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2021-01-06 11:44:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 265 transitions. [2021-01-06 11:44:39,858 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 265 transitions. Word has length 76 [2021-01-06 11:44:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:39,858 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 265 transitions. [2021-01-06 11:44:39,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 265 transitions. [2021-01-06 11:44:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 11:44:39,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:39,860 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:39,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:44:39,860 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash 758747665, now seen corresponding path program 1 times [2021-01-06 11:44:39,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:39,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115037782] [2021-01-06 11:44:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:39,924 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:44:39,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115037782] [2021-01-06 11:44:39,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:39,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:39,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975715178] [2021-01-06 11:44:39,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:39,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:39,926 INFO L87 Difference]: Start difference. First operand 176 states and 265 transitions. Second operand 4 states. [2021-01-06 11:44:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:40,291 INFO L93 Difference]: Finished difference Result 340 states and 518 transitions. [2021-01-06 11:44:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:40,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 11:44:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:40,293 INFO L225 Difference]: With dead ends: 340 [2021-01-06 11:44:40,293 INFO L226 Difference]: Without dead ends: 183 [2021-01-06 11:44:40,294 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:44:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-01-06 11:44:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2021-01-06 11:44:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-01-06 11:44:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 264 transitions. [2021-01-06 11:44:40,301 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 264 transitions. Word has length 77 [2021-01-06 11:44:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:40,302 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 264 transitions. [2021-01-06 11:44:40,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 264 transitions. [2021-01-06 11:44:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 11:44:40,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:40,303 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, 1] [2021-01-06 11:44:40,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:44:40,304 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash -650021911, now seen corresponding path program 1 times [2021-01-06 11:44:40,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:40,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380003063] [2021-01-06 11:44:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:40,396 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:44:40,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380003063] [2021-01-06 11:44:40,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:40,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:40,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927628329] [2021-01-06 11:44:40,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:40,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:40,398 INFO L87 Difference]: Start difference. First operand 176 states and 264 transitions. Second operand 4 states. [2021-01-06 11:44:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:40,982 INFO L93 Difference]: Finished difference Result 446 states and 683 transitions. [2021-01-06 11:44:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:40,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 11:44:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:40,984 INFO L225 Difference]: With dead ends: 446 [2021-01-06 11:44:40,985 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:44:40,985 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:44:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:44:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 217. [2021-01-06 11:44:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 11:44:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 338 transitions. [2021-01-06 11:44:40,993 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 338 transitions. Word has length 82 [2021-01-06 11:44:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:40,994 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 338 transitions. [2021-01-06 11:44:40,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 338 transitions. [2021-01-06 11:44:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 11:44:40,995 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:40,995 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, 1] [2021-01-06 11:44:40,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:44:40,996 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -226375189, now seen corresponding path program 1 times [2021-01-06 11:44:40,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:40,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836347562] [2021-01-06 11:44:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:41,066 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:44:41,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836347562] [2021-01-06 11:44:41,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:41,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:41,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486870242] [2021-01-06 11:44:41,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:41,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:41,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:41,068 INFO L87 Difference]: Start difference. First operand 217 states and 338 transitions. Second operand 4 states. [2021-01-06 11:44:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:41,539 INFO L93 Difference]: Finished difference Result 465 states and 731 transitions. [2021-01-06 11:44:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:41,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 11:44:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:41,542 INFO L225 Difference]: With dead ends: 465 [2021-01-06 11:44:41,543 INFO L226 Difference]: Without dead ends: 267 [2021-01-06 11:44:41,544 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:44:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-01-06 11:44:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 241. [2021-01-06 11:44:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-01-06 11:44:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2021-01-06 11:44:41,557 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 82 [2021-01-06 11:44:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:41,557 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2021-01-06 11:44:41,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2021-01-06 11:44:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 11:44:41,559 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:41,559 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, 1, 1] [2021-01-06 11:44:41,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:44:41,560 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1857859097, now seen corresponding path program 1 times [2021-01-06 11:44:41,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:41,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85379790] [2021-01-06 11:44:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:41,669 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:44:41,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85379790] [2021-01-06 11:44:41,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:41,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:41,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106336864] [2021-01-06 11:44:41,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:41,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:41,680 INFO L87 Difference]: Start difference. First operand 241 states and 380 transitions. Second operand 4 states. [2021-01-06 11:44:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:42,238 INFO L93 Difference]: Finished difference Result 527 states and 829 transitions. [2021-01-06 11:44:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:42,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-06 11:44:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:42,243 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:42,243 INFO L226 Difference]: Without dead ends: 305 [2021-01-06 11:44:42,244 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:44:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-01-06 11:44:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2021-01-06 11:44:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 381 transitions. [2021-01-06 11:44:42,253 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 381 transitions. Word has length 83 [2021-01-06 11:44:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:42,253 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 381 transitions. [2021-01-06 11:44:42,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 381 transitions. [2021-01-06 11:44:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:42,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:42,255 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:42,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:44:42,256 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1587064320, now seen corresponding path program 1 times [2021-01-06 11:44:42,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:42,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456981439] [2021-01-06 11:44:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:42,352 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:44:42,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456981439] [2021-01-06 11:44:42,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:42,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:42,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195819938] [2021-01-06 11:44:42,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:42,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:42,355 INFO L87 Difference]: Start difference. First operand 242 states and 381 transitions. Second operand 4 states. [2021-01-06 11:44:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:42,956 INFO L93 Difference]: Finished difference Result 528 states and 829 transitions. [2021-01-06 11:44:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:42,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:42,961 INFO L225 Difference]: With dead ends: 528 [2021-01-06 11:44:42,961 INFO L226 Difference]: Without dead ends: 305 [2021-01-06 11:44:42,962 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:44:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-01-06 11:44:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2021-01-06 11:44:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 380 transitions. [2021-01-06 11:44:42,974 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 380 transitions. Word has length 95 [2021-01-06 11:44:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:42,974 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 380 transitions. [2021-01-06 11:44:42,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 380 transitions. [2021-01-06 11:44:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:42,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:42,976 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:42,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:44:42,976 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -711045314, now seen corresponding path program 1 times [2021-01-06 11:44:42,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:42,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811376618] [2021-01-06 11:44:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:43,067 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:44:43,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811376618] [2021-01-06 11:44:43,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:43,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:43,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948702554] [2021-01-06 11:44:43,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:43,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:43,073 INFO L87 Difference]: Start difference. First operand 242 states and 380 transitions. Second operand 4 states. [2021-01-06 11:44:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:43,503 INFO L93 Difference]: Finished difference Result 491 states and 772 transitions. [2021-01-06 11:44:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:43,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:43,505 INFO L225 Difference]: With dead ends: 491 [2021-01-06 11:44:43,505 INFO L226 Difference]: Without dead ends: 268 [2021-01-06 11:44:43,506 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:44:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-01-06 11:44:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2021-01-06 11:44:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2021-01-06 11:44:43,512 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 95 [2021-01-06 11:44:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:43,513 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2021-01-06 11:44:43,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2021-01-06 11:44:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:43,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:43,514 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:43,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:44:43,515 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -913182030, now seen corresponding path program 1 times [2021-01-06 11:44:43,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:43,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298149747] [2021-01-06 11:44:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:43,578 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:44:43,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298149747] [2021-01-06 11:44:43,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:43,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:43,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091354952] [2021-01-06 11:44:43,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:43,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:43,580 INFO L87 Difference]: Start difference. First operand 242 states and 379 transitions. Second operand 4 states. [2021-01-06 11:44:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:44,169 INFO L93 Difference]: Finished difference Result 527 states and 824 transitions. [2021-01-06 11:44:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:44,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:44,172 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:44,172 INFO L226 Difference]: Without dead ends: 304 [2021-01-06 11:44:44,172 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:44:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-01-06 11:44:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 242. [2021-01-06 11:44:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 378 transitions. [2021-01-06 11:44:44,181 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 378 transitions. Word has length 96 [2021-01-06 11:44:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:44,181 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 378 transitions. [2021-01-06 11:44:44,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 378 transitions. [2021-01-06 11:44:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:44,182 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:44,183 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:44,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:44:44,183 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1881615651, now seen corresponding path program 1 times [2021-01-06 11:44:44,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:44,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718546534] [2021-01-06 11:44:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:44,259 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:44:44,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718546534] [2021-01-06 11:44:44,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:44,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:44,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599542695] [2021-01-06 11:44:44,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:44,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:44,261 INFO L87 Difference]: Start difference. First operand 242 states and 378 transitions. Second operand 4 states. [2021-01-06 11:44:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:44,813 INFO L93 Difference]: Finished difference Result 525 states and 820 transitions. [2021-01-06 11:44:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:44,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:44,815 INFO L225 Difference]: With dead ends: 525 [2021-01-06 11:44:44,815 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:44:44,816 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:44:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:44:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 242. [2021-01-06 11:44:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 377 transitions. [2021-01-06 11:44:44,824 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 377 transitions. Word has length 96 [2021-01-06 11:44:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:44,824 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 377 transitions. [2021-01-06 11:44:44,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 377 transitions. [2021-01-06 11:44:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:44,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:44,826 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:44,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:44:44,826 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 121604637, now seen corresponding path program 1 times [2021-01-06 11:44:44,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:44,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647071542] [2021-01-06 11:44:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:44,905 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:44:44,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647071542] [2021-01-06 11:44:44,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:44,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:44,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242856952] [2021-01-06 11:44:44,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:44,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:44,908 INFO L87 Difference]: Start difference. First operand 242 states and 377 transitions. Second operand 4 states. [2021-01-06 11:44:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:45,449 INFO L93 Difference]: Finished difference Result 524 states and 817 transitions. [2021-01-06 11:44:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:45,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:45,451 INFO L225 Difference]: With dead ends: 524 [2021-01-06 11:44:45,451 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:44:45,452 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:44:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:44:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 242. [2021-01-06 11:44:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:44:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 376 transitions. [2021-01-06 11:44:45,460 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 376 transitions. Word has length 96 [2021-01-06 11:44:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:45,460 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 376 transitions. [2021-01-06 11:44:45,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 376 transitions. [2021-01-06 11:44:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:45,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:45,462 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:45,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:44:45,462 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 973721414, now seen corresponding path program 1 times [2021-01-06 11:44:45,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:45,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109839364] [2021-01-06 11:44:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:45,546 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:44:45,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109839364] [2021-01-06 11:44:45,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:45,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:44:45,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86244527] [2021-01-06 11:44:45,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:44:45,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:44:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:45,549 INFO L87 Difference]: Start difference. First operand 242 states and 376 transitions. Second operand 5 states. [2021-01-06 11:44:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:46,117 INFO L93 Difference]: Finished difference Result 486 states and 760 transitions. [2021-01-06 11:44:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:44:46,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2021-01-06 11:44:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:46,120 INFO L225 Difference]: With dead ends: 486 [2021-01-06 11:44:46,120 INFO L226 Difference]: Without dead ends: 263 [2021-01-06 11:44:46,121 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:44:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-01-06 11:44:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2021-01-06 11:44:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 402 transitions. [2021-01-06 11:44:46,129 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 402 transitions. Word has length 96 [2021-01-06 11:44:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:46,129 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 402 transitions. [2021-01-06 11:44:46,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:44:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 402 transitions. [2021-01-06 11:44:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:46,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:46,131 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:46,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:44:46,131 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -494830241, now seen corresponding path program 1 times [2021-01-06 11:44:46,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:46,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115415545] [2021-01-06 11:44:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:46,200 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:44:46,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115415545] [2021-01-06 11:44:46,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:46,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:46,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129461032] [2021-01-06 11:44:46,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:46,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:46,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:46,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:46,202 INFO L87 Difference]: Start difference. First operand 262 states and 402 transitions. Second operand 4 states. [2021-01-06 11:44:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:46,579 INFO L93 Difference]: Finished difference Result 528 states and 812 transitions. [2021-01-06 11:44:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:46,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:46,581 INFO L225 Difference]: With dead ends: 528 [2021-01-06 11:44:46,582 INFO L226 Difference]: Without dead ends: 285 [2021-01-06 11:44:46,582 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:44:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-01-06 11:44:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 262. [2021-01-06 11:44:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2021-01-06 11:44:46,591 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 96 [2021-01-06 11:44:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:46,592 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2021-01-06 11:44:46,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2021-01-06 11:44:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:46,593 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:46,593 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:46,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:44:46,594 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1508390047, now seen corresponding path program 1 times [2021-01-06 11:44:46,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:46,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186711645] [2021-01-06 11:44:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:46,673 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:44:46,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186711645] [2021-01-06 11:44:46,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:46,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:46,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973194445] [2021-01-06 11:44:46,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:46,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:46,675 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2021-01-06 11:44:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:47,059 INFO L93 Difference]: Finished difference Result 527 states and 809 transitions. [2021-01-06 11:44:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:47,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:47,061 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:47,061 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:44:47,062 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:44:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:44:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2021-01-06 11:44:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 400 transitions. [2021-01-06 11:44:47,071 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 400 transitions. Word has length 96 [2021-01-06 11:44:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:47,072 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 400 transitions. [2021-01-06 11:44:47,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 400 transitions. [2021-01-06 11:44:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:44:47,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:47,073 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:47,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:44:47,074 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1407479420, now seen corresponding path program 1 times [2021-01-06 11:44:47,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:47,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368598700] [2021-01-06 11:44:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:47,139 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:44:47,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368598700] [2021-01-06 11:44:47,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:47,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:47,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631703321] [2021-01-06 11:44:47,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:47,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:47,141 INFO L87 Difference]: Start difference. First operand 262 states and 400 transitions. Second operand 4 states. [2021-01-06 11:44:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:47,668 INFO L93 Difference]: Finished difference Result 564 states and 862 transitions. [2021-01-06 11:44:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:47,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:44:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:47,670 INFO L225 Difference]: With dead ends: 564 [2021-01-06 11:44:47,670 INFO L226 Difference]: Without dead ends: 321 [2021-01-06 11:44:47,671 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:44:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-06 11:44:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2021-01-06 11:44:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 399 transitions. [2021-01-06 11:44:47,683 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 399 transitions. Word has length 97 [2021-01-06 11:44:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:47,684 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 399 transitions. [2021-01-06 11:44:47,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 399 transitions. [2021-01-06 11:44:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:44:47,685 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:47,685 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:47,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:44:47,685 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1448154170, now seen corresponding path program 1 times [2021-01-06 11:44:47,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:47,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492590281] [2021-01-06 11:44:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:47,755 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:44:47,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492590281] [2021-01-06 11:44:47,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:47,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:47,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750506340] [2021-01-06 11:44:47,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:47,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:47,757 INFO L87 Difference]: Start difference. First operand 262 states and 399 transitions. Second operand 4 states. [2021-01-06 11:44:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:48,171 INFO L93 Difference]: Finished difference Result 527 states and 805 transitions. [2021-01-06 11:44:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:48,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:44:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:48,173 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:48,174 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:44:48,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:44:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2021-01-06 11:44:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 398 transitions. [2021-01-06 11:44:48,183 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 398 transitions. Word has length 97 [2021-01-06 11:44:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:48,183 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 398 transitions. [2021-01-06 11:44:48,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2021-01-06 11:44:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:44:48,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:48,185 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:48,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:44:48,185 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1384198823, now seen corresponding path program 1 times [2021-01-06 11:44:48,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:48,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924920272] [2021-01-06 11:44:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:48,251 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:44:48,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924920272] [2021-01-06 11:44:48,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:48,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:48,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664031454] [2021-01-06 11:44:48,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:48,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:48,253 INFO L87 Difference]: Start difference. First operand 262 states and 398 transitions. Second operand 4 states. [2021-01-06 11:44:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:48,824 INFO L93 Difference]: Finished difference Result 564 states and 858 transitions. [2021-01-06 11:44:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:48,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:44:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:48,827 INFO L225 Difference]: With dead ends: 564 [2021-01-06 11:44:48,827 INFO L226 Difference]: Without dead ends: 321 [2021-01-06 11:44:48,828 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:44:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-06 11:44:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2021-01-06 11:44:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 397 transitions. [2021-01-06 11:44:48,838 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 397 transitions. Word has length 98 [2021-01-06 11:44:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:48,838 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 397 transitions. [2021-01-06 11:44:48,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 397 transitions. [2021-01-06 11:44:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:44:48,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:48,840 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:48,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:44:48,840 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -123281573, now seen corresponding path program 1 times [2021-01-06 11:44:48,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:48,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963854794] [2021-01-06 11:44:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:48,908 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:44:48,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963854794] [2021-01-06 11:44:48,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:48,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:48,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145841501] [2021-01-06 11:44:48,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:48,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:48,911 INFO L87 Difference]: Start difference. First operand 262 states and 397 transitions. Second operand 4 states. [2021-01-06 11:44:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:49,312 INFO L93 Difference]: Finished difference Result 527 states and 801 transitions. [2021-01-06 11:44:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:49,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:44:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:49,314 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:49,314 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:44:49,315 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:44:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:44:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2021-01-06 11:44:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 396 transitions. [2021-01-06 11:44:49,325 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 396 transitions. Word has length 98 [2021-01-06 11:44:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:49,325 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 396 transitions. [2021-01-06 11:44:49,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 396 transitions. [2021-01-06 11:44:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:44:49,326 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:49,327 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:49,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:44:49,327 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1473940617, now seen corresponding path program 1 times [2021-01-06 11:44:49,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:49,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021114059] [2021-01-06 11:44:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:49,398 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:44:49,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021114059] [2021-01-06 11:44:49,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:49,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:49,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090932074] [2021-01-06 11:44:49,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:49,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:49,401 INFO L87 Difference]: Start difference. First operand 262 states and 396 transitions. Second operand 4 states. [2021-01-06 11:44:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:49,912 INFO L93 Difference]: Finished difference Result 564 states and 854 transitions. [2021-01-06 11:44:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:49,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:44:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:49,916 INFO L225 Difference]: With dead ends: 564 [2021-01-06 11:44:49,916 INFO L226 Difference]: Without dead ends: 321 [2021-01-06 11:44:49,917 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:44:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-06 11:44:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2021-01-06 11:44:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 395 transitions. [2021-01-06 11:44:49,927 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 395 transitions. Word has length 99 [2021-01-06 11:44:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:49,927 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 395 transitions. [2021-01-06 11:44:49,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 395 transitions. [2021-01-06 11:44:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:44:49,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:49,928 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:49,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:44:49,929 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1040211531, now seen corresponding path program 1 times [2021-01-06 11:44:49,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:49,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441776507] [2021-01-06 11:44:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:49,997 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:44:49,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441776507] [2021-01-06 11:44:49,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:49,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:49,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451211052] [2021-01-06 11:44:49,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:49,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:49,999 INFO L87 Difference]: Start difference. First operand 262 states and 395 transitions. Second operand 4 states. [2021-01-06 11:44:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:50,379 INFO L93 Difference]: Finished difference Result 527 states and 797 transitions. [2021-01-06 11:44:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:50,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:44:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:50,383 INFO L225 Difference]: With dead ends: 527 [2021-01-06 11:44:50,383 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:44:50,384 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:44:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:44:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2021-01-06 11:44:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 394 transitions. [2021-01-06 11:44:50,392 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 394 transitions. Word has length 99 [2021-01-06 11:44:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:50,393 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 394 transitions. [2021-01-06 11:44:50,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 394 transitions. [2021-01-06 11:44:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:44:50,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:50,394 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:50,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:44:50,394 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 591968884, now seen corresponding path program 1 times [2021-01-06 11:44:50,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:50,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556122838] [2021-01-06 11:44:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:50,479 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:44:50,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556122838] [2021-01-06 11:44:50,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:50,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:50,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4045277] [2021-01-06 11:44:50,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:50,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:50,481 INFO L87 Difference]: Start difference. First operand 262 states and 394 transitions. Second operand 4 states. [2021-01-06 11:44:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:51,003 INFO L93 Difference]: Finished difference Result 554 states and 838 transitions. [2021-01-06 11:44:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:51,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:44:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:51,005 INFO L225 Difference]: With dead ends: 554 [2021-01-06 11:44:51,005 INFO L226 Difference]: Without dead ends: 311 [2021-01-06 11:44:51,006 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:44:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-01-06 11:44:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2021-01-06 11:44:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 393 transitions. [2021-01-06 11:44:51,015 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 393 transitions. Word has length 100 [2021-01-06 11:44:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:51,015 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 393 transitions. [2021-01-06 11:44:51,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 393 transitions. [2021-01-06 11:44:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:44:51,017 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:51,017 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:51,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:44:51,017 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1152668662, now seen corresponding path program 1 times [2021-01-06 11:44:51,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:51,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252111644] [2021-01-06 11:44:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:51,090 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:44:51,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252111644] [2021-01-06 11:44:51,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:51,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:51,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160716275] [2021-01-06 11:44:51,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:51,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:51,094 INFO L87 Difference]: Start difference. First operand 262 states and 393 transitions. Second operand 4 states. [2021-01-06 11:44:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:51,514 INFO L93 Difference]: Finished difference Result 517 states and 781 transitions. [2021-01-06 11:44:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:51,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 11:44:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:51,517 INFO L225 Difference]: With dead ends: 517 [2021-01-06 11:44:51,517 INFO L226 Difference]: Without dead ends: 274 [2021-01-06 11:44:51,518 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:44:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-01-06 11:44:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2021-01-06 11:44:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2021-01-06 11:44:51,530 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 100 [2021-01-06 11:44:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:51,531 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2021-01-06 11:44:51,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2021-01-06 11:44:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 11:44:51,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:51,533 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:44:51,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:44:51,533 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1802565754, now seen corresponding path program 1 times [2021-01-06 11:44:51,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:51,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309266415] [2021-01-06 11:44:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:51,617 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:44:51,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309266415] [2021-01-06 11:44:51,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:51,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:51,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270516280] [2021-01-06 11:44:51,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:51,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:51,619 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand 4 states. [2021-01-06 11:44:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:52,188 INFO L93 Difference]: Finished difference Result 554 states and 834 transitions. [2021-01-06 11:44:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:52,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2021-01-06 11:44:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:52,191 INFO L225 Difference]: With dead ends: 554 [2021-01-06 11:44:52,191 INFO L226 Difference]: Without dead ends: 311 [2021-01-06 11:44:52,192 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:44:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-01-06 11:44:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2021-01-06 11:44:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-01-06 11:44:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 391 transitions. [2021-01-06 11:44:52,204 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 391 transitions. Word has length 104 [2021-01-06 11:44:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:52,204 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 391 transitions. [2021-01-06 11:44:52,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2021-01-06 11:44:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 11:44:52,206 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:52,206 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:44:52,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:44:52,207 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1385169148, now seen corresponding path program 1 times [2021-01-06 11:44:52,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:52,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638266417] [2021-01-06 11:44:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:52,288 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:44:52,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638266417] [2021-01-06 11:44:52,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:52,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:52,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828748180] [2021-01-06 11:44:52,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:52,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:52,290 INFO L87 Difference]: Start difference. First operand 262 states and 391 transitions. Second operand 4 states. [2021-01-06 11:44:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:52,735 INFO L93 Difference]: Finished difference Result 558 states and 841 transitions. [2021-01-06 11:44:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:52,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2021-01-06 11:44:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:52,737 INFO L225 Difference]: With dead ends: 558 [2021-01-06 11:44:52,737 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:44:52,738 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:44:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:44:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2021-01-06 11:44:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 436 transitions. [2021-01-06 11:44:52,749 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 436 transitions. Word has length 104 [2021-01-06 11:44:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:52,749 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 436 transitions. [2021-01-06 11:44:52,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 436 transitions. [2021-01-06 11:44:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 11:44:52,750 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:52,751 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:52,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:44:52,751 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1895055843, now seen corresponding path program 1 times [2021-01-06 11:44:52,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:52,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674432342] [2021-01-06 11:44:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:52,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674432342] [2021-01-06 11:44:52,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:52,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:52,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073743703] [2021-01-06 11:44:52,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:52,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:52,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:52,834 INFO L87 Difference]: Start difference. First operand 288 states and 436 transitions. Second operand 4 states. [2021-01-06 11:44:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:53,370 INFO L93 Difference]: Finished difference Result 606 states and 922 transitions. [2021-01-06 11:44:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:53,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2021-01-06 11:44:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:53,373 INFO L225 Difference]: With dead ends: 606 [2021-01-06 11:44:53,373 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:44:53,374 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:44:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:44:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 288. [2021-01-06 11:44:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 435 transitions. [2021-01-06 11:44:53,384 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 435 transitions. Word has length 107 [2021-01-06 11:44:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:53,384 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 435 transitions. [2021-01-06 11:44:53,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 435 transitions. [2021-01-06 11:44:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 11:44:53,386 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:53,386 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:44:53,393 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:53,394 INFO L82 PathProgramCache]: Analyzing trace with hash -199039046, now seen corresponding path program 1 times [2021-01-06 11:44:53,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:53,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131420616] [2021-01-06 11:44:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:53,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131420616] [2021-01-06 11:44:53,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:53,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:53,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298214457] [2021-01-06 11:44:53,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:53,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:53,475 INFO L87 Difference]: Start difference. First operand 288 states and 435 transitions. Second operand 4 states. [2021-01-06 11:44:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:53,969 INFO L93 Difference]: Finished difference Result 598 states and 907 transitions. [2021-01-06 11:44:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:53,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2021-01-06 11:44:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:53,972 INFO L225 Difference]: With dead ends: 598 [2021-01-06 11:44:53,972 INFO L226 Difference]: Without dead ends: 329 [2021-01-06 11:44:53,973 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:44:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-01-06 11:44:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2021-01-06 11:44:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 434 transitions. [2021-01-06 11:44:53,983 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 434 transitions. Word has length 108 [2021-01-06 11:44:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:53,983 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 434 transitions. [2021-01-06 11:44:53,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 434 transitions. [2021-01-06 11:44:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 11:44:53,985 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:53,985 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:53,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:44:53,985 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -939388547, now seen corresponding path program 1 times [2021-01-06 11:44:53,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:53,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674211471] [2021-01-06 11:44:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:54,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674211471] [2021-01-06 11:44:54,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:54,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:54,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473814698] [2021-01-06 11:44:54,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:54,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:54,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:54,060 INFO L87 Difference]: Start difference. First operand 288 states and 434 transitions. Second operand 4 states. [2021-01-06 11:44:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:54,548 INFO L93 Difference]: Finished difference Result 598 states and 905 transitions. [2021-01-06 11:44:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:54,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 11:44:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:54,551 INFO L225 Difference]: With dead ends: 598 [2021-01-06 11:44:54,551 INFO L226 Difference]: Without dead ends: 329 [2021-01-06 11:44:54,552 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:44:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-01-06 11:44:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2021-01-06 11:44:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 433 transitions. [2021-01-06 11:44:54,562 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 433 transitions. Word has length 109 [2021-01-06 11:44:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:54,562 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 433 transitions. [2021-01-06 11:44:54,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 433 transitions. [2021-01-06 11:44:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 11:44:54,563 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:54,564 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:54,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:44:54,564 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 255315471, now seen corresponding path program 1 times [2021-01-06 11:44:54,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:54,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842845702] [2021-01-06 11:44:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:54,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842845702] [2021-01-06 11:44:54,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:54,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:54,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84612793] [2021-01-06 11:44:54,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:54,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:54,640 INFO L87 Difference]: Start difference. First operand 288 states and 433 transitions. Second operand 4 states. [2021-01-06 11:44:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:55,118 INFO L93 Difference]: Finished difference Result 598 states and 903 transitions. [2021-01-06 11:44:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:55,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2021-01-06 11:44:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:55,121 INFO L225 Difference]: With dead ends: 598 [2021-01-06 11:44:55,121 INFO L226 Difference]: Without dead ends: 329 [2021-01-06 11:44:55,121 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:44:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-01-06 11:44:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2021-01-06 11:44:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 432 transitions. [2021-01-06 11:44:55,135 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 432 transitions. Word has length 110 [2021-01-06 11:44:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:55,138 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 432 transitions. [2021-01-06 11:44:55,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 432 transitions. [2021-01-06 11:44:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 11:44:55,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:55,139 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:55,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:44:55,140 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:55,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:55,140 INFO L82 PathProgramCache]: Analyzing trace with hash -482968774, now seen corresponding path program 1 times [2021-01-06 11:44:55,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:55,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035599493] [2021-01-06 11:44:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:55,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035599493] [2021-01-06 11:44:55,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:55,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:55,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377367276] [2021-01-06 11:44:55,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:55,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:55,241 INFO L87 Difference]: Start difference. First operand 288 states and 432 transitions. Second operand 4 states. [2021-01-06 11:44:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:55,744 INFO L93 Difference]: Finished difference Result 596 states and 899 transitions. [2021-01-06 11:44:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2021-01-06 11:44:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:55,747 INFO L225 Difference]: With dead ends: 596 [2021-01-06 11:44:55,747 INFO L226 Difference]: Without dead ends: 327 [2021-01-06 11:44:55,748 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:44:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-01-06 11:44:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2021-01-06 11:44:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 431 transitions. [2021-01-06 11:44:55,758 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 431 transitions. Word has length 110 [2021-01-06 11:44:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:55,759 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 431 transitions. [2021-01-06 11:44:55,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2021-01-06 11:44:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 11:44:55,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:55,760 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:55,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:44:55,761 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1831981746, now seen corresponding path program 1 times [2021-01-06 11:44:55,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:55,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106854288] [2021-01-06 11:44:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:55,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106854288] [2021-01-06 11:44:55,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:55,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:55,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666030451] [2021-01-06 11:44:55,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:55,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:55,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:55,846 INFO L87 Difference]: Start difference. First operand 288 states and 431 transitions. Second operand 4 states. [2021-01-06 11:44:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:56,344 INFO L93 Difference]: Finished difference Result 594 states and 894 transitions. [2021-01-06 11:44:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:56,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2021-01-06 11:44:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:56,347 INFO L225 Difference]: With dead ends: 594 [2021-01-06 11:44:56,347 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 11:44:56,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 11:44:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 288. [2021-01-06 11:44:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 430 transitions. [2021-01-06 11:44:56,357 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 430 transitions. Word has length 111 [2021-01-06 11:44:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:56,358 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 430 transitions. [2021-01-06 11:44:56,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 430 transitions. [2021-01-06 11:44:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 11:44:56,359 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:56,359 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:56,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:44:56,360 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1978581477, now seen corresponding path program 1 times [2021-01-06 11:44:56,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:56,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484024121] [2021-01-06 11:44:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:56,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484024121] [2021-01-06 11:44:56,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:56,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:56,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699840275] [2021-01-06 11:44:56,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:56,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:56,441 INFO L87 Difference]: Start difference. First operand 288 states and 430 transitions. Second operand 4 states. [2021-01-06 11:44:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:56,916 INFO L93 Difference]: Finished difference Result 591 states and 888 transitions. [2021-01-06 11:44:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:56,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2021-01-06 11:44:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:56,920 INFO L225 Difference]: With dead ends: 591 [2021-01-06 11:44:56,920 INFO L226 Difference]: Without dead ends: 322 [2021-01-06 11:44:56,920 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:44:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-01-06 11:44:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2021-01-06 11:44:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2021-01-06 11:44:56,930 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 111 [2021-01-06 11:44:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:56,930 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2021-01-06 11:44:56,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2021-01-06 11:44:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 11:44:56,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:56,932 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:56,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:44:56,932 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:56,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 318860468, now seen corresponding path program 1 times [2021-01-06 11:44:56,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:56,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917176825] [2021-01-06 11:44:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:57,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917176825] [2021-01-06 11:44:57,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:57,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:57,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506431635] [2021-01-06 11:44:57,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:57,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:57,018 INFO L87 Difference]: Start difference. First operand 288 states and 429 transitions. Second operand 4 states. [2021-01-06 11:44:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:57,520 INFO L93 Difference]: Finished difference Result 591 states and 886 transitions. [2021-01-06 11:44:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:57,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2021-01-06 11:44:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:57,523 INFO L225 Difference]: With dead ends: 591 [2021-01-06 11:44:57,523 INFO L226 Difference]: Without dead ends: 322 [2021-01-06 11:44:57,524 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:44:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-01-06 11:44:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2021-01-06 11:44:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2021-01-06 11:44:57,533 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 114 [2021-01-06 11:44:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:57,534 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2021-01-06 11:44:57,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2021-01-06 11:44:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 11:44:57,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:57,536 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:57,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:44:57,536 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:57,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1161678702, now seen corresponding path program 1 times [2021-01-06 11:44:57,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:57,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560628591] [2021-01-06 11:44:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:57,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560628591] [2021-01-06 11:44:57,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:57,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:57,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230690257] [2021-01-06 11:44:57,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:57,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:57,642 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand 4 states. [2021-01-06 11:44:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:58,115 INFO L93 Difference]: Finished difference Result 585 states and 875 transitions. [2021-01-06 11:44:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:58,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 11:44:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:58,118 INFO L225 Difference]: With dead ends: 585 [2021-01-06 11:44:58,118 INFO L226 Difference]: Without dead ends: 316 [2021-01-06 11:44:58,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-06 11:44:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 288. [2021-01-06 11:44:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 427 transitions. [2021-01-06 11:44:58,128 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 427 transitions. Word has length 115 [2021-01-06 11:44:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:58,129 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 427 transitions. [2021-01-06 11:44:58,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 427 transitions. [2021-01-06 11:44:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 11:44:58,130 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:58,130 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:58,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 11:44:58,130 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash -812555508, now seen corresponding path program 1 times [2021-01-06 11:44:58,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:58,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378071229] [2021-01-06 11:44:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:58,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378071229] [2021-01-06 11:44:58,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:58,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:58,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896829594] [2021-01-06 11:44:58,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:58,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:58,223 INFO L87 Difference]: Start difference. First operand 288 states and 427 transitions. Second operand 4 states. [2021-01-06 11:44:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:58,731 INFO L93 Difference]: Finished difference Result 585 states and 873 transitions. [2021-01-06 11:44:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:58,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 11:44:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:58,734 INFO L225 Difference]: With dead ends: 585 [2021-01-06 11:44:58,734 INFO L226 Difference]: Without dead ends: 316 [2021-01-06 11:44:58,735 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:44:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-06 11:44:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 288. [2021-01-06 11:44:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 426 transitions. [2021-01-06 11:44:58,746 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 426 transitions. Word has length 115 [2021-01-06 11:44:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:58,746 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 426 transitions. [2021-01-06 11:44:58,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 426 transitions. [2021-01-06 11:44:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 11:44:58,747 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:58,747 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:58,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:44:58,748 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1758352270, now seen corresponding path program 1 times [2021-01-06 11:44:58,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:58,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598002814] [2021-01-06 11:44:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:58,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598002814] [2021-01-06 11:44:58,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:58,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:58,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287158901] [2021-01-06 11:44:58,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:58,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:58,844 INFO L87 Difference]: Start difference. First operand 288 states and 426 transitions. Second operand 4 states. [2021-01-06 11:44:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:59,340 INFO L93 Difference]: Finished difference Result 582 states and 867 transitions. [2021-01-06 11:44:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:59,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 11:44:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:59,343 INFO L225 Difference]: With dead ends: 582 [2021-01-06 11:44:59,343 INFO L226 Difference]: Without dead ends: 313 [2021-01-06 11:44:59,344 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:44:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-01-06 11:44:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 288. [2021-01-06 11:44:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2021-01-06 11:44:59,355 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 425 transitions. Word has length 116 [2021-01-06 11:44:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:59,355 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 425 transitions. [2021-01-06 11:44:59,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 425 transitions. [2021-01-06 11:44:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 11:44:59,356 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:59,357 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:59,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:44:59,357 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1648474628, now seen corresponding path program 1 times [2021-01-06 11:44:59,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:59,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321676311] [2021-01-06 11:44:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:44:59,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321676311] [2021-01-06 11:44:59,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:59,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:59,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248030385] [2021-01-06 11:44:59,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:59,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:59,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:59,450 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. Second operand 4 states. [2021-01-06 11:44:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:59,903 INFO L93 Difference]: Finished difference Result 582 states and 865 transitions. [2021-01-06 11:44:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:59,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 11:44:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:59,906 INFO L225 Difference]: With dead ends: 582 [2021-01-06 11:44:59,906 INFO L226 Difference]: Without dead ends: 313 [2021-01-06 11:44:59,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-01-06 11:44:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 288. [2021-01-06 11:44:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-06 11:44:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2021-01-06 11:44:59,915 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 117 [2021-01-06 11:44:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:59,915 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2021-01-06 11:44:59,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2021-01-06 11:44:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 11:44:59,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:59,916 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:44:59,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 11:44:59,917 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash 576445389, now seen corresponding path program 1 times [2021-01-06 11:44:59,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:59,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995949015] [2021-01-06 11:44:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 11:45:00,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995949015] [2021-01-06 11:45:00,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:00,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:00,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132509869] [2021-01-06 11:45:00,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:00,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:00,005 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand 4 states. [2021-01-06 11:45:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:00,529 INFO L93 Difference]: Finished difference Result 629 states and 938 transitions. [2021-01-06 11:45:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:00,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 11:45:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:00,531 INFO L225 Difference]: With dead ends: 629 [2021-01-06 11:45:00,532 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 11:45:00,532 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:45:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 11:45:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2021-01-06 11:45:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 11:45:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 481 transitions. [2021-01-06 11:45:00,543 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 481 transitions. Word has length 117 [2021-01-06 11:45:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:00,543 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 481 transitions. [2021-01-06 11:45:00,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 481 transitions. [2021-01-06 11:45:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 11:45:00,545 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:00,545 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:00,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 11:45:00,545 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -387331418, now seen corresponding path program 1 times [2021-01-06 11:45:00,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:00,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603475312] [2021-01-06 11:45:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:00,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603475312] [2021-01-06 11:45:00,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:00,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:00,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932770245] [2021-01-06 11:45:00,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:00,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:00,654 INFO L87 Difference]: Start difference. First operand 320 states and 481 transitions. Second operand 4 states. [2021-01-06 11:45:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:01,093 INFO L93 Difference]: Finished difference Result 643 states and 973 transitions. [2021-01-06 11:45:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:01,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2021-01-06 11:45:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:01,095 INFO L225 Difference]: With dead ends: 643 [2021-01-06 11:45:01,095 INFO L226 Difference]: Without dead ends: 342 [2021-01-06 11:45:01,096 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:45:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-06 11:45:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 320. [2021-01-06 11:45:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 11:45:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 480 transitions. [2021-01-06 11:45:01,105 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 480 transitions. Word has length 118 [2021-01-06 11:45:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:01,106 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 480 transitions. [2021-01-06 11:45:01,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 480 transitions. [2021-01-06 11:45:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 11:45:01,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:01,107 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:01,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 11:45:01,108 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1529071120, now seen corresponding path program 1 times [2021-01-06 11:45:01,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:01,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583144139] [2021-01-06 11:45:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:01,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583144139] [2021-01-06 11:45:01,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:01,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:01,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033000204] [2021-01-06 11:45:01,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:01,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:01,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:01,189 INFO L87 Difference]: Start difference. First operand 320 states and 480 transitions. Second operand 4 states. [2021-01-06 11:45:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:01,759 INFO L93 Difference]: Finished difference Result 731 states and 1110 transitions. [2021-01-06 11:45:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:01,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2021-01-06 11:45:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:01,762 INFO L225 Difference]: With dead ends: 731 [2021-01-06 11:45:01,762 INFO L226 Difference]: Without dead ends: 430 [2021-01-06 11:45:01,762 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:45:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-01-06 11:45:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 359. [2021-01-06 11:45:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2021-01-06 11:45:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 551 transitions. [2021-01-06 11:45:01,775 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 551 transitions. Word has length 118 [2021-01-06 11:45:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:01,776 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 551 transitions. [2021-01-06 11:45:01,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 551 transitions. [2021-01-06 11:45:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 11:45:01,777 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:01,777 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:01,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 11:45:01,778 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash 956386496, now seen corresponding path program 1 times [2021-01-06 11:45:01,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:01,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277302743] [2021-01-06 11:45:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:01,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277302743] [2021-01-06 11:45:01,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:01,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:01,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673345645] [2021-01-06 11:45:01,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:01,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:01,897 INFO L87 Difference]: Start difference. First operand 359 states and 551 transitions. Second operand 4 states. [2021-01-06 11:45:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:02,510 INFO L93 Difference]: Finished difference Result 762 states and 1169 transitions. [2021-01-06 11:45:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:02,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2021-01-06 11:45:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:02,514 INFO L225 Difference]: With dead ends: 762 [2021-01-06 11:45:02,514 INFO L226 Difference]: Without dead ends: 422 [2021-01-06 11:45:02,514 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:45:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-01-06 11:45:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 358. [2021-01-06 11:45:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-01-06 11:45:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2021-01-06 11:45:02,526 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 119 [2021-01-06 11:45:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:02,526 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2021-01-06 11:45:02,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2021-01-06 11:45:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 11:45:02,528 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:02,528 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:02,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 11:45:02,528 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1776138505, now seen corresponding path program 1 times [2021-01-06 11:45:02,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:02,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699001796] [2021-01-06 11:45:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:02,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699001796] [2021-01-06 11:45:02,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:02,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:02,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427786998] [2021-01-06 11:45:02,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:02,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:02,611 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2021-01-06 11:45:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:03,056 INFO L93 Difference]: Finished difference Result 724 states and 1113 transitions. [2021-01-06 11:45:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:03,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2021-01-06 11:45:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:03,059 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:45:03,059 INFO L226 Difference]: Without dead ends: 385 [2021-01-06 11:45:03,059 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:45:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-01-06 11:45:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2021-01-06 11:45:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-01-06 11:45:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 549 transitions. [2021-01-06 11:45:03,072 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 549 transitions. Word has length 119 [2021-01-06 11:45:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:03,072 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 549 transitions. [2021-01-06 11:45:03,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 549 transitions. [2021-01-06 11:45:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 11:45:03,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:03,073 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:03,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 11:45:03,074 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1454298220, now seen corresponding path program 1 times [2021-01-06 11:45:03,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:03,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353582926] [2021-01-06 11:45:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:03,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353582926] [2021-01-06 11:45:03,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:03,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:03,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101621596] [2021-01-06 11:45:03,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:03,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:03,150 INFO L87 Difference]: Start difference. First operand 358 states and 549 transitions. Second operand 4 states. [2021-01-06 11:45:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:03,588 INFO L93 Difference]: Finished difference Result 724 states and 1111 transitions. [2021-01-06 11:45:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:03,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 11:45:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:03,591 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:45:03,591 INFO L226 Difference]: Without dead ends: 385 [2021-01-06 11:45:03,592 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:45:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-01-06 11:45:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2021-01-06 11:45:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-01-06 11:45:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2021-01-06 11:45:03,600 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 120 [2021-01-06 11:45:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:03,600 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2021-01-06 11:45:03,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2021-01-06 11:45:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:45:03,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:03,602 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:03,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 11:45:03,602 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash 620121796, now seen corresponding path program 1 times [2021-01-06 11:45:03,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:03,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758237696] [2021-01-06 11:45:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:03,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758237696] [2021-01-06 11:45:03,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:03,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:03,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015527565] [2021-01-06 11:45:03,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:03,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:03,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:03,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:03,682 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2021-01-06 11:45:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:04,136 INFO L93 Difference]: Finished difference Result 724 states and 1109 transitions. [2021-01-06 11:45:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:04,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 11:45:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:04,139 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:45:04,139 INFO L226 Difference]: Without dead ends: 385 [2021-01-06 11:45:04,140 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:45:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-01-06 11:45:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2021-01-06 11:45:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-01-06 11:45:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 547 transitions. [2021-01-06 11:45:04,154 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 547 transitions. Word has length 121 [2021-01-06 11:45:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:04,154 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 547 transitions. [2021-01-06 11:45:04,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 547 transitions. [2021-01-06 11:45:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:45:04,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:04,156 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:04,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 11:45:04,156 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1083394247, now seen corresponding path program 1 times [2021-01-06 11:45:04,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:04,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592420540] [2021-01-06 11:45:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:04,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592420540] [2021-01-06 11:45:04,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:04,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:04,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694343820] [2021-01-06 11:45:04,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:04,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:04,249 INFO L87 Difference]: Start difference. First operand 358 states and 547 transitions. Second operand 4 states. [2021-01-06 11:45:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:04,635 INFO L93 Difference]: Finished difference Result 714 states and 1095 transitions. [2021-01-06 11:45:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:04,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2021-01-06 11:45:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:04,638 INFO L225 Difference]: With dead ends: 714 [2021-01-06 11:45:04,638 INFO L226 Difference]: Without dead ends: 375 [2021-01-06 11:45:04,639 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:45:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-01-06 11:45:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 358. [2021-01-06 11:45:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2021-01-06 11:45:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 546 transitions. [2021-01-06 11:45:04,652 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 546 transitions. Word has length 122 [2021-01-06 11:45:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:04,652 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 546 transitions. [2021-01-06 11:45:04,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 546 transitions. [2021-01-06 11:45:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 11:45:04,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:04,654 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:04,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 11:45:04,654 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1911205251, now seen corresponding path program 1 times [2021-01-06 11:45:04,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:04,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408860752] [2021-01-06 11:45:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:04,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408860752] [2021-01-06 11:45:04,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:04,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:04,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722106942] [2021-01-06 11:45:04,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:04,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:04,744 INFO L87 Difference]: Start difference. First operand 358 states and 546 transitions. Second operand 3 states. [2021-01-06 11:45:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:04,891 INFO L93 Difference]: Finished difference Result 1031 states and 1588 transitions. [2021-01-06 11:45:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:04,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2021-01-06 11:45:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:04,896 INFO L225 Difference]: With dead ends: 1031 [2021-01-06 11:45:04,896 INFO L226 Difference]: Without dead ends: 692 [2021-01-06 11:45:04,897 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:45:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-01-06 11:45:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2021-01-06 11:45:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2021-01-06 11:45:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1045 transitions. [2021-01-06 11:45:04,924 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1045 transitions. Word has length 123 [2021-01-06 11:45:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:04,924 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 1045 transitions. [2021-01-06 11:45:04,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1045 transitions. [2021-01-06 11:45:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 11:45:04,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:04,927 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:04,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-06 11:45:04,928 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 32074305, now seen corresponding path program 1 times [2021-01-06 11:45:04,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:04,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313963590] [2021-01-06 11:45:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-06 11:45:04,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313963590] [2021-01-06 11:45:04,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:04,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:04,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790522196] [2021-01-06 11:45:04,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:04,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:04,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:04,994 INFO L87 Difference]: Start difference. First operand 690 states and 1045 transitions. Second operand 3 states. [2021-01-06 11:45:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:05,098 INFO L93 Difference]: Finished difference Result 1388 states and 2105 transitions. [2021-01-06 11:45:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:05,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2021-01-06 11:45:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:05,102 INFO L225 Difference]: With dead ends: 1388 [2021-01-06 11:45:05,102 INFO L226 Difference]: Without dead ends: 717 [2021-01-06 11:45:05,103 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:45:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-01-06 11:45:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2021-01-06 11:45:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2021-01-06 11:45:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1080 transitions. [2021-01-06 11:45:05,131 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1080 transitions. Word has length 123 [2021-01-06 11:45:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:05,131 INFO L481 AbstractCegarLoop]: Abstraction has 717 states and 1080 transitions. [2021-01-06 11:45:05,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1080 transitions. [2021-01-06 11:45:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 11:45:05,133 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:05,134 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:05,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 11:45:05,134 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1421368319, now seen corresponding path program 1 times [2021-01-06 11:45:05,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:05,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273258957] [2021-01-06 11:45:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 11:45:05,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273258957] [2021-01-06 11:45:05,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:05,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:05,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885514315] [2021-01-06 11:45:05,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:05,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:05,191 INFO L87 Difference]: Start difference. First operand 717 states and 1080 transitions. Second operand 3 states. [2021-01-06 11:45:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:05,264 INFO L93 Difference]: Finished difference Result 1417 states and 2141 transitions. [2021-01-06 11:45:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:05,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2021-01-06 11:45:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:05,268 INFO L225 Difference]: With dead ends: 1417 [2021-01-06 11:45:05,269 INFO L226 Difference]: Without dead ends: 719 [2021-01-06 11:45:05,270 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:45:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-01-06 11:45:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-01-06 11:45:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 11:45:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1082 transitions. [2021-01-06 11:45:05,296 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1082 transitions. Word has length 123 [2021-01-06 11:45:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:05,296 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1082 transitions. [2021-01-06 11:45:05,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1082 transitions. [2021-01-06 11:45:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-06 11:45:05,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:05,299 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:05,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-06 11:45:05,300 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1943508964, now seen corresponding path program 1 times [2021-01-06 11:45:05,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:05,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811262701] [2021-01-06 11:45:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:05,401 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:45:05,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811262701] [2021-01-06 11:45:05,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:05,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:05,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117481957] [2021-01-06 11:45:05,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:05,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:05,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:05,404 INFO L87 Difference]: Start difference. First operand 719 states and 1082 transitions. Second operand 4 states. [2021-01-06 11:45:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:06,054 INFO L93 Difference]: Finished difference Result 1633 states and 2467 transitions. [2021-01-06 11:45:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:06,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2021-01-06 11:45:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:06,060 INFO L225 Difference]: With dead ends: 1633 [2021-01-06 11:45:06,061 INFO L226 Difference]: Without dead ends: 935 [2021-01-06 11:45:06,062 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:45:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-01-06 11:45:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 797. [2021-01-06 11:45:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2021-01-06 11:45:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1224 transitions. [2021-01-06 11:45:06,091 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1224 transitions. Word has length 125 [2021-01-06 11:45:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:06,091 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1224 transitions. [2021-01-06 11:45:06,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1224 transitions. [2021-01-06 11:45:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-01-06 11:45:06,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:06,094 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:06,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-01-06 11:45:06,094 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash 993715220, now seen corresponding path program 1 times [2021-01-06 11:45:06,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:06,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576472420] [2021-01-06 11:45:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:06,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576472420] [2021-01-06 11:45:06,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:06,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:06,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424487194] [2021-01-06 11:45:06,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:06,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:06,178 INFO L87 Difference]: Start difference. First operand 797 states and 1224 transitions. Second operand 4 states. [2021-01-06 11:45:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:06,769 INFO L93 Difference]: Finished difference Result 1699 states and 2592 transitions. [2021-01-06 11:45:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:06,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2021-01-06 11:45:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:06,775 INFO L225 Difference]: With dead ends: 1699 [2021-01-06 11:45:06,775 INFO L226 Difference]: Without dead ends: 923 [2021-01-06 11:45:06,776 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:45:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-01-06 11:45:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 719. [2021-01-06 11:45:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 11:45:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1082 transitions. [2021-01-06 11:45:06,804 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1082 transitions. Word has length 126 [2021-01-06 11:45:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:06,805 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1082 transitions. [2021-01-06 11:45:06,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1082 transitions. [2021-01-06 11:45:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 11:45:06,807 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:06,807 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:06,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-01-06 11:45:06,807 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash -54668992, now seen corresponding path program 1 times [2021-01-06 11:45:06,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:06,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249412655] [2021-01-06 11:45:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:06,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249412655] [2021-01-06 11:45:06,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:06,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:06,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513811633] [2021-01-06 11:45:06,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:06,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:06,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:06,937 INFO L87 Difference]: Start difference. First operand 719 states and 1082 transitions. Second operand 4 states. [2021-01-06 11:45:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:07,483 INFO L93 Difference]: Finished difference Result 1449 states and 2181 transitions. [2021-01-06 11:45:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:07,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 11:45:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:07,488 INFO L225 Difference]: With dead ends: 1449 [2021-01-06 11:45:07,489 INFO L226 Difference]: Without dead ends: 751 [2021-01-06 11:45:07,490 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:45:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-01-06 11:45:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 725. [2021-01-06 11:45:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2021-01-06 11:45:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1088 transitions. [2021-01-06 11:45:07,516 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1088 transitions. Word has length 127 [2021-01-06 11:45:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:07,516 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 1088 transitions. [2021-01-06 11:45:07,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1088 transitions. [2021-01-06 11:45:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:45:07,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:07,518 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:07,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-01-06 11:45:07,519 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 163103256, now seen corresponding path program 1 times [2021-01-06 11:45:07,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:07,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211052004] [2021-01-06 11:45:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:07,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211052004] [2021-01-06 11:45:07,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:07,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:07,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468981023] [2021-01-06 11:45:07,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:07,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:07,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:07,595 INFO L87 Difference]: Start difference. First operand 725 states and 1088 transitions. Second operand 4 states. [2021-01-06 11:45:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:07,981 INFO L93 Difference]: Finished difference Result 1463 states and 2195 transitions. [2021-01-06 11:45:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:07,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2021-01-06 11:45:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:07,986 INFO L225 Difference]: With dead ends: 1463 [2021-01-06 11:45:07,986 INFO L226 Difference]: Without dead ends: 759 [2021-01-06 11:45:07,987 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:45:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-01-06 11:45:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 725. [2021-01-06 11:45:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2021-01-06 11:45:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1086 transitions. [2021-01-06 11:45:08,011 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1086 transitions. Word has length 132 [2021-01-06 11:45:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:08,011 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 1086 transitions. [2021-01-06 11:45:08,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1086 transitions. [2021-01-06 11:45:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:45:08,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:08,014 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:08,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-01-06 11:45:08,014 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1186017118, now seen corresponding path program 1 times [2021-01-06 11:45:08,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:08,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133258670] [2021-01-06 11:45:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:08,103 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:45:08,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133258670] [2021-01-06 11:45:08,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:08,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:08,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32578832] [2021-01-06 11:45:08,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:08,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:08,105 INFO L87 Difference]: Start difference. First operand 725 states and 1086 transitions. Second operand 4 states. [2021-01-06 11:45:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:08,638 INFO L93 Difference]: Finished difference Result 1555 states and 2341 transitions. [2021-01-06 11:45:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:08,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2021-01-06 11:45:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:08,644 INFO L225 Difference]: With dead ends: 1555 [2021-01-06 11:45:08,644 INFO L226 Difference]: Without dead ends: 851 [2021-01-06 11:45:08,645 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:45:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2021-01-06 11:45:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 781. [2021-01-06 11:45:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2021-01-06 11:45:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1184 transitions. [2021-01-06 11:45:08,674 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1184 transitions. Word has length 132 [2021-01-06 11:45:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:08,674 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 1184 transitions. [2021-01-06 11:45:08,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1184 transitions. [2021-01-06 11:45:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 11:45:08,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:08,677 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:08,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-01-06 11:45:08,677 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash -474605355, now seen corresponding path program 1 times [2021-01-06 11:45:08,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:08,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554000798] [2021-01-06 11:45:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:08,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554000798] [2021-01-06 11:45:08,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:08,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:08,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589751215] [2021-01-06 11:45:08,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:08,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:08,758 INFO L87 Difference]: Start difference. First operand 781 states and 1184 transitions. Second operand 4 states. [2021-01-06 11:45:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:09,197 INFO L93 Difference]: Finished difference Result 1571 states and 2383 transitions. [2021-01-06 11:45:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:09,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 11:45:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:09,202 INFO L225 Difference]: With dead ends: 1571 [2021-01-06 11:45:09,202 INFO L226 Difference]: Without dead ends: 811 [2021-01-06 11:45:09,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-01-06 11:45:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 781. [2021-01-06 11:45:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2021-01-06 11:45:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1182 transitions. [2021-01-06 11:45:09,230 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1182 transitions. Word has length 133 [2021-01-06 11:45:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:09,230 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 1182 transitions. [2021-01-06 11:45:09,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1182 transitions. [2021-01-06 11:45:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 11:45:09,232 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:09,233 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:09,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-01-06 11:45:09,233 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1650329195, now seen corresponding path program 1 times [2021-01-06 11:45:09,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:09,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543620902] [2021-01-06 11:45:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:09,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543620902] [2021-01-06 11:45:09,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:09,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:09,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901363961] [2021-01-06 11:45:09,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:09,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:09,310 INFO L87 Difference]: Start difference. First operand 781 states and 1182 transitions. Second operand 4 states. [2021-01-06 11:45:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:09,932 INFO L93 Difference]: Finished difference Result 1745 states and 2648 transitions. [2021-01-06 11:45:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:09,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 11:45:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:09,938 INFO L225 Difference]: With dead ends: 1745 [2021-01-06 11:45:09,938 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:09,940 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:45:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 805. [2021-01-06 11:45:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2021-01-06 11:45:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1216 transitions. [2021-01-06 11:45:09,979 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1216 transitions. Word has length 133 [2021-01-06 11:45:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:09,980 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 1216 transitions. [2021-01-06 11:45:09,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1216 transitions. [2021-01-06 11:45:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 11:45:09,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:09,982 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:09,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-01-06 11:45:09,982 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1686985376, now seen corresponding path program 1 times [2021-01-06 11:45:09,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:09,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312551931] [2021-01-06 11:45:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:10,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312551931] [2021-01-06 11:45:10,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:10,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:10,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639756647] [2021-01-06 11:45:10,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:10,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:10,056 INFO L87 Difference]: Start difference. First operand 805 states and 1216 transitions. Second operand 4 states. [2021-01-06 11:45:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:10,683 INFO L93 Difference]: Finished difference Result 1769 states and 2680 transitions. [2021-01-06 11:45:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:10,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2021-01-06 11:45:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:10,687 INFO L225 Difference]: With dead ends: 1769 [2021-01-06 11:45:10,688 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:10,689 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:45:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 807. [2021-01-06 11:45:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2021-01-06 11:45:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1218 transitions. [2021-01-06 11:45:10,718 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1218 transitions. Word has length 134 [2021-01-06 11:45:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:10,718 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1218 transitions. [2021-01-06 11:45:10,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1218 transitions. [2021-01-06 11:45:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 11:45:10,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:10,720 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:10,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-01-06 11:45:10,720 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2024578128, now seen corresponding path program 1 times [2021-01-06 11:45:10,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:10,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778402734] [2021-01-06 11:45:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:10,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778402734] [2021-01-06 11:45:10,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:10,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:10,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854128094] [2021-01-06 11:45:10,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:10,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:10,817 INFO L87 Difference]: Start difference. First operand 807 states and 1218 transitions. Second operand 4 states. [2021-01-06 11:45:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:11,394 INFO L93 Difference]: Finished difference Result 1771 states and 2680 transitions. [2021-01-06 11:45:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:11,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2021-01-06 11:45:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:11,397 INFO L225 Difference]: With dead ends: 1771 [2021-01-06 11:45:11,397 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:11,398 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:45:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 809. [2021-01-06 11:45:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2021-01-06 11:45:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1220 transitions. [2021-01-06 11:45:11,425 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1220 transitions. Word has length 135 [2021-01-06 11:45:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:11,425 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1220 transitions. [2021-01-06 11:45:11,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1220 transitions. [2021-01-06 11:45:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 11:45:11,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:11,427 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:11,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-01-06 11:45:11,427 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1671867579, now seen corresponding path program 1 times [2021-01-06 11:45:11,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:11,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264479948] [2021-01-06 11:45:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:11,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264479948] [2021-01-06 11:45:11,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:11,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:11,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481100611] [2021-01-06 11:45:11,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:11,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:11,520 INFO L87 Difference]: Start difference. First operand 809 states and 1220 transitions. Second operand 4 states. [2021-01-06 11:45:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:12,062 INFO L93 Difference]: Finished difference Result 1753 states and 2656 transitions. [2021-01-06 11:45:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:12,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2021-01-06 11:45:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:12,065 INFO L225 Difference]: With dead ends: 1753 [2021-01-06 11:45:12,065 INFO L226 Difference]: Without dead ends: 965 [2021-01-06 11:45:12,067 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:45:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-01-06 11:45:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 811. [2021-01-06 11:45:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-01-06 11:45:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1222 transitions. [2021-01-06 11:45:12,097 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1222 transitions. Word has length 136 [2021-01-06 11:45:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:12,098 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1222 transitions. [2021-01-06 11:45:12,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1222 transitions. [2021-01-06 11:45:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 11:45:12,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:12,100 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:12,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-01-06 11:45:12,100 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1345966615, now seen corresponding path program 1 times [2021-01-06 11:45:12,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:12,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643793708] [2021-01-06 11:45:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:12,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643793708] [2021-01-06 11:45:12,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:12,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:12,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834045206] [2021-01-06 11:45:12,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:12,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:12,177 INFO L87 Difference]: Start difference. First operand 811 states and 1222 transitions. Second operand 4 states. [2021-01-06 11:45:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:12,791 INFO L93 Difference]: Finished difference Result 1775 states and 2680 transitions. [2021-01-06 11:45:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:12,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-06 11:45:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:12,795 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:45:12,795 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:12,796 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:45:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 811. [2021-01-06 11:45:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-01-06 11:45:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1220 transitions. [2021-01-06 11:45:12,828 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1220 transitions. Word has length 140 [2021-01-06 11:45:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:12,828 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1220 transitions. [2021-01-06 11:45:12,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1220 transitions. [2021-01-06 11:45:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 11:45:12,829 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:12,830 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:12,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-01-06 11:45:12,830 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash -841679988, now seen corresponding path program 1 times [2021-01-06 11:45:12,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:12,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829092133] [2021-01-06 11:45:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:12,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829092133] [2021-01-06 11:45:12,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:12,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:12,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985544079] [2021-01-06 11:45:12,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:12,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:12,918 INFO L87 Difference]: Start difference. First operand 811 states and 1220 transitions. Second operand 4 states. [2021-01-06 11:45:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:13,529 INFO L93 Difference]: Finished difference Result 1775 states and 2676 transitions. [2021-01-06 11:45:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:13,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2021-01-06 11:45:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:13,532 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:45:13,532 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:13,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:45:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 811. [2021-01-06 11:45:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-01-06 11:45:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1218 transitions. [2021-01-06 11:45:13,558 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1218 transitions. Word has length 141 [2021-01-06 11:45:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:13,558 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1218 transitions. [2021-01-06 11:45:13,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1218 transitions. [2021-01-06 11:45:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 11:45:13,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:13,561 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:13,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-01-06 11:45:13,561 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1835725916, now seen corresponding path program 1 times [2021-01-06 11:45:13,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:13,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772876780] [2021-01-06 11:45:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:13,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772876780] [2021-01-06 11:45:13,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:13,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:13,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806747716] [2021-01-06 11:45:13,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:13,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:13,638 INFO L87 Difference]: Start difference. First operand 811 states and 1218 transitions. Second operand 4 states. [2021-01-06 11:45:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:14,292 INFO L93 Difference]: Finished difference Result 1775 states and 2672 transitions. [2021-01-06 11:45:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:14,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2021-01-06 11:45:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:14,294 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:45:14,294 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:45:14,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:45:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 811. [2021-01-06 11:45:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-01-06 11:45:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1216 transitions. [2021-01-06 11:45:14,331 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1216 transitions. Word has length 142 [2021-01-06 11:45:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:14,331 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1216 transitions. [2021-01-06 11:45:14,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1216 transitions. [2021-01-06 11:45:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 11:45:14,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:14,333 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:14,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-01-06 11:45:14,333 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2033440793, now seen corresponding path program 1 times [2021-01-06 11:45:14,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:14,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329393015] [2021-01-06 11:45:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:14,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329393015] [2021-01-06 11:45:14,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:14,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:14,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198467848] [2021-01-06 11:45:14,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:14,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:14,425 INFO L87 Difference]: Start difference. First operand 811 states and 1216 transitions. Second operand 4 states. [2021-01-06 11:45:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:15,024 INFO L93 Difference]: Finished difference Result 1755 states and 2644 transitions. [2021-01-06 11:45:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:15,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2021-01-06 11:45:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:15,027 INFO L225 Difference]: With dead ends: 1755 [2021-01-06 11:45:15,027 INFO L226 Difference]: Without dead ends: 965 [2021-01-06 11:45:15,028 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:45:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-01-06 11:45:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 781. [2021-01-06 11:45:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2021-01-06 11:45:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1174 transitions. [2021-01-06 11:45:15,060 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1174 transitions. Word has length 143 [2021-01-06 11:45:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:15,060 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 1174 transitions. [2021-01-06 11:45:15,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1174 transitions. [2021-01-06 11:45:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 11:45:15,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:15,062 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:15,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-01-06 11:45:15,063 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1206713846, now seen corresponding path program 1 times [2021-01-06 11:45:15,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:15,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910371739] [2021-01-06 11:45:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:15,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910371739] [2021-01-06 11:45:15,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:15,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:15,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847587139] [2021-01-06 11:45:15,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:15,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:15,146 INFO L87 Difference]: Start difference. First operand 781 states and 1174 transitions. Second operand 4 states. [2021-01-06 11:45:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:15,684 INFO L93 Difference]: Finished difference Result 1725 states and 2600 transitions. [2021-01-06 11:45:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:15,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2021-01-06 11:45:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:15,687 INFO L225 Difference]: With dead ends: 1725 [2021-01-06 11:45:15,688 INFO L226 Difference]: Without dead ends: 965 [2021-01-06 11:45:15,689 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:45:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-01-06 11:45:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 837. [2021-01-06 11:45:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2021-01-06 11:45:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1264 transitions. [2021-01-06 11:45:15,712 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1264 transitions. Word has length 143 [2021-01-06 11:45:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:15,712 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1264 transitions. [2021-01-06 11:45:15,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1264 transitions. [2021-01-06 11:45:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 11:45:15,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:15,714 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:15,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-01-06 11:45:15,714 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1466540801, now seen corresponding path program 1 times [2021-01-06 11:45:15,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:15,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217149763] [2021-01-06 11:45:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:15,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217149763] [2021-01-06 11:45:15,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:15,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:15,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707858152] [2021-01-06 11:45:15,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:15,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:15,811 INFO L87 Difference]: Start difference. First operand 837 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:16,328 INFO L93 Difference]: Finished difference Result 1765 states and 2662 transitions. [2021-01-06 11:45:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:16,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2021-01-06 11:45:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:16,331 INFO L225 Difference]: With dead ends: 1765 [2021-01-06 11:45:16,331 INFO L226 Difference]: Without dead ends: 949 [2021-01-06 11:45:16,332 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:45:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-01-06 11:45:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 839. [2021-01-06 11:45:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:45:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1266 transitions. [2021-01-06 11:45:16,360 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1266 transitions. Word has length 144 [2021-01-06 11:45:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:16,360 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1266 transitions. [2021-01-06 11:45:16,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1266 transitions. [2021-01-06 11:45:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 11:45:16,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:16,362 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:16,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-01-06 11:45:16,362 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:16,363 INFO L82 PathProgramCache]: Analyzing trace with hash 203867404, now seen corresponding path program 1 times [2021-01-06 11:45:16,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:16,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093935022] [2021-01-06 11:45:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:45:16,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093935022] [2021-01-06 11:45:16,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:16,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:16,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060563570] [2021-01-06 11:45:16,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:16,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:16,443 INFO L87 Difference]: Start difference. First operand 839 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:16,968 INFO L93 Difference]: Finished difference Result 1767 states and 2662 transitions. [2021-01-06 11:45:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:16,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2021-01-06 11:45:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:16,972 INFO L225 Difference]: With dead ends: 1767 [2021-01-06 11:45:16,972 INFO L226 Difference]: Without dead ends: 949 [2021-01-06 11:45:16,973 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:45:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-01-06 11:45:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 839. [2021-01-06 11:45:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:45:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1264 transitions. [2021-01-06 11:45:16,995 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1264 transitions. Word has length 146 [2021-01-06 11:45:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:16,995 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1264 transitions. [2021-01-06 11:45:16,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1264 transitions. [2021-01-06 11:45:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 11:45:16,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:16,997 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:16,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-01-06 11:45:16,997 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash 789083233, now seen corresponding path program 1 times [2021-01-06 11:45:16,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:16,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894787173] [2021-01-06 11:45:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:45:17,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894787173] [2021-01-06 11:45:17,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:17,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:17,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915995369] [2021-01-06 11:45:17,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:17,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:17,093 INFO L87 Difference]: Start difference. First operand 839 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:17,589 INFO L93 Difference]: Finished difference Result 1763 states and 2654 transitions. [2021-01-06 11:45:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:17,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-06 11:45:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:17,592 INFO L225 Difference]: With dead ends: 1763 [2021-01-06 11:45:17,592 INFO L226 Difference]: Without dead ends: 945 [2021-01-06 11:45:17,593 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:45:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-01-06 11:45:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 839. [2021-01-06 11:45:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:45:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1262 transitions. [2021-01-06 11:45:17,616 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1262 transitions. Word has length 147 [2021-01-06 11:45:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:17,616 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1262 transitions. [2021-01-06 11:45:17,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1262 transitions. [2021-01-06 11:45:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 11:45:17,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:17,618 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:17,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-01-06 11:45:17,618 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1848437108, now seen corresponding path program 1 times [2021-01-06 11:45:17,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:17,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718772785] [2021-01-06 11:45:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:17,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718772785] [2021-01-06 11:45:17,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:17,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:17,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689645955] [2021-01-06 11:45:17,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:17,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:17,695 INFO L87 Difference]: Start difference. First operand 839 states and 1262 transitions. Second operand 4 states. [2021-01-06 11:45:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:18,230 INFO L93 Difference]: Finished difference Result 1757 states and 2642 transitions. [2021-01-06 11:45:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:18,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-06 11:45:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:18,233 INFO L225 Difference]: With dead ends: 1757 [2021-01-06 11:45:18,233 INFO L226 Difference]: Without dead ends: 939 [2021-01-06 11:45:18,235 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:45:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-01-06 11:45:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 845. [2021-01-06 11:45:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:45:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1272 transitions. [2021-01-06 11:45:18,261 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1272 transitions. Word has length 147 [2021-01-06 11:45:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:18,261 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1272 transitions. [2021-01-06 11:45:18,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1272 transitions. [2021-01-06 11:45:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 11:45:18,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:18,262 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:18,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-01-06 11:45:18,263 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash 643623075, now seen corresponding path program 1 times [2021-01-06 11:45:18,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:18,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600499087] [2021-01-06 11:45:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:45:18,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600499087] [2021-01-06 11:45:18,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:18,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:18,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559192731] [2021-01-06 11:45:18,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:18,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:18,377 INFO L87 Difference]: Start difference. First operand 845 states and 1272 transitions. Second operand 4 states. [2021-01-06 11:45:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:18,925 INFO L93 Difference]: Finished difference Result 1739 states and 2613 transitions. [2021-01-06 11:45:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:18,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-06 11:45:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:18,928 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:45:18,929 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 11:45:18,930 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:45:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 11:45:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 845. [2021-01-06 11:45:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:45:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1270 transitions. [2021-01-06 11:45:18,959 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1270 transitions. Word has length 147 [2021-01-06 11:45:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:18,960 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1270 transitions. [2021-01-06 11:45:18,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1270 transitions. [2021-01-06 11:45:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 11:45:18,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:18,961 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:18,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-01-06 11:45:18,961 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 706058258, now seen corresponding path program 1 times [2021-01-06 11:45:18,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:18,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10224733] [2021-01-06 11:45:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:45:19,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10224733] [2021-01-06 11:45:19,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:19,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:19,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706393051] [2021-01-06 11:45:19,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:19,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:19,038 INFO L87 Difference]: Start difference. First operand 845 states and 1270 transitions. Second operand 4 states. [2021-01-06 11:45:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:19,552 INFO L93 Difference]: Finished difference Result 1739 states and 2609 transitions. [2021-01-06 11:45:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:19,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2021-01-06 11:45:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:19,556 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:45:19,556 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 11:45:19,558 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:45:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 11:45:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 845. [2021-01-06 11:45:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:45:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1268 transitions. [2021-01-06 11:45:19,594 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1268 transitions. Word has length 148 [2021-01-06 11:45:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:19,594 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1268 transitions. [2021-01-06 11:45:19,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1268 transitions. [2021-01-06 11:45:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 11:45:19,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:19,596 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:19,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-01-06 11:45:19,597 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1100480546, now seen corresponding path program 1 times [2021-01-06 11:45:19,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:19,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365288710] [2021-01-06 11:45:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:45:19,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365288710] [2021-01-06 11:45:19,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:19,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:19,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247982306] [2021-01-06 11:45:19,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:19,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:19,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:19,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:19,681 INFO L87 Difference]: Start difference. First operand 845 states and 1268 transitions. Second operand 4 states. [2021-01-06 11:45:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:20,239 INFO L93 Difference]: Finished difference Result 1739 states and 2605 transitions. [2021-01-06 11:45:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:20,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 11:45:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:20,241 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:45:20,241 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 11:45:20,242 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:45:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 11:45:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 845. [2021-01-06 11:45:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:45:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1266 transitions. [2021-01-06 11:45:20,275 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1266 transitions. Word has length 149 [2021-01-06 11:45:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:20,275 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1266 transitions. [2021-01-06 11:45:20,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1266 transitions. [2021-01-06 11:45:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 11:45:20,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:20,277 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:20,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-01-06 11:45:20,278 INFO L429 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1282070858, now seen corresponding path program 1 times [2021-01-06 11:45:20,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:20,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474084515] [2021-01-06 11:45:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:20,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474084515] [2021-01-06 11:45:20,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:20,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:20,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447699550] [2021-01-06 11:45:20,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:20,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:20,362 INFO L87 Difference]: Start difference. First operand 845 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:20,941 INFO L93 Difference]: Finished difference Result 1789 states and 2676 transitions. [2021-01-06 11:45:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:20,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2021-01-06 11:45:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:20,944 INFO L225 Difference]: With dead ends: 1789 [2021-01-06 11:45:20,945 INFO L226 Difference]: Without dead ends: 965 [2021-01-06 11:45:20,946 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:45:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-01-06 11:45:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 845. [2021-01-06 11:45:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:45:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1264 transitions. [2021-01-06 11:45:20,982 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1264 transitions. Word has length 150 [2021-01-06 11:45:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:20,982 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1264 transitions. [2021-01-06 11:45:20,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1264 transitions. [2021-01-06 11:45:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 11:45:20,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:20,984 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:20,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-01-06 11:45:20,985 INFO L429 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1370800377, now seen corresponding path program 1 times [2021-01-06 11:45:20,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:20,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803169072] [2021-01-06 11:45:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:21,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803169072] [2021-01-06 11:45:21,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:21,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:21,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215999870] [2021-01-06 11:45:21,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:21,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:21,074 INFO L87 Difference]: Start difference. First operand 845 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:21,608 INFO L93 Difference]: Finished difference Result 1763 states and 2634 transitions. [2021-01-06 11:45:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:21,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2021-01-06 11:45:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:21,611 INFO L225 Difference]: With dead ends: 1763 [2021-01-06 11:45:21,611 INFO L226 Difference]: Without dead ends: 939 [2021-01-06 11:45:21,612 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:45:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-01-06 11:45:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 847. [2021-01-06 11:45:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:45:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1266 transitions. [2021-01-06 11:45:21,651 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1266 transitions. Word has length 150 [2021-01-06 11:45:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:21,651 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1266 transitions. [2021-01-06 11:45:21,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1266 transitions. [2021-01-06 11:45:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 11:45:21,653 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:21,653 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:21,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-01-06 11:45:21,654 INFO L429 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash -715670803, now seen corresponding path program 1 times [2021-01-06 11:45:21,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:21,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213279325] [2021-01-06 11:45:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:45:21,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213279325] [2021-01-06 11:45:21,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:21,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:21,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386554882] [2021-01-06 11:45:21,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:21,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:21,760 INFO L87 Difference]: Start difference. First operand 847 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:22,290 INFO L93 Difference]: Finished difference Result 1723 states and 2577 transitions. [2021-01-06 11:45:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:22,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2021-01-06 11:45:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:22,292 INFO L225 Difference]: With dead ends: 1723 [2021-01-06 11:45:22,292 INFO L226 Difference]: Without dead ends: 897 [2021-01-06 11:45:22,293 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:45:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-01-06 11:45:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 847. [2021-01-06 11:45:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:45:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1264 transitions. [2021-01-06 11:45:22,333 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1264 transitions. Word has length 150 [2021-01-06 11:45:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:22,333 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1264 transitions. [2021-01-06 11:45:22,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1264 transitions. [2021-01-06 11:45:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:45:22,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:22,335 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:22,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-01-06 11:45:22,336 INFO L429 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash -492359123, now seen corresponding path program 1 times [2021-01-06 11:45:22,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:22,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301730640] [2021-01-06 11:45:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:22,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301730640] [2021-01-06 11:45:22,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:22,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:22,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998862216] [2021-01-06 11:45:22,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:22,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:22,428 INFO L87 Difference]: Start difference. First operand 847 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:23,023 INFO L93 Difference]: Finished difference Result 1775 states and 2642 transitions. [2021-01-06 11:45:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:23,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 11:45:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:23,026 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:45:23,026 INFO L226 Difference]: Without dead ends: 949 [2021-01-06 11:45:23,027 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:45:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-01-06 11:45:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 847. [2021-01-06 11:45:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:45:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1262 transitions. [2021-01-06 11:45:23,053 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1262 transitions. Word has length 151 [2021-01-06 11:45:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:23,053 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1262 transitions. [2021-01-06 11:45:23,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1262 transitions. [2021-01-06 11:45:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:45:23,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:23,055 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:23,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-01-06 11:45:23,055 INFO L429 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1765740119, now seen corresponding path program 1 times [2021-01-06 11:45:23,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:23,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884390024] [2021-01-06 11:45:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:23,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884390024] [2021-01-06 11:45:23,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:23,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:23,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604348] [2021-01-06 11:45:23,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:23,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:23,142 INFO L87 Difference]: Start difference. First operand 847 states and 1262 transitions. Second operand 4 states. [2021-01-06 11:45:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:23,692 INFO L93 Difference]: Finished difference Result 1753 states and 2610 transitions. [2021-01-06 11:45:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:23,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 11:45:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:23,695 INFO L225 Difference]: With dead ends: 1753 [2021-01-06 11:45:23,695 INFO L226 Difference]: Without dead ends: 927 [2021-01-06 11:45:23,697 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:45:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-01-06 11:45:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 849. [2021-01-06 11:45:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2021-01-06 11:45:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1264 transitions. [2021-01-06 11:45:23,738 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1264 transitions. Word has length 151 [2021-01-06 11:45:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:23,738 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 1264 transitions. [2021-01-06 11:45:23,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1264 transitions. [2021-01-06 11:45:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:45:23,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:23,741 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:23,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-01-06 11:45:23,741 INFO L429 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1241116697, now seen corresponding path program 1 times [2021-01-06 11:45:23,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:23,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130057513] [2021-01-06 11:45:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:23,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130057513] [2021-01-06 11:45:23,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:23,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:23,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359220947] [2021-01-06 11:45:23,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:23,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:23,833 INFO L87 Difference]: Start difference. First operand 849 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:24,345 INFO L93 Difference]: Finished difference Result 1755 states and 2610 transitions. [2021-01-06 11:45:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:24,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 11:45:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:24,349 INFO L225 Difference]: With dead ends: 1755 [2021-01-06 11:45:24,349 INFO L226 Difference]: Without dead ends: 927 [2021-01-06 11:45:24,351 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:45:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-01-06 11:45:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 851. [2021-01-06 11:45:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2021-01-06 11:45:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1266 transitions. [2021-01-06 11:45:24,391 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1266 transitions. Word has length 151 [2021-01-06 11:45:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:24,391 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1266 transitions. [2021-01-06 11:45:24,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1266 transitions. [2021-01-06 11:45:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 11:45:24,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:24,393 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:24,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-01-06 11:45:24,394 INFO L429 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1533357527, now seen corresponding path program 1 times [2021-01-06 11:45:24,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:24,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496292600] [2021-01-06 11:45:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:24,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496292600] [2021-01-06 11:45:24,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:24,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:24,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185797025] [2021-01-06 11:45:24,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:24,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:24,494 INFO L87 Difference]: Start difference. First operand 851 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:25,078 INFO L93 Difference]: Finished difference Result 1751 states and 2603 transitions. [2021-01-06 11:45:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:25,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2021-01-06 11:45:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:25,082 INFO L225 Difference]: With dead ends: 1751 [2021-01-06 11:45:25,083 INFO L226 Difference]: Without dead ends: 921 [2021-01-06 11:45:25,084 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:45:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-01-06 11:45:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 853. [2021-01-06 11:45:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2021-01-06 11:45:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1268 transitions. [2021-01-06 11:45:25,141 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1268 transitions. Word has length 152 [2021-01-06 11:45:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:25,142 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1268 transitions. [2021-01-06 11:45:25,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1268 transitions. [2021-01-06 11:45:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 11:45:25,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:25,145 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:25,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-01-06 11:45:25,145 INFO L429 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1103283912, now seen corresponding path program 1 times [2021-01-06 11:45:25,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:25,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867935362] [2021-01-06 11:45:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:25,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867935362] [2021-01-06 11:45:25,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:25,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:25,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73016643] [2021-01-06 11:45:25,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:25,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:25,249 INFO L87 Difference]: Start difference. First operand 853 states and 1268 transitions. Second operand 4 states. [2021-01-06 11:45:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:25,823 INFO L93 Difference]: Finished difference Result 1781 states and 2638 transitions. [2021-01-06 11:45:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:25,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 11:45:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:25,825 INFO L225 Difference]: With dead ends: 1781 [2021-01-06 11:45:25,825 INFO L226 Difference]: Without dead ends: 949 [2021-01-06 11:45:25,827 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:45:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-01-06 11:45:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 853. [2021-01-06 11:45:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2021-01-06 11:45:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1266 transitions. [2021-01-06 11:45:25,868 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1266 transitions. Word has length 153 [2021-01-06 11:45:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:25,868 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1266 transitions. [2021-01-06 11:45:25,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1266 transitions. [2021-01-06 11:45:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 11:45:25,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:25,871 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:25,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-01-06 11:45:25,871 INFO L429 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash -855894881, now seen corresponding path program 1 times [2021-01-06 11:45:25,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:25,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526529271] [2021-01-06 11:45:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:25,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526529271] [2021-01-06 11:45:25,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:25,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:25,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540698264] [2021-01-06 11:45:25,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:25,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:25,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:25,960 INFO L87 Difference]: Start difference. First operand 853 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:26,508 INFO L93 Difference]: Finished difference Result 1753 states and 2599 transitions. [2021-01-06 11:45:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:26,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 11:45:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:26,510 INFO L225 Difference]: With dead ends: 1753 [2021-01-06 11:45:26,511 INFO L226 Difference]: Without dead ends: 921 [2021-01-06 11:45:26,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2021-01-06 11:45:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 855. [2021-01-06 11:45:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2021-01-06 11:45:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1268 transitions. [2021-01-06 11:45:26,556 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1268 transitions. Word has length 153 [2021-01-06 11:45:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:26,556 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1268 transitions. [2021-01-06 11:45:26,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1268 transitions. [2021-01-06 11:45:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 11:45:26,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:26,558 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:26,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-01-06 11:45:26,559 INFO L429 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1077901899, now seen corresponding path program 1 times [2021-01-06 11:45:26,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:26,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471073591] [2021-01-06 11:45:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:26,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471073591] [2021-01-06 11:45:26,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:26,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:26,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533965735] [2021-01-06 11:45:26,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:26,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:26,658 INFO L87 Difference]: Start difference. First operand 855 states and 1268 transitions. Second operand 4 states. [2021-01-06 11:45:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:27,229 INFO L93 Difference]: Finished difference Result 1779 states and 2630 transitions. [2021-01-06 11:45:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:27,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2021-01-06 11:45:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:27,232 INFO L225 Difference]: With dead ends: 1779 [2021-01-06 11:45:27,232 INFO L226 Difference]: Without dead ends: 945 [2021-01-06 11:45:27,233 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:45:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-01-06 11:45:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 855. [2021-01-06 11:45:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2021-01-06 11:45:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1266 transitions. [2021-01-06 11:45:27,268 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1266 transitions. Word has length 154 [2021-01-06 11:45:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:27,268 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1266 transitions. [2021-01-06 11:45:27,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1266 transitions. [2021-01-06 11:45:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 11:45:27,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:27,270 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:27,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-01-06 11:45:27,270 INFO L429 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -18548024, now seen corresponding path program 1 times [2021-01-06 11:45:27,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:27,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810492005] [2021-01-06 11:45:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:27,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810492005] [2021-01-06 11:45:27,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:27,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:27,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696920470] [2021-01-06 11:45:27,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:27,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:27,349 INFO L87 Difference]: Start difference. First operand 855 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:27,880 INFO L93 Difference]: Finished difference Result 1773 states and 2618 transitions. [2021-01-06 11:45:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2021-01-06 11:45:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:27,883 INFO L225 Difference]: With dead ends: 1773 [2021-01-06 11:45:27,884 INFO L226 Difference]: Without dead ends: 939 [2021-01-06 11:45:27,885 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:45:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-01-06 11:45:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 855. [2021-01-06 11:45:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2021-01-06 11:45:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1264 transitions. [2021-01-06 11:45:27,929 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1264 transitions. Word has length 154 [2021-01-06 11:45:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:27,929 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1264 transitions. [2021-01-06 11:45:27,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1264 transitions. [2021-01-06 11:45:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 11:45:27,931 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:27,932 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:27,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-01-06 11:45:27,932 INFO L429 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash -537874641, now seen corresponding path program 1 times [2021-01-06 11:45:27,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:27,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878589814] [2021-01-06 11:45:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:28,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878589814] [2021-01-06 11:45:28,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:28,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:28,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850395998] [2021-01-06 11:45:28,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:28,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:28,049 INFO L87 Difference]: Start difference. First operand 855 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:28,585 INFO L93 Difference]: Finished difference Result 1749 states and 2584 transitions. [2021-01-06 11:45:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:28,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2021-01-06 11:45:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:28,587 INFO L225 Difference]: With dead ends: 1749 [2021-01-06 11:45:28,587 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 11:45:28,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 11:45:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 857. [2021-01-06 11:45:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2021-01-06 11:45:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1266 transitions. [2021-01-06 11:45:28,625 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1266 transitions. Word has length 154 [2021-01-06 11:45:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:28,626 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 1266 transitions. [2021-01-06 11:45:28,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1266 transitions. [2021-01-06 11:45:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 11:45:28,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:28,627 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:28,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-01-06 11:45:28,628 INFO L429 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1843216165, now seen corresponding path program 1 times [2021-01-06 11:45:28,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:28,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400709485] [2021-01-06 11:45:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:28,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400709485] [2021-01-06 11:45:28,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:28,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:28,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175581683] [2021-01-06 11:45:28,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:28,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:28,711 INFO L87 Difference]: Start difference. First operand 857 states and 1266 transitions. Second operand 4 states. [2021-01-06 11:45:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:29,251 INFO L93 Difference]: Finished difference Result 1775 states and 2614 transitions. [2021-01-06 11:45:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:29,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-06 11:45:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:29,254 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:45:29,254 INFO L226 Difference]: Without dead ends: 939 [2021-01-06 11:45:29,255 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:45:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-01-06 11:45:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 857. [2021-01-06 11:45:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2021-01-06 11:45:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1264 transitions. [2021-01-06 11:45:29,297 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1264 transitions. Word has length 157 [2021-01-06 11:45:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:29,297 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 1264 transitions. [2021-01-06 11:45:29,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1264 transitions. [2021-01-06 11:45:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 11:45:29,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:29,299 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] [2021-01-06 11:45:29,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-01-06 11:45:29,300 INFO L429 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1468724100, now seen corresponding path program 1 times [2021-01-06 11:45:29,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:29,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755063850] [2021-01-06 11:45:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:29,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755063850] [2021-01-06 11:45:29,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:29,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:29,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760660785] [2021-01-06 11:45:29,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:29,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:29,397 INFO L87 Difference]: Start difference. First operand 857 states and 1264 transitions. Second operand 4 states. [2021-01-06 11:45:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:30,025 INFO L93 Difference]: Finished difference Result 1827 states and 2709 transitions. [2021-01-06 11:45:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:30,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-06 11:45:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:30,027 INFO L225 Difference]: With dead ends: 1827 [2021-01-06 11:45:30,027 INFO L226 Difference]: Without dead ends: 991 [2021-01-06 11:45:30,028 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:45:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-01-06 11:45:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 917. [2021-01-06 11:45:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1370 transitions. [2021-01-06 11:45:30,060 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1370 transitions. Word has length 157 [2021-01-06 11:45:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:30,060 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1370 transitions. [2021-01-06 11:45:30,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1370 transitions. [2021-01-06 11:45:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 11:45:30,061 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:30,061 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:30,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-01-06 11:45:30,062 INFO L429 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -5752579, now seen corresponding path program 1 times [2021-01-06 11:45:30,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:30,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692972740] [2021-01-06 11:45:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:30,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692972740] [2021-01-06 11:45:30,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:30,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:30,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145237707] [2021-01-06 11:45:30,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:30,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:30,141 INFO L87 Difference]: Start difference. First operand 917 states and 1370 transitions. Second operand 4 states. [2021-01-06 11:45:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:30,650 INFO L93 Difference]: Finished difference Result 1883 states and 2806 transitions. [2021-01-06 11:45:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:30,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2021-01-06 11:45:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:30,653 INFO L225 Difference]: With dead ends: 1883 [2021-01-06 11:45:30,653 INFO L226 Difference]: Without dead ends: 987 [2021-01-06 11:45:30,654 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:45:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-01-06 11:45:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 917. [2021-01-06 11:45:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1368 transitions. [2021-01-06 11:45:30,701 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1368 transitions. Word has length 158 [2021-01-06 11:45:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:30,702 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1368 transitions. [2021-01-06 11:45:30,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1368 transitions. [2021-01-06 11:45:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 11:45:30,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:30,705 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:30,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-01-06 11:45:30,705 INFO L429 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 518870843, now seen corresponding path program 1 times [2021-01-06 11:45:30,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:30,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972653540] [2021-01-06 11:45:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:30,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972653540] [2021-01-06 11:45:30,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:30,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:30,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188831635] [2021-01-06 11:45:30,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:30,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:30,796 INFO L87 Difference]: Start difference. First operand 917 states and 1368 transitions. Second operand 4 states. [2021-01-06 11:45:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:31,335 INFO L93 Difference]: Finished difference Result 1883 states and 2802 transitions. [2021-01-06 11:45:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:31,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2021-01-06 11:45:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:31,337 INFO L225 Difference]: With dead ends: 1883 [2021-01-06 11:45:31,337 INFO L226 Difference]: Without dead ends: 987 [2021-01-06 11:45:31,339 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:45:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-01-06 11:45:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 917. [2021-01-06 11:45:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1366 transitions. [2021-01-06 11:45:31,373 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1366 transitions. Word has length 158 [2021-01-06 11:45:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:31,374 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1366 transitions. [2021-01-06 11:45:31,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1366 transitions. [2021-01-06 11:45:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:45:31,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:31,376 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:31,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-01-06 11:45:31,376 INFO L429 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 258396419, now seen corresponding path program 1 times [2021-01-06 11:45:31,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:31,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004528971] [2021-01-06 11:45:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:31,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004528971] [2021-01-06 11:45:31,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:31,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:31,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760894801] [2021-01-06 11:45:31,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:31,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:31,464 INFO L87 Difference]: Start difference. First operand 917 states and 1366 transitions. Second operand 4 states. [2021-01-06 11:45:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:32,002 INFO L93 Difference]: Finished difference Result 1877 states and 2791 transitions. [2021-01-06 11:45:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:32,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 11:45:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:32,005 INFO L225 Difference]: With dead ends: 1877 [2021-01-06 11:45:32,005 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:45:32,006 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:45:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:45:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 917. [2021-01-06 11:45:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1364 transitions. [2021-01-06 11:45:32,053 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1364 transitions. Word has length 159 [2021-01-06 11:45:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:32,053 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1364 transitions. [2021-01-06 11:45:32,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1364 transitions. [2021-01-06 11:45:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 11:45:32,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:32,055 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:32,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-01-06 11:45:32,055 INFO L429 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1724983565, now seen corresponding path program 1 times [2021-01-06 11:45:32,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:32,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049405784] [2021-01-06 11:45:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:32,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049405784] [2021-01-06 11:45:32,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:32,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:32,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205669452] [2021-01-06 11:45:32,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:32,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:32,139 INFO L87 Difference]: Start difference. First operand 917 states and 1364 transitions. Second operand 4 states. [2021-01-06 11:45:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:32,666 INFO L93 Difference]: Finished difference Result 1877 states and 2787 transitions. [2021-01-06 11:45:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:32,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 11:45:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:32,668 INFO L225 Difference]: With dead ends: 1877 [2021-01-06 11:45:32,668 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:45:32,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:45:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 917. [2021-01-06 11:45:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1362 transitions. [2021-01-06 11:45:32,699 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1362 transitions. Word has length 160 [2021-01-06 11:45:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:32,700 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1362 transitions. [2021-01-06 11:45:32,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1362 transitions. [2021-01-06 11:45:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 11:45:32,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:32,701 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:32,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-01-06 11:45:32,701 INFO L429 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1981268911, now seen corresponding path program 1 times [2021-01-06 11:45:32,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:32,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498664458] [2021-01-06 11:45:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:45:32,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498664458] [2021-01-06 11:45:32,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:32,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:32,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542674106] [2021-01-06 11:45:32,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:32,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:32,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:32,772 INFO L87 Difference]: Start difference. First operand 917 states and 1362 transitions. Second operand 4 states. [2021-01-06 11:45:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:33,294 INFO L93 Difference]: Finished difference Result 1871 states and 2776 transitions. [2021-01-06 11:45:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:33,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 11:45:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:33,297 INFO L225 Difference]: With dead ends: 1871 [2021-01-06 11:45:33,297 INFO L226 Difference]: Without dead ends: 975 [2021-01-06 11:45:33,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-01-06 11:45:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 917. [2021-01-06 11:45:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1360 transitions. [2021-01-06 11:45:33,329 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1360 transitions. Word has length 160 [2021-01-06 11:45:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:33,329 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1360 transitions. [2021-01-06 11:45:33,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1360 transitions. [2021-01-06 11:45:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 11:45:33,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:33,330 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:33,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-01-06 11:45:33,331 INFO L429 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:33,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1795767486, now seen corresponding path program 1 times [2021-01-06 11:45:33,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:33,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823010279] [2021-01-06 11:45:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-06 11:45:33,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823010279] [2021-01-06 11:45:33,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:33,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:33,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798606375] [2021-01-06 11:45:33,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:33,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:33,409 INFO L87 Difference]: Start difference. First operand 917 states and 1360 transitions. Second operand 4 states. [2021-01-06 11:45:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:33,916 INFO L93 Difference]: Finished difference Result 1863 states and 2765 transitions. [2021-01-06 11:45:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:33,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 11:45:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:33,919 INFO L225 Difference]: With dead ends: 1863 [2021-01-06 11:45:33,919 INFO L226 Difference]: Without dead ends: 967 [2021-01-06 11:45:33,919 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:45:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-01-06 11:45:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 917. [2021-01-06 11:45:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2021-01-06 11:45:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1358 transitions. [2021-01-06 11:45:33,968 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1358 transitions. Word has length 160 [2021-01-06 11:45:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:33,968 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 1358 transitions. [2021-01-06 11:45:33,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1358 transitions. [2021-01-06 11:45:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 11:45:33,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:33,970 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:33,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-01-06 11:45:33,970 INFO L429 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1709820069, now seen corresponding path program 1 times [2021-01-06 11:45:33,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:33,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226857881] [2021-01-06 11:45:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:45:34,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226857881] [2021-01-06 11:45:34,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:34,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:34,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575904679] [2021-01-06 11:45:34,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:34,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:34,056 INFO L87 Difference]: Start difference. First operand 917 states and 1358 transitions. Second operand 4 states. [2021-01-06 11:45:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:34,595 INFO L93 Difference]: Finished difference Result 1871 states and 2768 transitions. [2021-01-06 11:45:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:34,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 11:45:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:34,597 INFO L225 Difference]: With dead ends: 1871 [2021-01-06 11:45:34,597 INFO L226 Difference]: Without dead ends: 975 [2021-01-06 11:45:34,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:45:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-01-06 11:45:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2021-01-06 11:45:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2021-01-06 11:45:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1338 transitions. [2021-01-06 11:45:34,629 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1338 transitions. Word has length 161 [2021-01-06 11:45:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:34,629 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1338 transitions. [2021-01-06 11:45:34,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1338 transitions. [2021-01-06 11:45:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 11:45:34,630 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:34,630 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:34,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-01-06 11:45:34,631 INFO L429 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1012656476, now seen corresponding path program 1 times [2021-01-06 11:45:34,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:34,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823504174] [2021-01-06 11:45:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 11:45:34,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823504174] [2021-01-06 11:45:34,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:34,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:34,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117800061] [2021-01-06 11:45:34,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:34,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:34,710 INFO L87 Difference]: Start difference. First operand 901 states and 1338 transitions. Second operand 4 states. [2021-01-06 11:45:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:35,192 INFO L93 Difference]: Finished difference Result 1851 states and 2742 transitions. [2021-01-06 11:45:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:35,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 11:45:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:35,194 INFO L225 Difference]: With dead ends: 1851 [2021-01-06 11:45:35,194 INFO L226 Difference]: Without dead ends: 971 [2021-01-06 11:45:35,195 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:45:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-01-06 11:45:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 903. [2021-01-06 11:45:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2021-01-06 11:45:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1340 transitions. [2021-01-06 11:45:35,239 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1340 transitions. Word has length 161 [2021-01-06 11:45:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:35,239 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 1340 transitions. [2021-01-06 11:45:35,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1340 transitions. [2021-01-06 11:45:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 11:45:35,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:35,240 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:35,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-01-06 11:45:35,240 INFO L429 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1401621777, now seen corresponding path program 1 times [2021-01-06 11:45:35,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:35,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219895892] [2021-01-06 11:45:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-06 11:45:35,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219895892] [2021-01-06 11:45:35,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:35,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:35,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734290098] [2021-01-06 11:45:35,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:35,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:35,325 INFO L87 Difference]: Start difference. First operand 903 states and 1340 transitions. Second operand 4 states. [2021-01-06 11:45:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:35,804 INFO L93 Difference]: Finished difference Result 1831 states and 2721 transitions. [2021-01-06 11:45:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:35,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 11:45:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:35,806 INFO L225 Difference]: With dead ends: 1831 [2021-01-06 11:45:35,807 INFO L226 Difference]: Without dead ends: 949 [2021-01-06 11:45:35,808 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:45:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-01-06 11:45:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 903. [2021-01-06 11:45:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2021-01-06 11:45:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1338 transitions. [2021-01-06 11:45:35,844 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1338 transitions. Word has length 161 [2021-01-06 11:45:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:35,844 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 1338 transitions. [2021-01-06 11:45:35,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1338 transitions. [2021-01-06 11:45:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-06 11:45:35,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:35,845 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:35,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-01-06 11:45:35,845 INFO L429 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -852383079, now seen corresponding path program 1 times [2021-01-06 11:45:35,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:35,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016378573] [2021-01-06 11:45:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:35,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016378573] [2021-01-06 11:45:35,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:35,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:35,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614671496] [2021-01-06 11:45:35,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:35,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:35,929 INFO L87 Difference]: Start difference. First operand 903 states and 1338 transitions. Second operand 4 states. [2021-01-06 11:45:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:36,415 INFO L93 Difference]: Finished difference Result 1853 states and 2738 transitions. [2021-01-06 11:45:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:36,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2021-01-06 11:45:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:36,417 INFO L225 Difference]: With dead ends: 1853 [2021-01-06 11:45:36,417 INFO L226 Difference]: Without dead ends: 971 [2021-01-06 11:45:36,417 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:45:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-01-06 11:45:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 927. [2021-01-06 11:45:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2021-01-06 11:45:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1366 transitions. [2021-01-06 11:45:36,450 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1366 transitions. Word has length 163 [2021-01-06 11:45:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:36,451 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1366 transitions. [2021-01-06 11:45:36,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1366 transitions. [2021-01-06 11:45:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-06 11:45:36,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:36,452 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:36,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-01-06 11:45:36,452 INFO L429 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1695721119, now seen corresponding path program 1 times [2021-01-06 11:45:36,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:36,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940072606] [2021-01-06 11:45:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:36,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940072606] [2021-01-06 11:45:36,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:36,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:36,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554641879] [2021-01-06 11:45:36,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:36,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:36,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:36,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:36,680 INFO L87 Difference]: Start difference. First operand 927 states and 1366 transitions. Second operand 5 states. [2021-01-06 11:45:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:37,546 INFO L93 Difference]: Finished difference Result 1991 states and 2949 transitions. [2021-01-06 11:45:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:45:37,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2021-01-06 11:45:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:37,548 INFO L225 Difference]: With dead ends: 1991 [2021-01-06 11:45:37,548 INFO L226 Difference]: Without dead ends: 1085 [2021-01-06 11:45:37,549 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:45:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-01-06 11:45:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 993. [2021-01-06 11:45:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2021-01-06 11:45:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1484 transitions. [2021-01-06 11:45:37,584 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1484 transitions. Word has length 163 [2021-01-06 11:45:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:37,584 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1484 transitions. [2021-01-06 11:45:37,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1484 transitions. [2021-01-06 11:45:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 11:45:37,585 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:37,586 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:37,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-01-06 11:45:37,586 INFO L429 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1822233353, now seen corresponding path program 1 times [2021-01-06 11:45:37,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:37,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666272808] [2021-01-06 11:45:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 11:45:37,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666272808] [2021-01-06 11:45:37,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:37,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:37,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610792742] [2021-01-06 11:45:37,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:37,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:37,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:37,677 INFO L87 Difference]: Start difference. First operand 993 states and 1484 transitions. Second operand 4 states. [2021-01-06 11:45:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:38,190 INFO L93 Difference]: Finished difference Result 1999 states and 2987 transitions. [2021-01-06 11:45:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:38,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2021-01-06 11:45:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:38,192 INFO L225 Difference]: With dead ends: 1999 [2021-01-06 11:45:38,192 INFO L226 Difference]: Without dead ends: 1023 [2021-01-06 11:45:38,193 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:45:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2021-01-06 11:45:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 991. [2021-01-06 11:45:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2021-01-06 11:45:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1480 transitions. [2021-01-06 11:45:38,237 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1480 transitions. Word has length 164 [2021-01-06 11:45:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:38,237 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1480 transitions. [2021-01-06 11:45:38,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1480 transitions. [2021-01-06 11:45:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 11:45:38,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:38,238 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:38,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-01-06 11:45:38,239 INFO L429 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1484162341, now seen corresponding path program 1 times [2021-01-06 11:45:38,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:38,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147374493] [2021-01-06 11:45:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:38,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147374493] [2021-01-06 11:45:38,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:38,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:38,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057954119] [2021-01-06 11:45:38,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:38,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:38,332 INFO L87 Difference]: Start difference. First operand 991 states and 1480 transitions. Second operand 4 states. [2021-01-06 11:45:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:38,876 INFO L93 Difference]: Finished difference Result 2015 states and 3008 transitions. [2021-01-06 11:45:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:38,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 11:45:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:38,878 INFO L225 Difference]: With dead ends: 2015 [2021-01-06 11:45:38,879 INFO L226 Difference]: Without dead ends: 1045 [2021-01-06 11:45:38,879 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:45:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-01-06 11:45:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 991. [2021-01-06 11:45:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2021-01-06 11:45:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1478 transitions. [2021-01-06 11:45:38,915 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1478 transitions. Word has length 167 [2021-01-06 11:45:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:38,915 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1478 transitions. [2021-01-06 11:45:38,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1478 transitions. [2021-01-06 11:45:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-01-06 11:45:38,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:38,916 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:38,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-01-06 11:45:38,917 INFO L429 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1066842888, now seen corresponding path program 1 times [2021-01-06 11:45:38,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:38,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999232362] [2021-01-06 11:45:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:45:39,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999232362] [2021-01-06 11:45:39,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:39,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820568141] [2021-01-06 11:45:39,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:39,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:39,007 INFO L87 Difference]: Start difference. First operand 991 states and 1478 transitions. Second operand 4 states. [2021-01-06 11:45:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:39,577 INFO L93 Difference]: Finished difference Result 2011 states and 3000 transitions. [2021-01-06 11:45:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:39,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2021-01-06 11:45:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:39,580 INFO L225 Difference]: With dead ends: 2011 [2021-01-06 11:45:39,580 INFO L226 Difference]: Without dead ends: 1041 [2021-01-06 11:45:39,580 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:45:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-01-06 11:45:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 991. [2021-01-06 11:45:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2021-01-06 11:45:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1476 transitions. [2021-01-06 11:45:39,616 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1476 transitions. Word has length 168 [2021-01-06 11:45:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:39,616 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1476 transitions. [2021-01-06 11:45:39,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1476 transitions. [2021-01-06 11:45:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 11:45:39,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:39,617 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, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:39,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-01-06 11:45:39,617 INFO L429 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1385917459, now seen corresponding path program 1 times [2021-01-06 11:45:39,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:39,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548152278] [2021-01-06 11:45:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:40,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548152278] [2021-01-06 11:45:40,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580723240] [2021-01-06 11:45:40,168 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:45:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:40,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-06 11:45:40,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:40,753 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:40,754 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2021-01-06 11:45:40,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:40,914 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 11:45:40,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:40,918 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2021-01-06 11:45:40,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:40,974 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2021-01-06 11:45:40,976 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,051 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2021-01-06 11:45:41,054 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,130 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:41,131 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2021-01-06 11:45:41,134 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,154 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,154 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2021-01-06 11:45:41,230 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:41,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2021-01-06 11:45:41,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,246 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:41,352 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:41,353 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2021-01-06 11:45:41,356 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,368 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,368 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:41,382 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2021-01-06 11:45:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,394 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-01-06 11:45:41,396 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,453 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:41,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2021-01-06 11:45:41,515 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,538 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,538 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2021-01-06 11:45:41,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,616 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:45:41,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,631 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2021-01-06 11:45:41,710 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:41,711 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2021-01-06 11:45:41,713 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,724 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,724 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:41,772 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:41,773 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2021-01-06 11:45:41,776 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:41,790 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:41,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:41,869 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2021-01-06 11:45:41,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:41,875 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-01-06 11:45:41,877 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:41,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:42,149 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-06 11:45:42,150 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2021-01-06 11:45:42,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2021-01-06 11:45:42,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:42,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:42,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:42,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:42,178 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:42,180 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:42,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2021-01-06 11:45:42,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 11:45:42,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:42,196 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:42,200 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:42,203 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:42,218 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:42,249 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2021-01-06 11:45:42,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:42,252 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2021-01-06 11:45:42,373 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2021-01-06 11:45:42,379 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:42,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:42,705 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2021-01-06 11:45:42,706 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2021-01-06 11:45:42,707 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2021-01-06 11:45:42,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:45:42,716 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:42,720 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:42,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:42,748 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:42,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2021-01-06 11:45:43,022 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2021-01-06 11:45:43,028 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:45:43,029 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,271 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-01-06 11:45:43,272 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2021-01-06 11:45:43,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2021-01-06 11:45:43,279 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-06 11:45:43,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:45:43,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-06 11:45:43,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:43,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:45:43,283 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:43,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:45:43,284 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:43,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:45:43,285 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:45:43,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:45:43,287 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,295 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,313 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:43,314 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2021-01-06 11:45:43,375 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_180|], 20=[|v_#memory_$Pointer$.base_171|]} [2021-01-06 11:45:43,381 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:45:43,382 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:43,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,409 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2021-01-06 11:45:43,411 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:43,508 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,508 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2021-01-06 11:45:43,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:45:43,517 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:43,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:45:43,518 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:43,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:45:43,519 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:45:43,520 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:45:43,521 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,525 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,526 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,527 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,529 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,530 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,532 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,534 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:43,538 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,538 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,539 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:43,542 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:43,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:43,545 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,546 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,548 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,549 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,551 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,553 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:43,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,555 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,582 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:43,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,584 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,585 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,588 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:43,589 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:43,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:43,592 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,592 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,593 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,594 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,595 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,599 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,602 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,604 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:43,609 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,610 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,614 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,615 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,616 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,617 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,623 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,624 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,626 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,627 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,628 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,632 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,634 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,635 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,638 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:43,639 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,641 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2021-01-06 11:45:43,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:43,643 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,644 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:43,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:43,647 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,648 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2021-01-06 11:45:43,649 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:43,650 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:43,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:43,654 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:43,657 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:43,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,667 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:43,667 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2021-01-06 11:45:43,723 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:45:43,723 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-01-06 11:45:43,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:43,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2021-01-06 11:45:43,975 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:43,976 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2021-01-06 11:45:43,978 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:43,984 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:43,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2021-01-06 11:45:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 130 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:44,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:44,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-01-06 11:45:44,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980841264] [2021-01-06 11:45:44,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 11:45:44,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 11:45:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:45:44,342 INFO L87 Difference]: Start difference. First operand 991 states and 1476 transitions. Second operand 16 states. [2021-01-06 11:45:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:52,018 INFO L93 Difference]: Finished difference Result 3749 states and 5545 transitions. [2021-01-06 11:45:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:45:52,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2021-01-06 11:45:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:52,029 INFO L225 Difference]: With dead ends: 3749 [2021-01-06 11:45:52,030 INFO L226 Difference]: Without dead ends: 2779 [2021-01-06 11:45:52,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2021-01-06 11:45:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2021-01-06 11:45:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 1849. [2021-01-06 11:45:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2021-01-06 11:45:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2755 transitions. [2021-01-06 11:45:52,181 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2755 transitions. Word has length 170 [2021-01-06 11:45:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:52,181 INFO L481 AbstractCegarLoop]: Abstraction has 1849 states and 2755 transitions. [2021-01-06 11:45:52,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 11:45:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2755 transitions. [2021-01-06 11:45:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 11:45:52,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:52,185 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] [2021-01-06 11:45:52,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2021-01-06 11:45:52,401 INFO L429 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1256088961, now seen corresponding path program 1 times [2021-01-06 11:45:52,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:52,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220996903] [2021-01-06 11:45:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:52,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220996903] [2021-01-06 11:45:52,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:52,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:52,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639313390] [2021-01-06 11:45:52,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:52,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:52,527 INFO L87 Difference]: Start difference. First operand 1849 states and 2755 transitions. Second operand 4 states. [2021-01-06 11:45:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:53,291 INFO L93 Difference]: Finished difference Result 2947 states and 4377 transitions. [2021-01-06 11:45:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:53,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2021-01-06 11:45:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:53,296 INFO L225 Difference]: With dead ends: 2947 [2021-01-06 11:45:53,297 INFO L226 Difference]: Without dead ends: 1977 [2021-01-06 11:45:53,298 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:45:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-01-06 11:45:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1849. [2021-01-06 11:45:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2021-01-06 11:45:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2751 transitions. [2021-01-06 11:45:53,432 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2751 transitions. Word has length 172 [2021-01-06 11:45:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:53,432 INFO L481 AbstractCegarLoop]: Abstraction has 1849 states and 2751 transitions. [2021-01-06 11:45:53,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2751 transitions. [2021-01-06 11:45:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-01-06 11:45:53,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:53,435 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] [2021-01-06 11:45:53,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-01-06 11:45:53,435 INFO L429 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1782335756, now seen corresponding path program 1 times [2021-01-06 11:45:53,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:53,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918492174] [2021-01-06 11:45:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:53,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918492174] [2021-01-06 11:45:53,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:53,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:53,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701731006] [2021-01-06 11:45:53,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:53,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:53,535 INFO L87 Difference]: Start difference. First operand 1849 states and 2751 transitions. Second operand 4 states. [2021-01-06 11:45:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:54,241 INFO L93 Difference]: Finished difference Result 2947 states and 4371 transitions. [2021-01-06 11:45:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:54,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2021-01-06 11:45:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:54,245 INFO L225 Difference]: With dead ends: 2947 [2021-01-06 11:45:54,245 INFO L226 Difference]: Without dead ends: 1977 [2021-01-06 11:45:54,247 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:45:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-01-06 11:45:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1849. [2021-01-06 11:45:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2021-01-06 11:45:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2747 transitions. [2021-01-06 11:45:54,406 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2747 transitions. Word has length 173 [2021-01-06 11:45:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:54,406 INFO L481 AbstractCegarLoop]: Abstraction has 1849 states and 2747 transitions. [2021-01-06 11:45:54,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2747 transitions. [2021-01-06 11:45:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-01-06 11:45:54,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:54,410 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] [2021-01-06 11:45:54,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-01-06 11:45:54,410 INFO L429 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -931283652, now seen corresponding path program 1 times [2021-01-06 11:45:54,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:54,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29780331] [2021-01-06 11:45:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:54,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29780331] [2021-01-06 11:45:54,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:54,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:54,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825909143] [2021-01-06 11:45:54,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:54,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:54,522 INFO L87 Difference]: Start difference. First operand 1849 states and 2747 transitions. Second operand 4 states. [2021-01-06 11:45:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:55,340 INFO L93 Difference]: Finished difference Result 2947 states and 4365 transitions. [2021-01-06 11:45:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:55,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2021-01-06 11:45:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:55,346 INFO L225 Difference]: With dead ends: 2947 [2021-01-06 11:45:55,346 INFO L226 Difference]: Without dead ends: 1977 [2021-01-06 11:45:55,348 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:45:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-01-06 11:45:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1849. [2021-01-06 11:45:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2021-01-06 11:45:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2743 transitions. [2021-01-06 11:45:55,483 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2743 transitions. Word has length 174 [2021-01-06 11:45:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:55,485 INFO L481 AbstractCegarLoop]: Abstraction has 1849 states and 2743 transitions. [2021-01-06 11:45:55,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2743 transitions. [2021-01-06 11:45:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 11:45:55,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:55,487 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] [2021-01-06 11:45:55,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-01-06 11:45:55,488 INFO L429 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 234465615, now seen corresponding path program 1 times [2021-01-06 11:45:55,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:55,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261536153] [2021-01-06 11:45:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:55,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261536153] [2021-01-06 11:45:55,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:55,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:55,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705083705] [2021-01-06 11:45:55,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:55,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:55,598 INFO L87 Difference]: Start difference. First operand 1849 states and 2743 transitions. Second operand 4 states. [2021-01-06 11:45:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:56,324 INFO L93 Difference]: Finished difference Result 2927 states and 4335 transitions. [2021-01-06 11:45:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:56,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2021-01-06 11:45:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:56,328 INFO L225 Difference]: With dead ends: 2927 [2021-01-06 11:45:56,328 INFO L226 Difference]: Without dead ends: 1957 [2021-01-06 11:45:56,329 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:45:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2021-01-06 11:45:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1849. [2021-01-06 11:45:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2021-01-06 11:45:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2739 transitions. [2021-01-06 11:45:56,444 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2739 transitions. Word has length 175 [2021-01-06 11:45:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:56,444 INFO L481 AbstractCegarLoop]: Abstraction has 1849 states and 2739 transitions. [2021-01-06 11:45:56,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2739 transitions. [2021-01-06 11:45:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 11:45:56,447 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:56,447 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:56,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-01-06 11:45:56,447 INFO L429 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:56,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash -558765564, now seen corresponding path program 1 times [2021-01-06 11:45:56,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:56,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642345190] [2021-01-06 11:45:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-01-06 11:45:56,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642345190] [2021-01-06 11:45:56,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:56,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:56,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277642442] [2021-01-06 11:45:56,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:56,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:56,582 INFO L87 Difference]: Start difference. First operand 1849 states and 2739 transitions. Second operand 5 states. [2021-01-06 11:45:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:57,479 INFO L93 Difference]: Finished difference Result 4207 states and 6285 transitions. [2021-01-06 11:45:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:57,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 11:45:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:57,482 INFO L225 Difference]: With dead ends: 4207 [2021-01-06 11:45:57,483 INFO L226 Difference]: Without dead ends: 2379 [2021-01-06 11:45:57,484 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:45:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2021-01-06 11:45:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2007. [2021-01-06 11:45:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2021-01-06 11:45:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3025 transitions. [2021-01-06 11:45:57,623 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3025 transitions. Word has length 178 [2021-01-06 11:45:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:57,623 INFO L481 AbstractCegarLoop]: Abstraction has 2007 states and 3025 transitions. [2021-01-06 11:45:57,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3025 transitions. [2021-01-06 11:45:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:45:57,625 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:57,625 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] [2021-01-06 11:45:57,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-01-06 11:45:57,625 INFO L429 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash 971087660, now seen corresponding path program 1 times [2021-01-06 11:45:57,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:57,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072488598] [2021-01-06 11:45:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-01-06 11:45:57,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072488598] [2021-01-06 11:45:57,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:57,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:57,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902350998] [2021-01-06 11:45:57,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:57,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:57,769 INFO L87 Difference]: Start difference. First operand 2007 states and 3025 transitions. Second operand 5 states. [2021-01-06 11:45:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:58,769 INFO L93 Difference]: Finished difference Result 4411 states and 6675 transitions. [2021-01-06 11:45:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:58,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2021-01-06 11:45:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:58,773 INFO L225 Difference]: With dead ends: 4411 [2021-01-06 11:45:58,773 INFO L226 Difference]: Without dead ends: 2425 [2021-01-06 11:45:58,774 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:45:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2021-01-06 11:45:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2115. [2021-01-06 11:45:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2021-01-06 11:45:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 3245 transitions. [2021-01-06 11:45:58,913 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 3245 transitions. Word has length 179 [2021-01-06 11:45:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:58,914 INFO L481 AbstractCegarLoop]: Abstraction has 2115 states and 3245 transitions. [2021-01-06 11:45:58,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 3245 transitions. [2021-01-06 11:45:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 11:45:58,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:58,917 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:58,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-01-06 11:45:58,917 INFO L429 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash -759436381, now seen corresponding path program 1 times [2021-01-06 11:45:58,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:58,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179212454] [2021-01-06 11:45:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:45:59,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179212454] [2021-01-06 11:45:59,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441429885] [2021-01-06 11:45:59,740 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:46:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:00,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-06 11:46:00,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:00,185 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-01-06 11:46:00,187 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,244 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_179|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2021-01-06 11:46:00,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,283 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2021-01-06 11:46:00,284 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,357 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2021-01-06 11:46:00,359 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,380 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,437 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:46:00,438 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2021-01-06 11:46:00,439 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,455 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:10 [2021-01-06 11:46:00,491 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:46:00,492 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:00,493 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,496 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:46:00,533 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:46:00,533 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:00,535 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,538 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:46:00,549 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:00,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,596 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-01-06 11:46:00,597 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-01-06 11:46:00,599 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,610 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:46:00,654 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:46:00,655 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:00,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,659 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:46:00,678 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:46:00,678 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:00,680 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,683 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:46:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:00,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 30 treesize of output 14 [2021-01-06 11:46:00,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,748 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:46:00,749 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:00,750 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:46:00,786 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 2=[|v_#memory_$Pointer$.base_186|]} [2021-01-06 11:46:00,790 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-01-06 11:46:00,791 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:00,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,825 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,826 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2021-01-06 11:46:00,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:46:00,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:46:00,830 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,834 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2021-01-06 11:46:00,846 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:00,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,916 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-01-06 11:46:00,917 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-01-06 11:46:00,919 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:00,928 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:00,928 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:46:00,968 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 2=[|v_#memory_$Pointer$.base_188|]} [2021-01-06 11:46:00,973 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-01-06 11:46:00,974 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:00,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,011 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,012 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2021-01-06 11:46:01,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:46:01,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:46:01,016 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2021-01-06 11:46:01,039 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_189|, |v_#memory_$Pointer$.base_177|], 6=[|v_#memory_$Pointer$.base_178|]} [2021-01-06 11:46:01,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,059 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2021-01-06 11:46:01,060 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,134 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 80 [2021-01-06 11:46:01,207 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,268 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-06 11:46:01,272 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,311 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:46:01,420 INFO L348 Elim1Store]: treesize reduction 68, result has 47.3 percent of original size [2021-01-06 11:46:01,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 98 [2021-01-06 11:46:01,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 1] term [2021-01-06 11:46:01,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:46:01,426 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,451 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,451 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:275, output treesize:50 [2021-01-06 11:46:01,561 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_190|, |v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_int_183|]} [2021-01-06 11:46:01,566 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2021-01-06 11:46:01,568 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,589 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-01-06 11:46:01,590 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,624 INFO L348 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-01-06 11:46:01,625 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2021-01-06 11:46:01,627 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,640 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:46:01,640 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:38 [2021-01-06 11:46:01,879 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:46:01,880 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2021-01-06 11:46:01,882 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:46:01,890 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:46:01,890 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2021-01-06 11:46:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 11:46:02,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:46:02,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-01-06 11:46:02,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713195817] [2021-01-06 11:46:02,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:46:02,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:46:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:46:02,152 INFO L87 Difference]: Start difference. First operand 2115 states and 3245 transitions. Second operand 13 states. [2021-01-06 11:46:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:11,267 INFO L93 Difference]: Finished difference Result 6589 states and 10075 transitions. [2021-01-06 11:46:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:46:11,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 192 [2021-01-06 11:46:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:11,273 INFO L225 Difference]: With dead ends: 6589 [2021-01-06 11:46:11,273 INFO L226 Difference]: Without dead ends: 4495 [2021-01-06 11:46:11,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-01-06 11:46:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2021-01-06 11:46:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3349. [2021-01-06 11:46:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3349 states. [2021-01-06 11:46:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 5285 transitions. [2021-01-06 11:46:11,491 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 5285 transitions. Word has length 192 [2021-01-06 11:46:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:11,491 INFO L481 AbstractCegarLoop]: Abstraction has 3349 states and 5285 transitions. [2021-01-06 11:46:11,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:46:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 5285 transitions. [2021-01-06 11:46:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 11:46:11,494 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:11,495 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:11,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:11,709 INFO L429 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1156893847, now seen corresponding path program 1 times [2021-01-06 11:46:11,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:11,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821462298] [2021-01-06 11:46:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:11,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:11,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:12,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:46:12,051 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:46:12,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-01-06 11:46:12,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:46:12 BoogieIcfgContainer [2021-01-06 11:46:12,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:46:12,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:46:12,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:46:12,281 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:46:12,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:44:30" (3/4) ... [2021-01-06 11:46:12,288 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:46:12,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:46:12,289 INFO L168 Benchmark]: Toolchain (without parser) took 105023.54 ms. Allocated memory was 153.1 MB in the beginning and 587.2 MB in the end (delta: 434.1 MB). Free memory was 126.4 MB in the beginning and 304.7 MB in the end (delta: -178.4 MB). Peak memory consumption was 256.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:12,289 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 153.1 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:46:12,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.79 ms. Allocated memory is still 153.1 MB. Free memory was 126.0 MB in the beginning and 94.2 MB in the end (delta: 31.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:12,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.44 ms. Allocated memory is still 153.1 MB. Free memory was 94.2 MB in the beginning and 89.5 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:46:12,291 INFO L168 Benchmark]: Boogie Preprocessor took 122.83 ms. Allocated memory is still 153.1 MB. Free memory was 89.5 MB in the beginning and 82.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:12,291 INFO L168 Benchmark]: RCFGBuilder took 1693.46 ms. Allocated memory is still 153.1 MB. Free memory was 82.5 MB in the beginning and 128.5 MB in the end (delta: -46.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:12,293 INFO L168 Benchmark]: TraceAbstraction took 102219.12 ms. Allocated memory was 153.1 MB in the beginning and 587.2 MB in the end (delta: 434.1 MB). Free memory was 128.0 MB in the beginning and 305.3 MB in the end (delta: -177.3 MB). Peak memory consumption was 256.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:12,293 INFO L168 Benchmark]: Witness Printer took 7.41 ms. Allocated memory is still 587.2 MB. Free memory was 305.3 MB in the beginning and 304.7 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:46:12,297 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.31 ms. Allocated memory is still 153.1 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 864.79 ms. Allocated memory is still 153.1 MB. Free memory was 126.0 MB in the beginning and 94.2 MB in the end (delta: 31.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.44 ms. Allocated memory is still 153.1 MB. Free memory was 94.2 MB in the beginning and 89.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 122.83 ms. Allocated memory is still 153.1 MB. Free memory was 89.5 MB in the beginning and 82.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1693.46 ms. Allocated memory is still 153.1 MB. Free memory was 82.5 MB in the beginning and 128.5 MB in the end (delta: -46.0 MB). Peak memory consumption was 40.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 102219.12 ms. Allocated memory was 153.1 MB in the beginning and 587.2 MB in the end (delta: 434.1 MB). Free memory was 128.0 MB in the beginning and 305.3 MB in the end (delta: -177.3 MB). Peak memory consumption was 256.8 MB. Max. memory is 8.0 GB. * Witness Printer took 7.41 ms. Allocated memory is still 587.2 MB. Free memory was 305.3 MB in the beginning and 304.7 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1764]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1723] EXPR s->s3 [L1723] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1723] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1752] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1723] EXPR s->s3 [L1723] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1723] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1752] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1600] EXPR s->session [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.new_cipher [L1600] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1601] COND FALSE !(! tmp___9) [L1607] ret = __VERIFIER_nondet_int() [L1608] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1611] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1614] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={6:0}] [L1621] COND FALSE !(ret <= 0) [L1626] s->state = 8672 [L1627] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1628] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1723] EXPR s->s3 [L1723] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1723] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1752] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1637] ret = __VERIFIER_nondet_int() [L1638] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1641] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1644] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={6:0}] [L1651] COND FALSE !(ret <= 0) [L1656] s->state = 8448 [L1657] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1657] COND TRUE s->hit [L1658] EXPR s->s3 [L1658] (s->s3)->tmp.next_state = 8640 [L1662] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1723] EXPR s->s3 [L1723] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1723] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1752] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1723] EXPR s->s3 [L1723] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1723] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1752] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND TRUE s->state == 8640 [L1572] ret = __VERIFIER_nondet_int() [L1573] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1576] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1579] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={6:0}] [L1764] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 156 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 101.9s, OverallIterations: 121, TraceHistogramMax: 7, AutomataDifference: 78.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28311 SDtfs, 10490 SDslu, 46151 SDs, 0 SdLazy, 28968 SolverSat, 1591 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 606 SyntacticMatches, 45 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3349occurred in iteration=120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 120 MinimizatonAttempts, 9726 StatesRemovedByMinimization, 118 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 15260 NumberOfCodeBlocks, 15260 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 14939 ConstructedInterpolants, 117 QuantifiedInterpolants, 8383908 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1349 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 122 InterpolantComputations, 118 PerfectInterpolantSequences, 15888/16519 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...