/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.14.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:43:42,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:43:42,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:43:42,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:43:42,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:43:42,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:43:42,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:43:42,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:43:42,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:43:42,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:43:42,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:43:42,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:43:42,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:43:42,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:43:42,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:43:42,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:43:42,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:43:42,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:43:42,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:43:42,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:43:42,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:43:42,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:43:42,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:43:42,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:43:42,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:43:42,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:43:42,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:43:42,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:43:42,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:43:42,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:43:42,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:43:42,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:43:42,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:43:42,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:43:42,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:43:42,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:43:42,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:43:42,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:43:42,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:43:42,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:43:42,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:43:42,963 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:43:42,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:43:42,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:43:42,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:43:42,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:43:42,994 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:43:42,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:43:42,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:43:42,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:43:42,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:43:42,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:43:42,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:43:42,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:43:42,996 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:43:42,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:43:42,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:43:42,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:43:42,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:43:42,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:43:42,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:43:42,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:43:42,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:43:42,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:43:42,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:43:42,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:43:42,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:43:42,999 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:43:43,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:43:43,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:43:43,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:43:43,384 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:43:43,385 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:43:43,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2021-01-06 11:43:43,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bf2ed0daa/6685172fcf824709985e4c092512fcdd/FLAG3b7cdfa8d [2021-01-06 11:43:44,252 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:43:44,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2021-01-06 11:43:44,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bf2ed0daa/6685172fcf824709985e4c092512fcdd/FLAG3b7cdfa8d [2021-01-06 11:43:44,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bf2ed0daa/6685172fcf824709985e4c092512fcdd [2021-01-06 11:43:44,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:43:44,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:43:44,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:43:44,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:43:44,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:43:44,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:43:44" (1/1) ... [2021-01-06 11:43:44,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602642e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:44, skipping insertion in model container [2021-01-06 11:43:44,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:43:44" (1/1) ... [2021-01-06 11:43:44,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:43:44,559 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: 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: 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: 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:43:44,982 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.14.i.cil-2.c[75079,75092] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:43:45,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:43:45,037 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: 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: 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: 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:43:45,283 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.14.i.cil-2.c[75079,75092] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:43:45,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:43:45,319 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:43:45,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45 WrapperNode [2021-01-06 11:43:45,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:43:45,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:43:45,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:43:45,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:43:45,330 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:43:45" (1/1) ... [2021-01-06 11:43:45,385 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:43:45" (1/1) ... [2021-01-06 11:43:45,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:43:45,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:43:45,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:43:45,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:43:45,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (1/1) ... [2021-01-06 11:43:45,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:43:45,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:43:45,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:43:45,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:43:45,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (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:43:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:43:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:43:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:43:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:43:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:43:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:43:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:43:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:43:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:43:45,914 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:43:47,076 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:43:47,076 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:43:47,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:43:47,087 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:43:47,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:43:47 BoogieIcfgContainer [2021-01-06 11:43:47,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:43:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:43:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:43:47,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:43:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:43:44" (1/3) ... [2021-01-06 11:43:47,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e42d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:43:47, skipping insertion in model container [2021-01-06 11:43:47,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:43:45" (2/3) ... [2021-01-06 11:43:47,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e42d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:43:47, skipping insertion in model container [2021-01-06 11:43:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:43:47" (3/3) ... [2021-01-06 11:43:47,099 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2021-01-06 11:43:47,106 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:43:47,110 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:43:47,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:43:47,158 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:43:47,158 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:43:47,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:43:47,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:43:47,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:43:47,159 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:43:47,159 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:43:47,159 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:43:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2021-01-06 11:43:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:43:47,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:47,190 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] [2021-01-06 11:43:47,190 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 557484008, now seen corresponding path program 1 times [2021-01-06 11:43:47,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:47,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647015538] [2021-01-06 11:43:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:47,707 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:43:47,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647015538] [2021-01-06 11:43:47,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:47,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:47,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457823111] [2021-01-06 11:43:47,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:47,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:47,738 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2021-01-06 11:43:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:48,475 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2021-01-06 11:43:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:48,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2021-01-06 11:43:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:48,490 INFO L225 Difference]: With dead ends: 333 [2021-01-06 11:43:48,490 INFO L226 Difference]: Without dead ends: 168 [2021-01-06 11:43:48,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-06 11:43:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2021-01-06 11:43:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2021-01-06 11:43:48,546 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 42 [2021-01-06 11:43:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:48,547 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2021-01-06 11:43:48,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2021-01-06 11:43:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 11:43:48,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:48,550 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] [2021-01-06 11:43:48,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:43:48,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1860834976, now seen corresponding path program 1 times [2021-01-06 11:43:48,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:48,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540703451] [2021-01-06 11:43:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:48,747 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:43:48,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540703451] [2021-01-06 11:43:48,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:48,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:48,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726871611] [2021-01-06 11:43:48,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:48,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:48,752 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand 4 states. [2021-01-06 11:43:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:49,381 INFO L93 Difference]: Finished difference Result 300 states and 463 transitions. [2021-01-06 11:43:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:49,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2021-01-06 11:43:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:49,388 INFO L225 Difference]: With dead ends: 300 [2021-01-06 11:43:49,389 INFO L226 Difference]: Without dead ends: 168 [2021-01-06 11:43:49,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-01-06 11:43:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2021-01-06 11:43:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2021-01-06 11:43:49,422 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 55 [2021-01-06 11:43:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:49,423 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2021-01-06 11:43:49,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2021-01-06 11:43:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:43:49,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:49,431 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] [2021-01-06 11:43:49,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:43:49,432 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2101358450, now seen corresponding path program 1 times [2021-01-06 11:43:49,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:49,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194825263] [2021-01-06 11:43:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:49,571 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:43:49,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194825263] [2021-01-06 11:43:49,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:49,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:49,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708817193] [2021-01-06 11:43:49,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:49,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:49,574 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand 4 states. [2021-01-06 11:43:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:50,065 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2021-01-06 11:43:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:50,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 11:43:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:50,069 INFO L225 Difference]: With dead ends: 299 [2021-01-06 11:43:50,069 INFO L226 Difference]: Without dead ends: 167 [2021-01-06 11:43:50,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-06 11:43:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2021-01-06 11:43:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2021-01-06 11:43:50,098 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 56 [2021-01-06 11:43:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:50,100 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2021-01-06 11:43:50,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2021-01-06 11:43:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:43:50,102 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:50,102 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] [2021-01-06 11:43:50,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:43:50,103 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1331085059, now seen corresponding path program 1 times [2021-01-06 11:43:50,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:50,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350353454] [2021-01-06 11:43:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:50,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350353454] [2021-01-06 11:43:50,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:50,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:50,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654289408] [2021-01-06 11:43:50,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:50,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:50,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:50,249 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand 4 states. [2021-01-06 11:43:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:50,729 INFO L93 Difference]: Finished difference Result 297 states and 458 transitions. [2021-01-06 11:43:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:50,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 11:43:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:50,731 INFO L225 Difference]: With dead ends: 297 [2021-01-06 11:43:50,731 INFO L226 Difference]: Without dead ends: 165 [2021-01-06 11:43:50,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-01-06 11:43:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2021-01-06 11:43:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2021-01-06 11:43:50,751 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 56 [2021-01-06 11:43:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:50,753 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2021-01-06 11:43:50,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2021-01-06 11:43:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:43:50,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:50,756 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] [2021-01-06 11:43:50,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:43:50,757 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:50,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:50,757 INFO L82 PathProgramCache]: Analyzing trace with hash 10231747, now seen corresponding path program 1 times [2021-01-06 11:43:50,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:50,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479791176] [2021-01-06 11:43:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:50,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479791176] [2021-01-06 11:43:50,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:50,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:50,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633820716] [2021-01-06 11:43:50,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:50,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:50,896 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand 4 states. [2021-01-06 11:43:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:51,355 INFO L93 Difference]: Finished difference Result 296 states and 456 transitions. [2021-01-06 11:43:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:51,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 11:43:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:51,358 INFO L225 Difference]: With dead ends: 296 [2021-01-06 11:43:51,358 INFO L226 Difference]: Without dead ends: 164 [2021-01-06 11:43:51,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-06 11:43:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-01-06 11:43:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2021-01-06 11:43:51,365 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 56 [2021-01-06 11:43:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:51,366 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2021-01-06 11:43:51,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2021-01-06 11:43:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:43:51,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:51,367 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] [2021-01-06 11:43:51,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:43:51,367 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1146098042, now seen corresponding path program 1 times [2021-01-06 11:43:51,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:51,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383015646] [2021-01-06 11:43:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:51,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383015646] [2021-01-06 11:43:51,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:51,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:51,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176843408] [2021-01-06 11:43:51,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:51,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:51,474 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand 4 states. [2021-01-06 11:43:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:51,959 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2021-01-06 11:43:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:51,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 11:43:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:51,962 INFO L225 Difference]: With dead ends: 296 [2021-01-06 11:43:51,962 INFO L226 Difference]: Without dead ends: 164 [2021-01-06 11:43:51,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-06 11:43:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-01-06 11:43:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2021-01-06 11:43:51,969 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 56 [2021-01-06 11:43:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:51,969 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2021-01-06 11:43:51,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2021-01-06 11:43:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 11:43:51,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:51,970 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] [2021-01-06 11:43:51,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:43:51,971 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash -618208905, now seen corresponding path program 1 times [2021-01-06 11:43:51,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:51,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195885399] [2021-01-06 11:43:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:52,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195885399] [2021-01-06 11:43:52,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:52,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:52,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800154146] [2021-01-06 11:43:52,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:52,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:52,039 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand 4 states. [2021-01-06 11:43:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:52,550 INFO L93 Difference]: Finished difference Result 296 states and 454 transitions. [2021-01-06 11:43:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:52,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 11:43:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:52,553 INFO L225 Difference]: With dead ends: 296 [2021-01-06 11:43:52,553 INFO L226 Difference]: Without dead ends: 164 [2021-01-06 11:43:52,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-06 11:43:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-01-06 11:43:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2021-01-06 11:43:52,560 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 57 [2021-01-06 11:43:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:52,560 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2021-01-06 11:43:52,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2021-01-06 11:43:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 11:43:52,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:52,561 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] [2021-01-06 11:43:52,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:43:52,562 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1098918603, now seen corresponding path program 1 times [2021-01-06 11:43:52,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:52,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633397953] [2021-01-06 11:43:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:52,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633397953] [2021-01-06 11:43:52,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:52,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:52,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755028580] [2021-01-06 11:43:52,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:52,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:52,633 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand 4 states. [2021-01-06 11:43:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:53,108 INFO L93 Difference]: Finished difference Result 296 states and 453 transitions. [2021-01-06 11:43:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:53,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 11:43:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:53,111 INFO L225 Difference]: With dead ends: 296 [2021-01-06 11:43:53,111 INFO L226 Difference]: Without dead ends: 164 [2021-01-06 11:43:53,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-06 11:43:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-01-06 11:43:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2021-01-06 11:43:53,118 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 58 [2021-01-06 11:43:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:53,118 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2021-01-06 11:43:53,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2021-01-06 11:43:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:43:53,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:53,120 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] [2021-01-06 11:43:53,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:43:53,120 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -442819246, now seen corresponding path program 1 times [2021-01-06 11:43:53,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:53,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604262552] [2021-01-06 11:43:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:53,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604262552] [2021-01-06 11:43:53,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:53,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:53,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017529912] [2021-01-06 11:43:53,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:53,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:53,192 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 4 states. [2021-01-06 11:43:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:53,594 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2021-01-06 11:43:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:53,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:43:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:53,596 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:43:53,597 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 11:43:53,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 11:43:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2021-01-06 11:43:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 11:43:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2021-01-06 11:43:53,603 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 59 [2021-01-06 11:43:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:53,603 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2021-01-06 11:43:53,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2021-01-06 11:43:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:43:53,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:53,604 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] [2021-01-06 11:43:53,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:43:53,605 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash 230179562, now seen corresponding path program 1 times [2021-01-06 11:43:53,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:53,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291704437] [2021-01-06 11:43:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:53,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291704437] [2021-01-06 11:43:53,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:53,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:53,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324172898] [2021-01-06 11:43:53,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:53,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:53,677 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand 4 states. [2021-01-06 11:43:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:54,175 INFO L93 Difference]: Finished difference Result 326 states and 500 transitions. [2021-01-06 11:43:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:54,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:43:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:54,178 INFO L225 Difference]: With dead ends: 326 [2021-01-06 11:43:54,178 INFO L226 Difference]: Without dead ends: 194 [2021-01-06 11:43:54,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-06 11:43:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2021-01-06 11:43:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2021-01-06 11:43:54,185 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 59 [2021-01-06 11:43:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:54,186 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2021-01-06 11:43:54,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2021-01-06 11:43:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:43:54,187 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:54,187 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] [2021-01-06 11:43:54,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:43:54,187 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1572577694, now seen corresponding path program 1 times [2021-01-06 11:43:54,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:54,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986620814] [2021-01-06 11:43:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:54,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986620814] [2021-01-06 11:43:54,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:54,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:54,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578062858] [2021-01-06 11:43:54,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:54,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:54,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:54,265 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand 4 states. [2021-01-06 11:43:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:54,726 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2021-01-06 11:43:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:54,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 11:43:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:54,729 INFO L225 Difference]: With dead ends: 348 [2021-01-06 11:43:54,729 INFO L226 Difference]: Without dead ends: 194 [2021-01-06 11:43:54,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-06 11:43:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2021-01-06 11:43:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 265 transitions. [2021-01-06 11:43:54,738 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 265 transitions. Word has length 72 [2021-01-06 11:43:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:54,738 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 265 transitions. [2021-01-06 11:43:54,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 265 transitions. [2021-01-06 11:43:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:43:54,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:54,739 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] [2021-01-06 11:43:54,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:43:54,740 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1255219216, now seen corresponding path program 1 times [2021-01-06 11:43:54,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:54,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824677397] [2021-01-06 11:43:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:54,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824677397] [2021-01-06 11:43:54,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:54,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:54,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031202149] [2021-01-06 11:43:54,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:54,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:54,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:54,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:54,810 INFO L87 Difference]: Start difference. First operand 173 states and 265 transitions. Second operand 4 states. [2021-01-06 11:43:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:55,275 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2021-01-06 11:43:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:55,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:43:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:55,277 INFO L225 Difference]: With dead ends: 347 [2021-01-06 11:43:55,277 INFO L226 Difference]: Without dead ends: 193 [2021-01-06 11:43:55,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-06 11:43:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2021-01-06 11:43:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2021-01-06 11:43:55,284 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 73 [2021-01-06 11:43:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:55,285 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2021-01-06 11:43:55,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2021-01-06 11:43:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:43:55,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:55,286 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] [2021-01-06 11:43:55,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:43:55,286 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash 392695429, now seen corresponding path program 1 times [2021-01-06 11:43:55,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:55,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838058521] [2021-01-06 11:43:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:55,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838058521] [2021-01-06 11:43:55,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:55,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:55,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075076913] [2021-01-06 11:43:55,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:55,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:55,357 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand 4 states. [2021-01-06 11:43:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:55,938 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2021-01-06 11:43:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:55,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:43:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:55,943 INFO L225 Difference]: With dead ends: 345 [2021-01-06 11:43:55,943 INFO L226 Difference]: Without dead ends: 191 [2021-01-06 11:43:55,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-06 11:43:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2021-01-06 11:43:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2021-01-06 11:43:55,958 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 73 [2021-01-06 11:43:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:55,960 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2021-01-06 11:43:55,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2021-01-06 11:43:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:43:55,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:55,961 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] [2021-01-06 11:43:55,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:43:55,962 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -928157883, now seen corresponding path program 1 times [2021-01-06 11:43:55,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:55,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776699148] [2021-01-06 11:43:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:56,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776699148] [2021-01-06 11:43:56,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:56,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:56,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781416919] [2021-01-06 11:43:56,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:56,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:56,065 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand 4 states. [2021-01-06 11:43:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:56,540 INFO L93 Difference]: Finished difference Result 344 states and 527 transitions. [2021-01-06 11:43:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:56,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:43:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:56,542 INFO L225 Difference]: With dead ends: 344 [2021-01-06 11:43:56,542 INFO L226 Difference]: Without dead ends: 190 [2021-01-06 11:43:56,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-01-06 11:43:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2021-01-06 11:43:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2021-01-06 11:43:56,552 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 73 [2021-01-06 11:43:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:56,552 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2021-01-06 11:43:56,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2021-01-06 11:43:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:43:56,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:56,553 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] [2021-01-06 11:43:56,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:43:56,553 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 207708412, now seen corresponding path program 1 times [2021-01-06 11:43:56,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:56,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770384423] [2021-01-06 11:43:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:56,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770384423] [2021-01-06 11:43:56,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:56,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:56,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292836349] [2021-01-06 11:43:56,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:56,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:56,629 INFO L87 Difference]: Start difference. First operand 173 states and 262 transitions. Second operand 4 states. [2021-01-06 11:43:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:57,053 INFO L93 Difference]: Finished difference Result 344 states and 525 transitions. [2021-01-06 11:43:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:57,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:43:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:57,055 INFO L225 Difference]: With dead ends: 344 [2021-01-06 11:43:57,055 INFO L226 Difference]: Without dead ends: 190 [2021-01-06 11:43:57,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-01-06 11:43:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2021-01-06 11:43:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2021-01-06 11:43:57,062 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 73 [2021-01-06 11:43:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:57,062 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2021-01-06 11:43:57,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2021-01-06 11:43:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:43:57,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:57,063 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] [2021-01-06 11:43:57,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:43:57,064 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 356483637, now seen corresponding path program 1 times [2021-01-06 11:43:57,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:57,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865174877] [2021-01-06 11:43:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:57,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865174877] [2021-01-06 11:43:57,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:57,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:57,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383999194] [2021-01-06 11:43:57,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:57,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:57,124 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand 4 states. [2021-01-06 11:43:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:57,713 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2021-01-06 11:43:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:57,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:43:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:57,716 INFO L225 Difference]: With dead ends: 344 [2021-01-06 11:43:57,716 INFO L226 Difference]: Without dead ends: 190 [2021-01-06 11:43:57,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-01-06 11:43:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2021-01-06 11:43:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2021-01-06 11:43:57,723 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 74 [2021-01-06 11:43:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:57,723 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2021-01-06 11:43:57,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2021-01-06 11:43:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:43:57,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:57,725 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] [2021-01-06 11:43:57,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:43:57,726 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -948220873, now seen corresponding path program 1 times [2021-01-06 11:43:57,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:57,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309462667] [2021-01-06 11:43:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:57,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309462667] [2021-01-06 11:43:57,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:57,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:57,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508701901] [2021-01-06 11:43:57,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:57,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:57,817 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand 4 states. [2021-01-06 11:43:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:58,336 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2021-01-06 11:43:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:58,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:43:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:58,339 INFO L225 Difference]: With dead ends: 344 [2021-01-06 11:43:58,339 INFO L226 Difference]: Without dead ends: 190 [2021-01-06 11:43:58,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:43:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-01-06 11:43:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2021-01-06 11:43:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2021-01-06 11:43:58,345 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 75 [2021-01-06 11:43:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:58,345 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2021-01-06 11:43:58,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2021-01-06 11:43:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:43:58,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:58,347 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] [2021-01-06 11:43:58,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:43:58,347 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash -66156912, now seen corresponding path program 1 times [2021-01-06 11:43:58,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:58,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072850229] [2021-01-06 11:43:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:43:58,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072850229] [2021-01-06 11:43:58,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:58,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:58,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886076797] [2021-01-06 11:43:58,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:58,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:58,416 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand 4 states. [2021-01-06 11:43:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:58,824 INFO L93 Difference]: Finished difference Result 334 states and 506 transitions. [2021-01-06 11:43:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:58,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 11:43:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:58,827 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:43:58,828 INFO L226 Difference]: Without dead ends: 180 [2021-01-06 11:43:58,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-06 11:43:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2021-01-06 11:43:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-06 11:43:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2021-01-06 11:43:58,834 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 76 [2021-01-06 11:43:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:58,834 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2021-01-06 11:43:58,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2021-01-06 11:43:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:43:58,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:58,836 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:58,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:43:58,836 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1806658122, now seen corresponding path program 1 times [2021-01-06 11:43:58,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:58,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103016519] [2021-01-06 11:43:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:58,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103016519] [2021-01-06 11:43:58,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:58,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:58,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429459348] [2021-01-06 11:43:58,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:58,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:58,943 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 4 states. [2021-01-06 11:43:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:59,667 INFO L93 Difference]: Finished difference Result 438 states and 667 transitions. [2021-01-06 11:43:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:59,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:43:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:59,672 INFO L225 Difference]: With dead ends: 438 [2021-01-06 11:43:59,672 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:43:59,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:43:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:43:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2021-01-06 11:43:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-06 11:43:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 332 transitions. [2021-01-06 11:43:59,685 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 332 transitions. Word has length 81 [2021-01-06 11:43:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:59,686 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 332 transitions. [2021-01-06 11:43:59,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 332 transitions. [2021-01-06 11:43:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:43:59,687 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:59,687 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:59,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:43:59,688 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1116501876, now seen corresponding path program 1 times [2021-01-06 11:43:59,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:59,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286252205] [2021-01-06 11:43:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:59,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286252205] [2021-01-06 11:43:59,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:59,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:59,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684007725] [2021-01-06 11:43:59,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:59,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:59,801 INFO L87 Difference]: Start difference. First operand 214 states and 332 transitions. Second operand 4 states. [2021-01-06 11:44:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:00,361 INFO L93 Difference]: Finished difference Result 459 states and 719 transitions. [2021-01-06 11:44:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:00,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:44:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:00,363 INFO L225 Difference]: With dead ends: 459 [2021-01-06 11:44:00,363 INFO L226 Difference]: Without dead ends: 264 [2021-01-06 11:44:00,364 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:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-01-06 11:44:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2021-01-06 11:44:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-06 11:44:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2021-01-06 11:44:00,371 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 81 [2021-01-06 11:44:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:00,372 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2021-01-06 11:44:00,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2021-01-06 11:44:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 11:44:00,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:00,373 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:00,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:44:00,373 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash -413023236, now seen corresponding path program 1 times [2021-01-06 11:44:00,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:00,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614243664] [2021-01-06 11:44:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:00,468 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:00,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614243664] [2021-01-06 11:44:00,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:00,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:00,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847882184] [2021-01-06 11:44:00,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:00,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:00,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:00,470 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand 4 states. [2021-01-06 11:44:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:01,189 INFO L93 Difference]: Finished difference Result 520 states and 815 transitions. [2021-01-06 11:44:01,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:01,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 11:44:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:01,192 INFO L225 Difference]: With dead ends: 520 [2021-01-06 11:44:01,192 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:44:01,193 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:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:44:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2021-01-06 11:44:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 375 transitions. [2021-01-06 11:44:01,200 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 375 transitions. Word has length 82 [2021-01-06 11:44:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:01,200 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 375 transitions. [2021-01-06 11:44:01,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 375 transitions. [2021-01-06 11:44:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 11:44:01,202 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:01,202 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] [2021-01-06 11:44:01,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:44:01,202 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1433746002, now seen corresponding path program 1 times [2021-01-06 11:44:01,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:01,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444121640] [2021-01-06 11:44:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:01,275 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:01,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444121640] [2021-01-06 11:44:01,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:01,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:01,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140393299] [2021-01-06 11:44:01,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:01,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:01,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:01,278 INFO L87 Difference]: Start difference. First operand 239 states and 375 transitions. Second operand 4 states. [2021-01-06 11:44:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:01,956 INFO L93 Difference]: Finished difference Result 521 states and 815 transitions. [2021-01-06 11:44:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:01,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 11:44:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:01,959 INFO L225 Difference]: With dead ends: 521 [2021-01-06 11:44:01,959 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:44:01,960 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:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:44:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2021-01-06 11:44:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 374 transitions. [2021-01-06 11:44:01,968 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 374 transitions. Word has length 94 [2021-01-06 11:44:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:01,968 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 374 transitions. [2021-01-06 11:44:01,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 374 transitions. [2021-01-06 11:44:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 11:44:01,969 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:01,970 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] [2021-01-06 11:44:01,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:44:01,970 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1877646676, now seen corresponding path program 1 times [2021-01-06 11:44:01,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:01,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922803580] [2021-01-06 11:44:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:02,046 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:02,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922803580] [2021-01-06 11:44:02,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:02,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:02,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776787733] [2021-01-06 11:44:02,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:02,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:02,048 INFO L87 Difference]: Start difference. First operand 239 states and 374 transitions. Second operand 4 states. [2021-01-06 11:44:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:02,555 INFO L93 Difference]: Finished difference Result 485 states and 760 transitions. [2021-01-06 11:44:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:02,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 11:44:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:02,557 INFO L225 Difference]: With dead ends: 485 [2021-01-06 11:44:02,557 INFO L226 Difference]: Without dead ends: 265 [2021-01-06 11:44:02,558 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:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-01-06 11:44:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2021-01-06 11:44:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 373 transitions. [2021-01-06 11:44:02,565 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 373 transitions. Word has length 94 [2021-01-06 11:44:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:02,566 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 373 transitions. [2021-01-06 11:44:02,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 373 transitions. [2021-01-06 11:44:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:02,567 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:02,567 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] [2021-01-06 11:44:02,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:44:02,568 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1246404060, now seen corresponding path program 1 times [2021-01-06 11:44:02,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:02,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315218426] [2021-01-06 11:44:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:02,651 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:02,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315218426] [2021-01-06 11:44:02,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:02,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:02,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284991820] [2021-01-06 11:44:02,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:02,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:02,657 INFO L87 Difference]: Start difference. First operand 239 states and 373 transitions. Second operand 4 states. [2021-01-06 11:44:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:03,332 INFO L93 Difference]: Finished difference Result 520 states and 810 transitions. [2021-01-06 11:44:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:03,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:03,335 INFO L225 Difference]: With dead ends: 520 [2021-01-06 11:44:03,335 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 11:44:03,336 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:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 11:44:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2021-01-06 11:44:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 372 transitions. [2021-01-06 11:44:03,344 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 372 transitions. Word has length 95 [2021-01-06 11:44:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:03,344 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 372 transitions. [2021-01-06 11:44:03,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 372 transitions. [2021-01-06 11:44:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:03,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:03,346 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] [2021-01-06 11:44:03,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:44:03,346 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash 383880273, now seen corresponding path program 1 times [2021-01-06 11:44:03,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:03,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219488256] [2021-01-06 11:44:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:03,425 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:03,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219488256] [2021-01-06 11:44:03,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:03,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:03,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925120984] [2021-01-06 11:44:03,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:03,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:03,427 INFO L87 Difference]: Start difference. First operand 239 states and 372 transitions. Second operand 4 states. [2021-01-06 11:44:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:04,076 INFO L93 Difference]: Finished difference Result 518 states and 806 transitions. [2021-01-06 11:44:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:04,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:04,078 INFO L225 Difference]: With dead ends: 518 [2021-01-06 11:44:04,079 INFO L226 Difference]: Without dead ends: 298 [2021-01-06 11:44:04,079 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:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-01-06 11:44:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 239. [2021-01-06 11:44:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 371 transitions. [2021-01-06 11:44:04,087 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 371 transitions. Word has length 95 [2021-01-06 11:44:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:04,087 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 371 transitions. [2021-01-06 11:44:04,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 371 transitions. [2021-01-06 11:44:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:04,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:04,089 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] [2021-01-06 11:44:04,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:44:04,089 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -936973039, now seen corresponding path program 1 times [2021-01-06 11:44:04,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:04,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112319918] [2021-01-06 11:44:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:04,175 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:04,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112319918] [2021-01-06 11:44:04,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:04,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:04,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191825436] [2021-01-06 11:44:04,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:04,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:04,178 INFO L87 Difference]: Start difference. First operand 239 states and 371 transitions. Second operand 4 states. [2021-01-06 11:44:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:04,873 INFO L93 Difference]: Finished difference Result 517 states and 803 transitions. [2021-01-06 11:44:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:04,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:04,877 INFO L225 Difference]: With dead ends: 517 [2021-01-06 11:44:04,877 INFO L226 Difference]: Without dead ends: 297 [2021-01-06 11:44:04,878 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:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-06 11:44:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 239. [2021-01-06 11:44:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-06 11:44:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2021-01-06 11:44:04,884 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 95 [2021-01-06 11:44:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:04,885 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2021-01-06 11:44:04,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2021-01-06 11:44:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:04,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:04,886 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] [2021-01-06 11:44:04,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:44:04,887 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 198893256, now seen corresponding path program 1 times [2021-01-06 11:44:04,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:04,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435845540] [2021-01-06 11:44:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:04,976 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:04,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435845540] [2021-01-06 11:44:04,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:04,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:44:04,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018078195] [2021-01-06 11:44:04,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:44:04,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:04,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:44:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:04,979 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand 5 states. [2021-01-06 11:44:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:05,701 INFO L93 Difference]: Finished difference Result 480 states and 748 transitions. [2021-01-06 11:44:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:44:05,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 11:44:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:05,704 INFO L225 Difference]: With dead ends: 480 [2021-01-06 11:44:05,705 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 11:44:05,706 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:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 11:44:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2021-01-06 11:44:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 396 transitions. [2021-01-06 11:44:05,713 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 396 transitions. Word has length 95 [2021-01-06 11:44:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:05,714 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 396 transitions. [2021-01-06 11:44:05,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:44:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2021-01-06 11:44:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:05,715 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:05,715 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] [2021-01-06 11:44:05,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:44:05,716 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1259899279, now seen corresponding path program 1 times [2021-01-06 11:44:05,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:05,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167548383] [2021-01-06 11:44:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:05,789 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:05,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167548383] [2021-01-06 11:44:05,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:05,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:05,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156865801] [2021-01-06 11:44:05,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:05,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:05,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:05,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:05,791 INFO L87 Difference]: Start difference. First operand 259 states and 396 transitions. Second operand 4 states. [2021-01-06 11:44:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:06,321 INFO L93 Difference]: Finished difference Result 522 states and 800 transitions. [2021-01-06 11:44:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:06,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:06,325 INFO L225 Difference]: With dead ends: 522 [2021-01-06 11:44:06,325 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:44:06,326 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:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:44:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 259. [2021-01-06 11:44:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 395 transitions. [2021-01-06 11:44:06,334 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 395 transitions. Word has length 95 [2021-01-06 11:44:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:06,334 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 395 transitions. [2021-01-06 11:44:06,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 395 transitions. [2021-01-06 11:44:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:44:06,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:06,336 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] [2021-01-06 11:44:06,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:44:06,336 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash -60954033, now seen corresponding path program 1 times [2021-01-06 11:44:06,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:06,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439436399] [2021-01-06 11:44:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:06,405 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:06,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439436399] [2021-01-06 11:44:06,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:06,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:06,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388128077] [2021-01-06 11:44:06,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:06,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:06,407 INFO L87 Difference]: Start difference. First operand 259 states and 395 transitions. Second operand 4 states. [2021-01-06 11:44:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:06,903 INFO L93 Difference]: Finished difference Result 521 states and 797 transitions. [2021-01-06 11:44:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:06,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 11:44:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:06,906 INFO L225 Difference]: With dead ends: 521 [2021-01-06 11:44:06,906 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:44:06,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:44:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2021-01-06 11:44:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 394 transitions. [2021-01-06 11:44:06,914 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 394 transitions. Word has length 95 [2021-01-06 11:44:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:06,915 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 394 transitions. [2021-01-06 11:44:06,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 394 transitions. [2021-01-06 11:44:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:06,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:06,916 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:06,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:44:06,917 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1696535082, now seen corresponding path program 1 times [2021-01-06 11:44:06,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:06,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066872403] [2021-01-06 11:44:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:06,993 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:06,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066872403] [2021-01-06 11:44:06,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:06,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:06,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633113523] [2021-01-06 11:44:06,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:06,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:06,995 INFO L87 Difference]: Start difference. First operand 259 states and 394 transitions. Second operand 4 states. [2021-01-06 11:44:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:07,677 INFO L93 Difference]: Finished difference Result 557 states and 848 transitions. [2021-01-06 11:44:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:07,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:07,680 INFO L225 Difference]: With dead ends: 557 [2021-01-06 11:44:07,681 INFO L226 Difference]: Without dead ends: 317 [2021-01-06 11:44:07,681 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:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-01-06 11:44:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2021-01-06 11:44:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2021-01-06 11:44:07,690 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 96 [2021-01-06 11:44:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:07,690 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2021-01-06 11:44:07,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2021-01-06 11:44:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:44:07,691 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:07,691 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:07,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:44:07,692 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -309749672, now seen corresponding path program 1 times [2021-01-06 11:44:07,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:07,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358479369] [2021-01-06 11:44:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:07,760 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:07,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358479369] [2021-01-06 11:44:07,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:07,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:07,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341517721] [2021-01-06 11:44:07,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:07,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:07,762 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2021-01-06 11:44:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:08,263 INFO L93 Difference]: Finished difference Result 521 states and 793 transitions. [2021-01-06 11:44:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:08,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:44:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:08,266 INFO L225 Difference]: With dead ends: 521 [2021-01-06 11:44:08,266 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:44:08,267 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:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:44:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2021-01-06 11:44:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 392 transitions. [2021-01-06 11:44:08,275 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 392 transitions. Word has length 96 [2021-01-06 11:44:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:08,275 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 392 transitions. [2021-01-06 11:44:08,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 392 transitions. [2021-01-06 11:44:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:44:08,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:08,277 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] [2021-01-06 11:44:08,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:44:08,277 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash -987630891, now seen corresponding path program 1 times [2021-01-06 11:44:08,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:08,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902303388] [2021-01-06 11:44:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:08,345 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:08,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902303388] [2021-01-06 11:44:08,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:08,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:08,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165366161] [2021-01-06 11:44:08,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:08,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:08,348 INFO L87 Difference]: Start difference. First operand 259 states and 392 transitions. Second operand 4 states. [2021-01-06 11:44:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:09,022 INFO L93 Difference]: Finished difference Result 557 states and 844 transitions. [2021-01-06 11:44:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:09,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:44:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:09,025 INFO L225 Difference]: With dead ends: 557 [2021-01-06 11:44:09,026 INFO L226 Difference]: Without dead ends: 317 [2021-01-06 11:44:09,027 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:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-01-06 11:44:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2021-01-06 11:44:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 391 transitions. [2021-01-06 11:44:09,035 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 391 transitions. Word has length 97 [2021-01-06 11:44:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:09,036 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 391 transitions. [2021-01-06 11:44:09,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 391 transitions. [2021-01-06 11:44:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:44:09,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:09,037 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] [2021-01-06 11:44:09,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:44:09,037 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -946956141, now seen corresponding path program 1 times [2021-01-06 11:44:09,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:09,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080204401] [2021-01-06 11:44:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:09,122 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:09,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080204401] [2021-01-06 11:44:09,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:09,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:09,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571349514] [2021-01-06 11:44:09,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:09,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:09,124 INFO L87 Difference]: Start difference. First operand 259 states and 391 transitions. Second operand 4 states. [2021-01-06 11:44:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:09,630 INFO L93 Difference]: Finished difference Result 521 states and 789 transitions. [2021-01-06 11:44:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:09,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-06 11:44:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:09,633 INFO L225 Difference]: With dead ends: 521 [2021-01-06 11:44:09,633 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:44:09,633 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:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:44:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2021-01-06 11:44:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 390 transitions. [2021-01-06 11:44:09,642 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 390 transitions. Word has length 97 [2021-01-06 11:44:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:09,643 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 390 transitions. [2021-01-06 11:44:09,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 390 transitions. [2021-01-06 11:44:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:44:09,644 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:09,644 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] [2021-01-06 11:44:09,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:44:09,644 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 778325243, now seen corresponding path program 1 times [2021-01-06 11:44:09,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:09,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071236057] [2021-01-06 11:44:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:09,717 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:09,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071236057] [2021-01-06 11:44:09,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:09,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:09,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060295254] [2021-01-06 11:44:09,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:09,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:09,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:09,720 INFO L87 Difference]: Start difference. First operand 259 states and 390 transitions. Second operand 4 states. [2021-01-06 11:44:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:10,388 INFO L93 Difference]: Finished difference Result 557 states and 840 transitions. [2021-01-06 11:44:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:10,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:44:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:10,392 INFO L225 Difference]: With dead ends: 557 [2021-01-06 11:44:10,392 INFO L226 Difference]: Without dead ends: 317 [2021-01-06 11:44:10,393 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:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-01-06 11:44:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2021-01-06 11:44:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 389 transitions. [2021-01-06 11:44:10,403 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 389 transitions. Word has length 98 [2021-01-06 11:44:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:10,403 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 389 transitions. [2021-01-06 11:44:10,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 389 transitions. [2021-01-06 11:44:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:44:10,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:10,404 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] [2021-01-06 11:44:10,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:44:10,405 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2039242493, now seen corresponding path program 1 times [2021-01-06 11:44:10,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:10,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179735780] [2021-01-06 11:44:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:10,478 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:10,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179735780] [2021-01-06 11:44:10,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:10,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:10,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600128852] [2021-01-06 11:44:10,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:10,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:10,480 INFO L87 Difference]: Start difference. First operand 259 states and 389 transitions. Second operand 4 states. [2021-01-06 11:44:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:10,998 INFO L93 Difference]: Finished difference Result 521 states and 785 transitions. [2021-01-06 11:44:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:10,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-06 11:44:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:11,001 INFO L225 Difference]: With dead ends: 521 [2021-01-06 11:44:11,001 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 11:44:11,002 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:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 11:44:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2021-01-06 11:44:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 388 transitions. [2021-01-06 11:44:11,010 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 388 transitions. Word has length 98 [2021-01-06 11:44:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:11,010 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 388 transitions. [2021-01-06 11:44:11,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 388 transitions. [2021-01-06 11:44:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:44:11,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:11,011 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] [2021-01-06 11:44:11,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:44:11,012 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 953153242, now seen corresponding path program 1 times [2021-01-06 11:44:11,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:11,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852907727] [2021-01-06 11:44:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:11,081 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:11,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852907727] [2021-01-06 11:44:11,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:11,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:11,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183085548] [2021-01-06 11:44:11,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:11,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:11,083 INFO L87 Difference]: Start difference. First operand 259 states and 388 transitions. Second operand 4 states. [2021-01-06 11:44:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:11,692 INFO L93 Difference]: Finished difference Result 547 states and 824 transitions. [2021-01-06 11:44:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:11,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:44:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:11,695 INFO L225 Difference]: With dead ends: 547 [2021-01-06 11:44:11,695 INFO L226 Difference]: Without dead ends: 307 [2021-01-06 11:44:11,696 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:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-06 11:44:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2021-01-06 11:44:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 387 transitions. [2021-01-06 11:44:11,705 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 387 transitions. Word has length 99 [2021-01-06 11:44:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:11,706 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 387 transitions. [2021-01-06 11:44:11,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 387 transitions. [2021-01-06 11:44:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:44:11,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:11,707 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] [2021-01-06 11:44:11,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:44:11,707 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1386882328, now seen corresponding path program 1 times [2021-01-06 11:44:11,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:11,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444426473] [2021-01-06 11:44:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:11,778 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:11,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444426473] [2021-01-06 11:44:11,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:11,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:11,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754594877] [2021-01-06 11:44:11,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:11,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:11,780 INFO L87 Difference]: Start difference. First operand 259 states and 387 transitions. Second operand 4 states. [2021-01-06 11:44:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:12,262 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-01-06 11:44:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:12,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 11:44:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:12,265 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:44:12,266 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 11:44:12,266 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:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 11:44:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 259. [2021-01-06 11:44:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 386 transitions. [2021-01-06 11:44:12,276 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 386 transitions. Word has length 99 [2021-01-06 11:44:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:12,276 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 386 transitions. [2021-01-06 11:44:12,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2021-01-06 11:44:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 11:44:12,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:12,278 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] [2021-01-06 11:44:12,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:44:12,278 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1409187564, now seen corresponding path program 1 times [2021-01-06 11:44:12,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:12,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565724567] [2021-01-06 11:44:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:12,366 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:12,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565724567] [2021-01-06 11:44:12,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:12,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:12,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270502167] [2021-01-06 11:44:12,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:12,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:12,368 INFO L87 Difference]: Start difference. First operand 259 states and 386 transitions. Second operand 4 states. [2021-01-06 11:44:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:13,042 INFO L93 Difference]: Finished difference Result 547 states and 820 transitions. [2021-01-06 11:44:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:13,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-06 11:44:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:13,045 INFO L225 Difference]: With dead ends: 547 [2021-01-06 11:44:13,045 INFO L226 Difference]: Without dead ends: 307 [2021-01-06 11:44:13,046 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:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-06 11:44:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2021-01-06 11:44:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-06 11:44:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 385 transitions. [2021-01-06 11:44:13,055 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 385 transitions. Word has length 103 [2021-01-06 11:44:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:13,055 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 385 transitions. [2021-01-06 11:44:13,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 385 transitions. [2021-01-06 11:44:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 11:44:13,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:13,056 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] [2021-01-06 11:44:13,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:44:13,057 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -729915310, now seen corresponding path program 1 times [2021-01-06 11:44:13,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:13,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634998566] [2021-01-06 11:44:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:13,135 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:13,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634998566] [2021-01-06 11:44:13,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:13,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:13,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523340756] [2021-01-06 11:44:13,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:13,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:13,137 INFO L87 Difference]: Start difference. First operand 259 states and 385 transitions. Second operand 4 states. [2021-01-06 11:44:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:13,676 INFO L93 Difference]: Finished difference Result 552 states and 829 transitions. [2021-01-06 11:44:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:13,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-06 11:44:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:13,679 INFO L225 Difference]: With dead ends: 552 [2021-01-06 11:44:13,679 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 11:44:13,679 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:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 11:44:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2021-01-06 11:44:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 430 transitions. [2021-01-06 11:44:13,689 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 430 transitions. Word has length 103 [2021-01-06 11:44:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:13,689 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 430 transitions. [2021-01-06 11:44:13,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 430 transitions. [2021-01-06 11:44:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:44:13,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:13,690 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] [2021-01-06 11:44:13,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:44:13,691 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1317661803, now seen corresponding path program 1 times [2021-01-06 11:44:13,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:13,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463174271] [2021-01-06 11:44:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:13,790 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:13,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463174271] [2021-01-06 11:44:13,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:13,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:13,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998780965] [2021-01-06 11:44:13,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:13,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:13,792 INFO L87 Difference]: Start difference. First operand 285 states and 430 transitions. Second operand 4 states. [2021-01-06 11:44:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:14,479 INFO L93 Difference]: Finished difference Result 599 states and 908 transitions. [2021-01-06 11:44:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:14,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-06 11:44:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:14,482 INFO L225 Difference]: With dead ends: 599 [2021-01-06 11:44:14,482 INFO L226 Difference]: Without dead ends: 333 [2021-01-06 11:44:14,483 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:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-01-06 11:44:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 285. [2021-01-06 11:44:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2021-01-06 11:44:14,493 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 106 [2021-01-06 11:44:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:14,493 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2021-01-06 11:44:14,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2021-01-06 11:44:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 11:44:14,494 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:14,494 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] [2021-01-06 11:44:14,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:44:14,495 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash -449262892, now seen corresponding path program 1 times [2021-01-06 11:44:14,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:14,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910314165] [2021-01-06 11:44:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:14,582 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:14,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910314165] [2021-01-06 11:44:14,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:14,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:14,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609867011] [2021-01-06 11:44:14,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:14,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:14,584 INFO L87 Difference]: Start difference. First operand 285 states and 429 transitions. Second operand 4 states. [2021-01-06 11:44:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:15,209 INFO L93 Difference]: Finished difference Result 591 states and 893 transitions. [2021-01-06 11:44:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:15,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2021-01-06 11:44:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:15,211 INFO L225 Difference]: With dead ends: 591 [2021-01-06 11:44:15,212 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 11:44:15,212 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:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 11:44:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2021-01-06 11:44:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2021-01-06 11:44:15,222 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 107 [2021-01-06 11:44:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:15,222 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2021-01-06 11:44:15,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2021-01-06 11:44:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 11:44:15,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:15,223 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] [2021-01-06 11:44:15,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:44:15,224 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2126978123, now seen corresponding path program 1 times [2021-01-06 11:44:15,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:15,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937383896] [2021-01-06 11:44:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:15,326 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:15,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937383896] [2021-01-06 11:44:15,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:15,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:15,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688953013] [2021-01-06 11:44:15,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:15,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:15,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:15,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:15,328 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand 4 states. [2021-01-06 11:44:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:15,912 INFO L93 Difference]: Finished difference Result 591 states and 891 transitions. [2021-01-06 11:44:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:15,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2021-01-06 11:44:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:15,916 INFO L225 Difference]: With dead ends: 591 [2021-01-06 11:44:15,916 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 11:44:15,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:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 11:44:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2021-01-06 11:44:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2021-01-06 11:44:15,926 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 108 [2021-01-06 11:44:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:15,926 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2021-01-06 11:44:15,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2021-01-06 11:44:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 11:44:15,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:15,928 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] [2021-01-06 11:44:15,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:44:15,928 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1091839583, now seen corresponding path program 1 times [2021-01-06 11:44:15,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:15,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217230034] [2021-01-06 11:44:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:16,012 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:16,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217230034] [2021-01-06 11:44:16,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:16,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:16,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042222814] [2021-01-06 11:44:16,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:16,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:16,014 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand 4 states. [2021-01-06 11:44:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:16,633 INFO L93 Difference]: Finished difference Result 591 states and 889 transitions. [2021-01-06 11:44:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:16,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 11:44:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:16,636 INFO L225 Difference]: With dead ends: 591 [2021-01-06 11:44:16,636 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 11:44:16,637 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:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 11:44:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2021-01-06 11:44:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 426 transitions. [2021-01-06 11:44:16,648 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 426 transitions. Word has length 109 [2021-01-06 11:44:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:16,650 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 426 transitions. [2021-01-06 11:44:16,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2021-01-06 11:44:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 11:44:16,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:16,651 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] [2021-01-06 11:44:16,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:44:16,652 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1287280684, now seen corresponding path program 1 times [2021-01-06 11:44:16,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:16,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437888782] [2021-01-06 11:44:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:16,776 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:16,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437888782] [2021-01-06 11:44:16,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:16,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:16,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198161801] [2021-01-06 11:44:16,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:16,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:16,779 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand 4 states. [2021-01-06 11:44:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:17,390 INFO L93 Difference]: Finished difference Result 589 states and 885 transitions. [2021-01-06 11:44:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:17,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 11:44:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:17,392 INFO L225 Difference]: With dead ends: 589 [2021-01-06 11:44:17,392 INFO L226 Difference]: Without dead ends: 323 [2021-01-06 11:44:17,393 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:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-06 11:44:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2021-01-06 11:44:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2021-01-06 11:44:17,404 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 109 [2021-01-06 11:44:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:17,405 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2021-01-06 11:44:17,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2021-01-06 11:44:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 11:44:17,406 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:17,406 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] [2021-01-06 11:44:17,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:44:17,407 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -576923808, now seen corresponding path program 1 times [2021-01-06 11:44:17,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:17,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918351610] [2021-01-06 11:44:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:17,489 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:17,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918351610] [2021-01-06 11:44:17,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:17,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:17,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213604433] [2021-01-06 11:44:17,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:17,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:17,491 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand 4 states. [2021-01-06 11:44:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:18,065 INFO L93 Difference]: Finished difference Result 587 states and 880 transitions. [2021-01-06 11:44:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:18,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2021-01-06 11:44:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:18,068 INFO L225 Difference]: With dead ends: 587 [2021-01-06 11:44:18,068 INFO L226 Difference]: Without dead ends: 321 [2021-01-06 11:44:18,068 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:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-01-06 11:44:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 285. [2021-01-06 11:44:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2021-01-06 11:44:18,077 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 110 [2021-01-06 11:44:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:18,078 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2021-01-06 11:44:18,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2021-01-06 11:44:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 11:44:18,079 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:18,079 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] [2021-01-06 11:44:18,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:44:18,080 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 685628119, now seen corresponding path program 1 times [2021-01-06 11:44:18,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:18,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659280143] [2021-01-06 11:44:18,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:18,183 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:18,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659280143] [2021-01-06 11:44:18,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:18,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:18,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744121383] [2021-01-06 11:44:18,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:18,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:18,185 INFO L87 Difference]: Start difference. First operand 285 states and 424 transitions. Second operand 4 states. [2021-01-06 11:44:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:18,770 INFO L93 Difference]: Finished difference Result 584 states and 874 transitions. [2021-01-06 11:44:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:18,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2021-01-06 11:44:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:18,773 INFO L225 Difference]: With dead ends: 584 [2021-01-06 11:44:18,773 INFO L226 Difference]: Without dead ends: 318 [2021-01-06 11:44:18,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-01-06 11:44:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2021-01-06 11:44:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 423 transitions. [2021-01-06 11:44:18,784 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 423 transitions. Word has length 110 [2021-01-06 11:44:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:18,784 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 423 transitions. [2021-01-06 11:44:18,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 423 transitions. [2021-01-06 11:44:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 11:44:18,785 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:18,786 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] [2021-01-06 11:44:18,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:44:18,786 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1612775450, now seen corresponding path program 1 times [2021-01-06 11:44:18,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:18,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239699557] [2021-01-06 11:44:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:18,875 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:18,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239699557] [2021-01-06 11:44:18,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:18,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:18,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299580059] [2021-01-06 11:44:18,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:18,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:18,877 INFO L87 Difference]: Start difference. First operand 285 states and 423 transitions. Second operand 4 states. [2021-01-06 11:44:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:19,431 INFO L93 Difference]: Finished difference Result 584 states and 872 transitions. [2021-01-06 11:44:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:19,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2021-01-06 11:44:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:19,434 INFO L225 Difference]: With dead ends: 584 [2021-01-06 11:44:19,434 INFO L226 Difference]: Without dead ends: 318 [2021-01-06 11:44:19,435 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:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-01-06 11:44:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2021-01-06 11:44:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 422 transitions. [2021-01-06 11:44:19,444 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 422 transitions. Word has length 113 [2021-01-06 11:44:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:19,445 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 422 transitions. [2021-01-06 11:44:19,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 422 transitions. [2021-01-06 11:44:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 11:44:19,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:19,446 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] [2021-01-06 11:44:19,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:44:19,446 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1906443136, now seen corresponding path program 1 times [2021-01-06 11:44:19,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:19,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720906462] [2021-01-06 11:44:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:19,538 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:19,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720906462] [2021-01-06 11:44:19,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:19,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:19,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325122213] [2021-01-06 11:44:19,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:19,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:19,540 INFO L87 Difference]: Start difference. First operand 285 states and 422 transitions. Second operand 4 states. [2021-01-06 11:44:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:20,109 INFO L93 Difference]: Finished difference Result 578 states and 861 transitions. [2021-01-06 11:44:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:20,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2021-01-06 11:44:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:20,112 INFO L225 Difference]: With dead ends: 578 [2021-01-06 11:44:20,112 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 11:44:20,112 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:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 11:44:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2021-01-06 11:44:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 421 transitions. [2021-01-06 11:44:20,123 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 421 transitions. Word has length 114 [2021-01-06 11:44:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:20,123 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 421 transitions. [2021-01-06 11:44:20,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 421 transitions. [2021-01-06 11:44:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 11:44:20,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:20,125 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] [2021-01-06 11:44:20,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 11:44:20,125 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1845596870, now seen corresponding path program 1 times [2021-01-06 11:44:20,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:20,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035918484] [2021-01-06 11:44:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:20,220 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:20,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035918484] [2021-01-06 11:44:20,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:20,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:20,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46415268] [2021-01-06 11:44:20,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:20,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:20,222 INFO L87 Difference]: Start difference. First operand 285 states and 421 transitions. Second operand 4 states. [2021-01-06 11:44:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:20,794 INFO L93 Difference]: Finished difference Result 578 states and 859 transitions. [2021-01-06 11:44:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:20,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2021-01-06 11:44:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:20,796 INFO L225 Difference]: With dead ends: 578 [2021-01-06 11:44:20,797 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 11:44:20,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 11:44:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2021-01-06 11:44:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 420 transitions. [2021-01-06 11:44:20,808 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 420 transitions. Word has length 114 [2021-01-06 11:44:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:20,808 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 420 transitions. [2021-01-06 11:44:20,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 420 transitions. [2021-01-06 11:44:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 11:44:20,809 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:20,810 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] [2021-01-06 11:44:20,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:44:20,810 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1499113856, now seen corresponding path program 1 times [2021-01-06 11:44:20,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:20,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387560338] [2021-01-06 11:44:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:20,916 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:20,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387560338] [2021-01-06 11:44:20,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:20,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:20,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623519173] [2021-01-06 11:44:20,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:20,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:20,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:20,918 INFO L87 Difference]: Start difference. First operand 285 states and 420 transitions. Second operand 4 states. [2021-01-06 11:44:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:21,452 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2021-01-06 11:44:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:21,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 11:44:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:21,456 INFO L225 Difference]: With dead ends: 575 [2021-01-06 11:44:21,456 INFO L226 Difference]: Without dead ends: 309 [2021-01-06 11:44:21,456 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:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-06 11:44:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2021-01-06 11:44:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 419 transitions. [2021-01-06 11:44:21,465 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 419 transitions. Word has length 115 [2021-01-06 11:44:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:21,466 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 419 transitions. [2021-01-06 11:44:21,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 419 transitions. [2021-01-06 11:44:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 11:44:21,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:21,467 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] [2021-01-06 11:44:21,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:44:21,467 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1831341134, now seen corresponding path program 1 times [2021-01-06 11:44:21,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:21,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379230259] [2021-01-06 11:44:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:21,558 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:21,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379230259] [2021-01-06 11:44:21,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:21,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:21,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618229598] [2021-01-06 11:44:21,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:21,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:21,560 INFO L87 Difference]: Start difference. First operand 285 states and 419 transitions. Second operand 4 states. [2021-01-06 11:44:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:22,125 INFO L93 Difference]: Finished difference Result 575 states and 851 transitions. [2021-01-06 11:44:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:22,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 11:44:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:22,128 INFO L225 Difference]: With dead ends: 575 [2021-01-06 11:44:22,128 INFO L226 Difference]: Without dead ends: 309 [2021-01-06 11:44:22,128 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:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-06 11:44:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2021-01-06 11:44:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-01-06 11:44:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 418 transitions. [2021-01-06 11:44:22,139 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 418 transitions. Word has length 116 [2021-01-06 11:44:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:22,139 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 418 transitions. [2021-01-06 11:44:22,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 418 transitions. [2021-01-06 11:44:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 11:44:22,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:22,140 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] [2021-01-06 11:44:22,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 11:44:22,141 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash 715558198, now seen corresponding path program 1 times [2021-01-06 11:44:22,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:22,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452044966] [2021-01-06 11:44:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:22,233 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:44:22,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452044966] [2021-01-06 11:44:22,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:22,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:22,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751136529] [2021-01-06 11:44:22,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:22,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:22,234 INFO L87 Difference]: Start difference. First operand 285 states and 418 transitions. Second operand 4 states. [2021-01-06 11:44:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:22,873 INFO L93 Difference]: Finished difference Result 623 states and 926 transitions. [2021-01-06 11:44:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:22,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 11:44:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:22,875 INFO L225 Difference]: With dead ends: 623 [2021-01-06 11:44:22,875 INFO L226 Difference]: Without dead ends: 357 [2021-01-06 11:44:22,876 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:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-01-06 11:44:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 317. [2021-01-06 11:44:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2021-01-06 11:44:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 475 transitions. [2021-01-06 11:44:22,886 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 475 transitions. Word has length 116 [2021-01-06 11:44:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:22,886 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 475 transitions. [2021-01-06 11:44:22,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 475 transitions. [2021-01-06 11:44:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 11:44:22,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:22,887 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] [2021-01-06 11:44:22,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 11:44:22,888 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1423246104, now seen corresponding path program 1 times [2021-01-06 11:44:22,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:22,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728657240] [2021-01-06 11:44:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:22,979 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:44:22,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728657240] [2021-01-06 11:44:22,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:22,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:22,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790315848] [2021-01-06 11:44:22,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:22,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:22,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:22,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:22,981 INFO L87 Difference]: Start difference. First operand 317 states and 475 transitions. Second operand 4 states. [2021-01-06 11:44:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:23,542 INFO L93 Difference]: Finished difference Result 636 states and 959 transitions. [2021-01-06 11:44:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:23,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 11:44:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:23,545 INFO L225 Difference]: With dead ends: 636 [2021-01-06 11:44:23,545 INFO L226 Difference]: Without dead ends: 338 [2021-01-06 11:44:23,546 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:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-01-06 11:44:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 317. [2021-01-06 11:44:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2021-01-06 11:44:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 474 transitions. [2021-01-06 11:44:23,556 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 474 transitions. Word has length 117 [2021-01-06 11:44:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:23,557 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 474 transitions. [2021-01-06 11:44:23,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 474 transitions. [2021-01-06 11:44:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 11:44:23,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:23,558 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] [2021-01-06 11:44:23,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 11:44:23,558 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1725958483, now seen corresponding path program 1 times [2021-01-06 11:44:23,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:23,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428008446] [2021-01-06 11:44:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:23,651 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:44:23,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428008446] [2021-01-06 11:44:23,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:23,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:23,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658150495] [2021-01-06 11:44:23,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:23,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:23,655 INFO L87 Difference]: Start difference. First operand 317 states and 474 transitions. Second operand 4 states. [2021-01-06 11:44:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:24,381 INFO L93 Difference]: Finished difference Result 723 states and 1094 transitions. [2021-01-06 11:44:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:24,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2021-01-06 11:44:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:24,384 INFO L225 Difference]: With dead ends: 723 [2021-01-06 11:44:24,384 INFO L226 Difference]: Without dead ends: 425 [2021-01-06 11:44:24,384 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:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-01-06 11:44:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 356. [2021-01-06 11:44:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2021-01-06 11:44:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 545 transitions. [2021-01-06 11:44:24,396 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 545 transitions. Word has length 117 [2021-01-06 11:44:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:24,396 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 545 transitions. [2021-01-06 11:44:24,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 545 transitions. [2021-01-06 11:44:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 11:44:24,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:24,398 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:44:24,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 11:44:24,398 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2088665573, now seen corresponding path program 1 times [2021-01-06 11:44:24,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:24,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682398718] [2021-01-06 11:44:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:24,481 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:44:24,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682398718] [2021-01-06 11:44:24,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:24,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:24,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053252442] [2021-01-06 11:44:24,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:24,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:24,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:24,484 INFO L87 Difference]: Start difference. First operand 356 states and 545 transitions. Second operand 4 states. [2021-01-06 11:44:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:25,210 INFO L93 Difference]: Finished difference Result 755 states and 1155 transitions. [2021-01-06 11:44:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:25,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2021-01-06 11:44:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:25,214 INFO L225 Difference]: With dead ends: 755 [2021-01-06 11:44:25,214 INFO L226 Difference]: Without dead ends: 418 [2021-01-06 11:44:25,214 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:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-06 11:44:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 355. [2021-01-06 11:44:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:44:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 544 transitions. [2021-01-06 11:44:25,226 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 544 transitions. Word has length 118 [2021-01-06 11:44:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:25,226 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 544 transitions. [2021-01-06 11:44:25,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 544 transitions. [2021-01-06 11:44:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 11:44:25,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:25,228 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] [2021-01-06 11:44:25,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 11:44:25,228 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -385280070, now seen corresponding path program 1 times [2021-01-06 11:44:25,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:25,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229952279] [2021-01-06 11:44:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:25,303 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:44:25,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229952279] [2021-01-06 11:44:25,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:25,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:25,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152413158] [2021-01-06 11:44:25,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:25,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:25,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:25,306 INFO L87 Difference]: Start difference. First operand 355 states and 544 transitions. Second operand 4 states. [2021-01-06 11:44:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:25,834 INFO L93 Difference]: Finished difference Result 718 states and 1101 transitions. [2021-01-06 11:44:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:25,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2021-01-06 11:44:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:25,837 INFO L225 Difference]: With dead ends: 718 [2021-01-06 11:44:25,837 INFO L226 Difference]: Without dead ends: 382 [2021-01-06 11:44:25,838 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:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-01-06 11:44:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2021-01-06 11:44:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:44:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 543 transitions. [2021-01-06 11:44:25,849 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 543 transitions. Word has length 118 [2021-01-06 11:44:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:25,850 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 543 transitions. [2021-01-06 11:44:25,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 543 transitions. [2021-01-06 11:44:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 11:44:25,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:25,851 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] [2021-01-06 11:44:25,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 11:44:25,852 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1006568817, now seen corresponding path program 1 times [2021-01-06 11:44:25,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:25,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755891066] [2021-01-06 11:44:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:25,929 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:44:25,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755891066] [2021-01-06 11:44:25,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:25,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:25,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725571309] [2021-01-06 11:44:25,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:25,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:25,931 INFO L87 Difference]: Start difference. First operand 355 states and 543 transitions. Second operand 4 states. [2021-01-06 11:44:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:26,485 INFO L93 Difference]: Finished difference Result 718 states and 1099 transitions. [2021-01-06 11:44:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:26,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2021-01-06 11:44:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:26,488 INFO L225 Difference]: With dead ends: 718 [2021-01-06 11:44:26,489 INFO L226 Difference]: Without dead ends: 382 [2021-01-06 11:44:26,489 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:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-01-06 11:44:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2021-01-06 11:44:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:44:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2021-01-06 11:44:26,503 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 119 [2021-01-06 11:44:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:26,503 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2021-01-06 11:44:26,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2021-01-06 11:44:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 11:44:26,505 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:26,505 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] [2021-01-06 11:44:26,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 11:44:26,512 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1825993249, now seen corresponding path program 1 times [2021-01-06 11:44:26,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:26,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796907600] [2021-01-06 11:44:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:26,587 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:44:26,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796907600] [2021-01-06 11:44:26,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:26,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:26,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792212446] [2021-01-06 11:44:26,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:26,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:26,589 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2021-01-06 11:44:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:27,092 INFO L93 Difference]: Finished difference Result 718 states and 1097 transitions. [2021-01-06 11:44:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:27,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 11:44:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:27,096 INFO L225 Difference]: With dead ends: 718 [2021-01-06 11:44:27,096 INFO L226 Difference]: Without dead ends: 382 [2021-01-06 11:44:27,096 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:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-01-06 11:44:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2021-01-06 11:44:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:44:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 541 transitions. [2021-01-06 11:44:27,106 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 541 transitions. Word has length 120 [2021-01-06 11:44:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:27,106 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 541 transitions. [2021-01-06 11:44:27,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 541 transitions. [2021-01-06 11:44:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:44:27,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:27,108 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] [2021-01-06 11:44:27,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 11:44:27,108 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1823658614, now seen corresponding path program 1 times [2021-01-06 11:44:27,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:27,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296263304] [2021-01-06 11:44:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:27,181 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:44:27,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296263304] [2021-01-06 11:44:27,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:27,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:27,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623748414] [2021-01-06 11:44:27,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:27,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:27,183 INFO L87 Difference]: Start difference. First operand 355 states and 541 transitions. Second operand 4 states. [2021-01-06 11:44:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:27,693 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2021-01-06 11:44:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:27,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 11:44:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:27,696 INFO L225 Difference]: With dead ends: 708 [2021-01-06 11:44:27,696 INFO L226 Difference]: Without dead ends: 372 [2021-01-06 11:44:27,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:44:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-06 11:44:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 355. [2021-01-06 11:44:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:44:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 540 transitions. [2021-01-06 11:44:27,706 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 540 transitions. Word has length 121 [2021-01-06 11:44:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:27,706 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 540 transitions. [2021-01-06 11:44:27,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 540 transitions. [2021-01-06 11:44:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:44:27,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:27,708 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] [2021-01-06 11:44:27,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 11:44:27,708 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1963622454, now seen corresponding path program 1 times [2021-01-06 11:44:27,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:27,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458004406] [2021-01-06 11:44:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:27,782 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:44:27,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458004406] [2021-01-06 11:44:27,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:27,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:44:27,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829209762] [2021-01-06 11:44:27,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:44:27,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:44:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:44:27,784 INFO L87 Difference]: Start difference. First operand 355 states and 540 transitions. Second operand 3 states. [2021-01-06 11:44:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:27,946 INFO L93 Difference]: Finished difference Result 1022 states and 1570 transitions. [2021-01-06 11:44:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:44:27,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:44:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:27,951 INFO L225 Difference]: With dead ends: 1022 [2021-01-06 11:44:27,951 INFO L226 Difference]: Without dead ends: 686 [2021-01-06 11:44:27,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:44:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-01-06 11:44:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2021-01-06 11:44:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2021-01-06 11:44:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1036 transitions. [2021-01-06 11:44:27,973 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1036 transitions. Word has length 122 [2021-01-06 11:44:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:27,973 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1036 transitions. [2021-01-06 11:44:27,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:44:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1036 transitions. [2021-01-06 11:44:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:44:27,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:27,976 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] [2021-01-06 11:44:27,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-06 11:44:27,976 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash -638766260, now seen corresponding path program 1 times [2021-01-06 11:44:27,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:27,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871911641] [2021-01-06 11:44:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:28,031 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:44:28,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871911641] [2021-01-06 11:44:28,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:28,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:44:28,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13748423] [2021-01-06 11:44:28,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:44:28,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:44:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:44:28,033 INFO L87 Difference]: Start difference. First operand 684 states and 1036 transitions. Second operand 3 states. [2021-01-06 11:44:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:28,143 INFO L93 Difference]: Finished difference Result 1376 states and 2087 transitions. [2021-01-06 11:44:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:44:28,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:44:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:28,147 INFO L225 Difference]: With dead ends: 1376 [2021-01-06 11:44:28,147 INFO L226 Difference]: Without dead ends: 711 [2021-01-06 11:44:28,148 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:44:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-01-06 11:44:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2021-01-06 11:44:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2021-01-06 11:44:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1071 transitions. [2021-01-06 11:44:28,176 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1071 transitions. Word has length 122 [2021-01-06 11:44:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:28,176 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 1071 transitions. [2021-01-06 11:44:28,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:44:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1071 transitions. [2021-01-06 11:44:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:44:28,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:28,179 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] [2021-01-06 11:44:28,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 11:44:28,179 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1622806990, now seen corresponding path program 1 times [2021-01-06 11:44:28,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:28,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644533063] [2021-01-06 11:44:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:28,233 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:44:28,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644533063] [2021-01-06 11:44:28,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:28,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:44:28,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884685105] [2021-01-06 11:44:28,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:44:28,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:44:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:44:28,235 INFO L87 Difference]: Start difference. First operand 711 states and 1071 transitions. Second operand 3 states. [2021-01-06 11:44:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:28,312 INFO L93 Difference]: Finished difference Result 1405 states and 2123 transitions. [2021-01-06 11:44:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:44:28,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:44:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:28,317 INFO L225 Difference]: With dead ends: 1405 [2021-01-06 11:44:28,317 INFO L226 Difference]: Without dead ends: 713 [2021-01-06 11:44:28,319 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:44:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-01-06 11:44:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2021-01-06 11:44:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2021-01-06 11:44:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1073 transitions. [2021-01-06 11:44:28,357 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1073 transitions. Word has length 122 [2021-01-06 11:44:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:28,358 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 1073 transitions. [2021-01-06 11:44:28,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:44:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1073 transitions. [2021-01-06 11:44:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 11:44:28,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:28,360 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:44:28,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-06 11:44:28,361 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -964530569, now seen corresponding path program 1 times [2021-01-06 11:44:28,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:28,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342236860] [2021-01-06 11:44:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:28,454 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:44:28,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342236860] [2021-01-06 11:44:28,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:28,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:28,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299006676] [2021-01-06 11:44:28,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:28,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:28,456 INFO L87 Difference]: Start difference. First operand 713 states and 1073 transitions. Second operand 4 states. [2021-01-06 11:44:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:29,240 INFO L93 Difference]: Finished difference Result 1617 states and 2443 transitions. [2021-01-06 11:44:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:29,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2021-01-06 11:44:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:29,245 INFO L225 Difference]: With dead ends: 1617 [2021-01-06 11:44:29,245 INFO L226 Difference]: Without dead ends: 925 [2021-01-06 11:44:29,246 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:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-01-06 11:44:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 791. [2021-01-06 11:44:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2021-01-06 11:44:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1215 transitions. [2021-01-06 11:44:29,275 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1215 transitions. Word has length 123 [2021-01-06 11:44:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:29,275 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 1215 transitions. [2021-01-06 11:44:29,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1215 transitions. [2021-01-06 11:44:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 11:44:29,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:29,277 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] [2021-01-06 11:44:29,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-01-06 11:44:29,278 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash -76872869, now seen corresponding path program 1 times [2021-01-06 11:44:29,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:29,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118634910] [2021-01-06 11:44:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:29,367 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:44:29,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118634910] [2021-01-06 11:44:29,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:29,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:29,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50931376] [2021-01-06 11:44:29,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:29,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:29,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:29,369 INFO L87 Difference]: Start difference. First operand 791 states and 1215 transitions. Second operand 4 states. [2021-01-06 11:44:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:30,125 INFO L93 Difference]: Finished difference Result 1685 states and 2571 transitions. [2021-01-06 11:44:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:30,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2021-01-06 11:44:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:30,130 INFO L225 Difference]: With dead ends: 1685 [2021-01-06 11:44:30,130 INFO L226 Difference]: Without dead ends: 915 [2021-01-06 11:44:30,131 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:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-01-06 11:44:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 713. [2021-01-06 11:44:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2021-01-06 11:44:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1073 transitions. [2021-01-06 11:44:30,150 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1073 transitions. Word has length 124 [2021-01-06 11:44:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:30,150 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 1073 transitions. [2021-01-06 11:44:30,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1073 transitions. [2021-01-06 11:44:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-06 11:44:30,152 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:30,153 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:44:30,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-01-06 11:44:30,153 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash -357296708, now seen corresponding path program 1 times [2021-01-06 11:44:30,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:30,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969937169] [2021-01-06 11:44:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:30,260 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:44:30,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969937169] [2021-01-06 11:44:30,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:30,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:30,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57207678] [2021-01-06 11:44:30,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:30,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:30,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:30,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:30,262 INFO L87 Difference]: Start difference. First operand 713 states and 1073 transitions. Second operand 4 states. [2021-01-06 11:44:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:30,840 INFO L93 Difference]: Finished difference Result 1437 states and 2163 transitions. [2021-01-06 11:44:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:30,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2021-01-06 11:44:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:30,844 INFO L225 Difference]: With dead ends: 1437 [2021-01-06 11:44:30,844 INFO L226 Difference]: Without dead ends: 745 [2021-01-06 11:44:30,844 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:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-01-06 11:44:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 719. [2021-01-06 11:44:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 11:44:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1079 transitions. [2021-01-06 11:44:30,870 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1079 transitions. Word has length 125 [2021-01-06 11:44:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:30,870 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1079 transitions. [2021-01-06 11:44:30,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1079 transitions. [2021-01-06 11:44:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 11:44:30,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:30,882 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] [2021-01-06 11:44:30,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-01-06 11:44:30,883 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1978467926, now seen corresponding path program 1 times [2021-01-06 11:44:30,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:30,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535657292] [2021-01-06 11:44:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:30,958 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:44:30,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535657292] [2021-01-06 11:44:30,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:30,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:30,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228081455] [2021-01-06 11:44:30,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:30,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:30,960 INFO L87 Difference]: Start difference. First operand 719 states and 1079 transitions. Second operand 4 states. [2021-01-06 11:44:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:31,451 INFO L93 Difference]: Finished difference Result 1451 states and 2177 transitions. [2021-01-06 11:44:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:31,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 11:44:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:31,456 INFO L225 Difference]: With dead ends: 1451 [2021-01-06 11:44:31,457 INFO L226 Difference]: Without dead ends: 753 [2021-01-06 11:44:31,457 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:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-01-06 11:44:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 719. [2021-01-06 11:44:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 11:44:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1077 transitions. [2021-01-06 11:44:31,478 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1077 transitions. Word has length 131 [2021-01-06 11:44:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:31,478 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1077 transitions. [2021-01-06 11:44:31,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1077 transitions. [2021-01-06 11:44:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 11:44:31,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:31,480 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] [2021-01-06 11:44:31,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-01-06 11:44:31,481 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash -490852613, now seen corresponding path program 1 times [2021-01-06 11:44:31,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:31,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316451048] [2021-01-06 11:44:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:31,564 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:44:31,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316451048] [2021-01-06 11:44:31,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:31,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:31,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898634741] [2021-01-06 11:44:31,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:31,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:31,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:31,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:31,566 INFO L87 Difference]: Start difference. First operand 719 states and 1077 transitions. Second operand 4 states. [2021-01-06 11:44:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:32,195 INFO L93 Difference]: Finished difference Result 1543 states and 2323 transitions. [2021-01-06 11:44:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:32,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 11:44:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:32,200 INFO L225 Difference]: With dead ends: 1543 [2021-01-06 11:44:32,200 INFO L226 Difference]: Without dead ends: 845 [2021-01-06 11:44:32,201 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:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-01-06 11:44:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 775. [2021-01-06 11:44:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2021-01-06 11:44:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1175 transitions. [2021-01-06 11:44:32,226 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1175 transitions. Word has length 131 [2021-01-06 11:44:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:32,226 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1175 transitions. [2021-01-06 11:44:32,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1175 transitions. [2021-01-06 11:44:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:44:32,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:32,229 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] [2021-01-06 11:44:32,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-01-06 11:44:32,229 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -127035201, now seen corresponding path program 1 times [2021-01-06 11:44:32,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:32,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470927600] [2021-01-06 11:44:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:32,303 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:44:32,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470927600] [2021-01-06 11:44:32,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:32,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:32,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761580246] [2021-01-06 11:44:32,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:32,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:32,304 INFO L87 Difference]: Start difference. First operand 775 states and 1175 transitions. Second operand 4 states. [2021-01-06 11:44:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:32,778 INFO L93 Difference]: Finished difference Result 1559 states and 2365 transitions. [2021-01-06 11:44:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:32,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2021-01-06 11:44:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:32,783 INFO L225 Difference]: With dead ends: 1559 [2021-01-06 11:44:32,783 INFO L226 Difference]: Without dead ends: 805 [2021-01-06 11:44:32,783 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:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-01-06 11:44:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 775. [2021-01-06 11:44:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2021-01-06 11:44:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1173 transitions. [2021-01-06 11:44:32,805 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1173 transitions. Word has length 132 [2021-01-06 11:44:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:32,806 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1173 transitions. [2021-01-06 11:44:32,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1173 transitions. [2021-01-06 11:44:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:44:32,808 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:32,808 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] [2021-01-06 11:44:32,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-01-06 11:44:32,808 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash -719151105, now seen corresponding path program 1 times [2021-01-06 11:44:32,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:32,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968666513] [2021-01-06 11:44:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:32,881 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:44:32,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968666513] [2021-01-06 11:44:32,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:32,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:32,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126244480] [2021-01-06 11:44:32,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:32,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:32,883 INFO L87 Difference]: Start difference. First operand 775 states and 1173 transitions. Second operand 4 states. [2021-01-06 11:44:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:33,586 INFO L93 Difference]: Finished difference Result 1731 states and 2627 transitions. [2021-01-06 11:44:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:33,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2021-01-06 11:44:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:33,592 INFO L225 Difference]: With dead ends: 1731 [2021-01-06 11:44:33,592 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:33,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:44:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 799. [2021-01-06 11:44:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2021-01-06 11:44:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1207 transitions. [2021-01-06 11:44:33,617 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1207 transitions. Word has length 132 [2021-01-06 11:44:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:33,617 INFO L481 AbstractCegarLoop]: Abstraction has 799 states and 1207 transitions. [2021-01-06 11:44:33,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1207 transitions. [2021-01-06 11:44:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 11:44:33,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:33,619 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] [2021-01-06 11:44:33,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-01-06 11:44:33,619 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash -753498676, now seen corresponding path program 1 times [2021-01-06 11:44:33,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:33,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756449947] [2021-01-06 11:44:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:33,698 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:44:33,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756449947] [2021-01-06 11:44:33,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:33,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:33,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857501552] [2021-01-06 11:44:33,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:33,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:33,700 INFO L87 Difference]: Start difference. First operand 799 states and 1207 transitions. Second operand 4 states. [2021-01-06 11:44:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:34,396 INFO L93 Difference]: Finished difference Result 1755 states and 2659 transitions. [2021-01-06 11:44:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:34,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 11:44:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:34,400 INFO L225 Difference]: With dead ends: 1755 [2021-01-06 11:44:34,400 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:34,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 801. [2021-01-06 11:44:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2021-01-06 11:44:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1209 transitions. [2021-01-06 11:44:34,423 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1209 transitions. Word has length 133 [2021-01-06 11:44:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:34,424 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1209 transitions. [2021-01-06 11:44:34,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1209 transitions. [2021-01-06 11:44:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 11:44:34,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:34,427 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] [2021-01-06 11:44:34,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-01-06 11:44:34,427 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash -553510684, now seen corresponding path program 1 times [2021-01-06 11:44:34,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:34,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066907552] [2021-01-06 11:44:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:34,504 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:44:34,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066907552] [2021-01-06 11:44:34,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:34,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:34,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115407257] [2021-01-06 11:44:34,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:34,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:34,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:34,506 INFO L87 Difference]: Start difference. First operand 801 states and 1209 transitions. Second operand 4 states. [2021-01-06 11:44:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:35,215 INFO L93 Difference]: Finished difference Result 1757 states and 2659 transitions. [2021-01-06 11:44:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:35,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2021-01-06 11:44:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:35,217 INFO L225 Difference]: With dead ends: 1757 [2021-01-06 11:44:35,217 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:35,218 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:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 803. [2021-01-06 11:44:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2021-01-06 11:44:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1211 transitions. [2021-01-06 11:44:35,242 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1211 transitions. Word has length 134 [2021-01-06 11:44:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:35,242 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 1211 transitions. [2021-01-06 11:44:35,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1211 transitions. [2021-01-06 11:44:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 11:44:35,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:35,244 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] [2021-01-06 11:44:35,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-01-06 11:44:35,244 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1679054831, now seen corresponding path program 1 times [2021-01-06 11:44:35,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:35,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641516075] [2021-01-06 11:44:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:35,330 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:44:35,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641516075] [2021-01-06 11:44:35,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:35,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:35,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957761396] [2021-01-06 11:44:35,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:35,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:35,332 INFO L87 Difference]: Start difference. First operand 803 states and 1211 transitions. Second operand 4 states. [2021-01-06 11:44:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:36,012 INFO L93 Difference]: Finished difference Result 1739 states and 2635 transitions. [2021-01-06 11:44:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:36,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2021-01-06 11:44:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:36,016 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:44:36,016 INFO L226 Difference]: Without dead ends: 957 [2021-01-06 11:44:36,017 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,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-01-06 11:44:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 805. [2021-01-06 11:44:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2021-01-06 11:44:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1213 transitions. [2021-01-06 11:44:36,038 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1213 transitions. Word has length 135 [2021-01-06 11:44:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:36,039 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 1213 transitions. [2021-01-06 11:44:36,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1213 transitions. [2021-01-06 11:44:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 11:44:36,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:36,040 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] [2021-01-06 11:44:36,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-01-06 11:44:36,040 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:36,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1027843339, now seen corresponding path program 1 times [2021-01-06 11:44:36,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:36,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635910519] [2021-01-06 11:44:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:36,120 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:44:36,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635910519] [2021-01-06 11:44:36,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:36,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:36,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190297641] [2021-01-06 11:44:36,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:36,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:36,122 INFO L87 Difference]: Start difference. First operand 805 states and 1213 transitions. Second operand 4 states. [2021-01-06 11:44:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:36,912 INFO L93 Difference]: Finished difference Result 1761 states and 2659 transitions. [2021-01-06 11:44:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:36,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 11:44:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:36,914 INFO L225 Difference]: With dead ends: 1761 [2021-01-06 11:44:36,915 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:36,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 805. [2021-01-06 11:44:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2021-01-06 11:44:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1211 transitions. [2021-01-06 11:44:36,936 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1211 transitions. Word has length 138 [2021-01-06 11:44:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:36,936 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 1211 transitions. [2021-01-06 11:44:36,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1211 transitions. [2021-01-06 11:44:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 11:44:36,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:36,938 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] [2021-01-06 11:44:36,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-01-06 11:44:36,939 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:36,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1733023338, now seen corresponding path program 1 times [2021-01-06 11:44:36,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:36,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163988556] [2021-01-06 11:44:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:37,014 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:44:37,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163988556] [2021-01-06 11:44:37,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:37,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:37,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169255951] [2021-01-06 11:44:37,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:37,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:37,016 INFO L87 Difference]: Start difference. First operand 805 states and 1211 transitions. Second operand 4 states. [2021-01-06 11:44:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:37,743 INFO L93 Difference]: Finished difference Result 1761 states and 2655 transitions. [2021-01-06 11:44:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:37,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2021-01-06 11:44:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:37,745 INFO L225 Difference]: With dead ends: 1761 [2021-01-06 11:44:37,745 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:37,746 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,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 805. [2021-01-06 11:44:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2021-01-06 11:44:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1209 transitions. [2021-01-06 11:44:37,776 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1209 transitions. Word has length 139 [2021-01-06 11:44:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:37,777 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 1209 transitions. [2021-01-06 11:44:37,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1209 transitions. [2021-01-06 11:44:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 11:44:37,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:37,779 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] [2021-01-06 11:44:37,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-01-06 11:44:37,779 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash -854004134, now seen corresponding path program 1 times [2021-01-06 11:44:37,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:37,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291802838] [2021-01-06 11:44:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:37,874 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:44:37,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291802838] [2021-01-06 11:44:37,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:37,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:37,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961094125] [2021-01-06 11:44:37,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:37,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:37,876 INFO L87 Difference]: Start difference. First operand 805 states and 1209 transitions. Second operand 4 states. [2021-01-06 11:44:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:38,641 INFO L93 Difference]: Finished difference Result 1761 states and 2651 transitions. [2021-01-06 11:44:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:38,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-06 11:44:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:38,644 INFO L225 Difference]: With dead ends: 1761 [2021-01-06 11:44:38,644 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 11:44:38,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:44:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 11:44:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 805. [2021-01-06 11:44:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2021-01-06 11:44:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1207 transitions. [2021-01-06 11:44:38,669 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1207 transitions. Word has length 140 [2021-01-06 11:44:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:38,669 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 1207 transitions. [2021-01-06 11:44:38,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1207 transitions. [2021-01-06 11:44:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 11:44:38,671 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:38,671 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] [2021-01-06 11:44:38,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-01-06 11:44:38,671 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1890550107, now seen corresponding path program 1 times [2021-01-06 11:44:38,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:38,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638011540] [2021-01-06 11:44:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:38,747 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:44:38,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638011540] [2021-01-06 11:44:38,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:38,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:38,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052278259] [2021-01-06 11:44:38,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:38,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:38,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:38,748 INFO L87 Difference]: Start difference. First operand 805 states and 1207 transitions. Second operand 4 states. [2021-01-06 11:44:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:39,489 INFO L93 Difference]: Finished difference Result 1741 states and 2623 transitions. [2021-01-06 11:44:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:39,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2021-01-06 11:44:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:39,492 INFO L225 Difference]: With dead ends: 1741 [2021-01-06 11:44:39,492 INFO L226 Difference]: Without dead ends: 957 [2021-01-06 11:44:39,493 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,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-01-06 11:44:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 775. [2021-01-06 11:44:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2021-01-06 11:44:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1165 transitions. [2021-01-06 11:44:39,516 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1165 transitions. Word has length 141 [2021-01-06 11:44:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:39,516 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1165 transitions. [2021-01-06 11:44:39,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1165 transitions. [2021-01-06 11:44:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 11:44:39,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:39,518 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] [2021-01-06 11:44:39,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-01-06 11:44:39,518 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1419647362, now seen corresponding path program 1 times [2021-01-06 11:44:39,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:39,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665531766] [2021-01-06 11:44:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:39,600 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:44:39,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665531766] [2021-01-06 11:44:39,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:39,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:39,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330244809] [2021-01-06 11:44:39,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:39,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:39,601 INFO L87 Difference]: Start difference. First operand 775 states and 1165 transitions. Second operand 4 states. [2021-01-06 11:44:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:40,263 INFO L93 Difference]: Finished difference Result 1711 states and 2579 transitions. [2021-01-06 11:44:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:40,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2021-01-06 11:44:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:40,267 INFO L225 Difference]: With dead ends: 1711 [2021-01-06 11:44:40,267 INFO L226 Difference]: Without dead ends: 957 [2021-01-06 11:44:40,268 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,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-01-06 11:44:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 831. [2021-01-06 11:44:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2021-01-06 11:44:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1255 transitions. [2021-01-06 11:44:40,313 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1255 transitions. Word has length 142 [2021-01-06 11:44:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:40,313 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 1255 transitions. [2021-01-06 11:44:40,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1255 transitions. [2021-01-06 11:44:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 11:44:40,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:40,315 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] [2021-01-06 11:44:40,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-01-06 11:44:40,315 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:40,316 INFO L82 PathProgramCache]: Analyzing trace with hash 684152075, now seen corresponding path program 1 times [2021-01-06 11:44:40,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:40,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266858077] [2021-01-06 11:44:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:40,395 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:44:40,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266858077] [2021-01-06 11:44:40,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:40,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:40,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771246372] [2021-01-06 11:44:40,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:40,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:40,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:40,397 INFO L87 Difference]: Start difference. First operand 831 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:41,055 INFO L93 Difference]: Finished difference Result 1751 states and 2641 transitions. [2021-01-06 11:44:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:41,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2021-01-06 11:44:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:41,058 INFO L225 Difference]: With dead ends: 1751 [2021-01-06 11:44:41,058 INFO L226 Difference]: Without dead ends: 941 [2021-01-06 11:44:41,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:44:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-01-06 11:44:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 833. [2021-01-06 11:44:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2021-01-06 11:44:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1257 transitions. [2021-01-06 11:44:41,088 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1257 transitions. Word has length 143 [2021-01-06 11:44:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:41,088 INFO L481 AbstractCegarLoop]: Abstraction has 833 states and 1257 transitions. [2021-01-06 11:44:41,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1257 transitions. [2021-01-06 11:44:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 11:44:41,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:41,090 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] [2021-01-06 11:44:41,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-01-06 11:44:41,091 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1851250225, now seen corresponding path program 1 times [2021-01-06 11:44:41,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:41,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235500462] [2021-01-06 11:44:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:41,198 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:44:41,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235500462] [2021-01-06 11:44:41,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:41,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:41,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031627392] [2021-01-06 11:44:41,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:41,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:41,200 INFO L87 Difference]: Start difference. First operand 833 states and 1257 transitions. Second operand 4 states. [2021-01-06 11:44:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:41,812 INFO L93 Difference]: Finished difference Result 1753 states and 2641 transitions. [2021-01-06 11:44:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:41,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2021-01-06 11:44:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:41,815 INFO L225 Difference]: With dead ends: 1753 [2021-01-06 11:44:41,815 INFO L226 Difference]: Without dead ends: 941 [2021-01-06 11:44:41,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-01-06 11:44:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 833. [2021-01-06 11:44:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2021-01-06 11:44:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1255 transitions. [2021-01-06 11:44:41,845 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1255 transitions. Word has length 145 [2021-01-06 11:44:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:41,845 INFO L481 AbstractCegarLoop]: Abstraction has 833 states and 1255 transitions. [2021-01-06 11:44:41,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1255 transitions. [2021-01-06 11:44:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 11:44:41,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:41,847 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] [2021-01-06 11:44:41,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-01-06 11:44:41,848 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash 224183364, now seen corresponding path program 1 times [2021-01-06 11:44:41,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:41,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246784224] [2021-01-06 11:44:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:41,923 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:44:41,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246784224] [2021-01-06 11:44:41,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:41,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:41,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608943860] [2021-01-06 11:44:41,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:41,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:41,925 INFO L87 Difference]: Start difference. First operand 833 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:42,550 INFO L93 Difference]: Finished difference Result 1749 states and 2633 transitions. [2021-01-06 11:44:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:42,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2021-01-06 11:44:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:42,553 INFO L225 Difference]: With dead ends: 1749 [2021-01-06 11:44:42,553 INFO L226 Difference]: Without dead ends: 937 [2021-01-06 11:44:42,554 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:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-01-06 11:44:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 833. [2021-01-06 11:44:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2021-01-06 11:44:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1253 transitions. [2021-01-06 11:44:42,579 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1253 transitions. Word has length 146 [2021-01-06 11:44:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:42,579 INFO L481 AbstractCegarLoop]: Abstraction has 833 states and 1253 transitions. [2021-01-06 11:44:42,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1253 transitions. [2021-01-06 11:44:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 11:44:42,580 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:42,581 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] [2021-01-06 11:44:42,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-01-06 11:44:42,581 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -781971136, now seen corresponding path program 1 times [2021-01-06 11:44:42,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:42,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019120233] [2021-01-06 11:44:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:42,667 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:44:42,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019120233] [2021-01-06 11:44:42,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:42,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:42,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573332665] [2021-01-06 11:44:42,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:42,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:42,669 INFO L87 Difference]: Start difference. First operand 833 states and 1253 transitions. Second operand 4 states. [2021-01-06 11:44:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:43,285 INFO L93 Difference]: Finished difference Result 1743 states and 2621 transitions. [2021-01-06 11:44:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:43,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2021-01-06 11:44:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:43,287 INFO L225 Difference]: With dead ends: 1743 [2021-01-06 11:44:43,287 INFO L226 Difference]: Without dead ends: 931 [2021-01-06 11:44:43,288 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:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-01-06 11:44:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 839. [2021-01-06 11:44:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1263 transitions. [2021-01-06 11:44:43,310 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1263 transitions. Word has length 146 [2021-01-06 11:44:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:43,310 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1263 transitions. [2021-01-06 11:44:43,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1263 transitions. [2021-01-06 11:44:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 11:44:43,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:43,312 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] [2021-01-06 11:44:43,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-01-06 11:44:43,312 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash -21036559, now seen corresponding path program 1 times [2021-01-06 11:44:43,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:43,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120673000] [2021-01-06 11:44:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:43,404 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:44:43,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120673000] [2021-01-06 11:44:43,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:43,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:43,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27166314] [2021-01-06 11:44:43,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:43,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:43,407 INFO L87 Difference]: Start difference. First operand 839 states and 1263 transitions. Second operand 4 states. [2021-01-06 11:44:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:44,038 INFO L93 Difference]: Finished difference Result 1727 states and 2595 transitions. [2021-01-06 11:44:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:44,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2021-01-06 11:44:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:44,041 INFO L225 Difference]: With dead ends: 1727 [2021-01-06 11:44:44,042 INFO L226 Difference]: Without dead ends: 909 [2021-01-06 11:44:44,043 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:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-01-06 11:44:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 839. [2021-01-06 11:44:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1261 transitions. [2021-01-06 11:44:44,065 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1261 transitions. Word has length 146 [2021-01-06 11:44:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:44,065 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1261 transitions. [2021-01-06 11:44:44,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1261 transitions. [2021-01-06 11:44:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 11:44:44,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:44,067 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] [2021-01-06 11:44:44,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-01-06 11:44:44,067 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash -586784230, now seen corresponding path program 1 times [2021-01-06 11:44:44,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:44,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519107446] [2021-01-06 11:44:44,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:44,158 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:44:44,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519107446] [2021-01-06 11:44:44,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:44,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:44,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878109586] [2021-01-06 11:44:44,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:44,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:44,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:44,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:44,160 INFO L87 Difference]: Start difference. First operand 839 states and 1261 transitions. Second operand 4 states. [2021-01-06 11:44:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:44,800 INFO L93 Difference]: Finished difference Result 1727 states and 2591 transitions. [2021-01-06 11:44:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:44,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-06 11:44:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:44,804 INFO L225 Difference]: With dead ends: 1727 [2021-01-06 11:44:44,804 INFO L226 Difference]: Without dead ends: 909 [2021-01-06 11:44:44,805 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:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-01-06 11:44:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 839. [2021-01-06 11:44:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1259 transitions. [2021-01-06 11:44:44,833 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1259 transitions. Word has length 147 [2021-01-06 11:44:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:44,833 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1259 transitions. [2021-01-06 11:44:44,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1259 transitions. [2021-01-06 11:44:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 11:44:44,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:44,835 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] [2021-01-06 11:44:44,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-01-06 11:44:44,835 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1801381364, now seen corresponding path program 1 times [2021-01-06 11:44:44,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:44,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560818750] [2021-01-06 11:44:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:44,920 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:44:44,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560818750] [2021-01-06 11:44:44,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:44,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:44,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158101446] [2021-01-06 11:44:44,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:44,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:44,922 INFO L87 Difference]: Start difference. First operand 839 states and 1259 transitions. Second operand 4 states. [2021-01-06 11:44:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:45,645 INFO L93 Difference]: Finished difference Result 1775 states and 2659 transitions. [2021-01-06 11:44:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:45,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2021-01-06 11:44:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:45,647 INFO L225 Difference]: With dead ends: 1775 [2021-01-06 11:44:45,647 INFO L226 Difference]: Without dead ends: 957 [2021-01-06 11:44:45,648 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:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-01-06 11:44:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 839. [2021-01-06 11:44:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1257 transitions. [2021-01-06 11:44:45,675 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1257 transitions. Word has length 148 [2021-01-06 11:44:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:45,676 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1257 transitions. [2021-01-06 11:44:45,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1257 transitions. [2021-01-06 11:44:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 11:44:45,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:45,677 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] [2021-01-06 11:44:45,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-01-06 11:44:45,678 INFO L429 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash 319669846, now seen corresponding path program 1 times [2021-01-06 11:44:45,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:45,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333871123] [2021-01-06 11:44:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:45,771 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:44:45,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333871123] [2021-01-06 11:44:45,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:45,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:45,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46713203] [2021-01-06 11:44:45,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:45,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:45,773 INFO L87 Difference]: Start difference. First operand 839 states and 1257 transitions. Second operand 4 states. [2021-01-06 11:44:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:46,382 INFO L93 Difference]: Finished difference Result 1727 states and 2583 transitions. [2021-01-06 11:44:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:46,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2021-01-06 11:44:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:46,385 INFO L225 Difference]: With dead ends: 1727 [2021-01-06 11:44:46,385 INFO L226 Difference]: Without dead ends: 909 [2021-01-06 11:44:46,386 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:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-01-06 11:44:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 839. [2021-01-06 11:44:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1255 transitions. [2021-01-06 11:44:46,417 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1255 transitions. Word has length 148 [2021-01-06 11:44:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:46,417 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1255 transitions. [2021-01-06 11:44:46,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1255 transitions. [2021-01-06 11:44:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 11:44:46,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:46,419 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] [2021-01-06 11:44:46,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-01-06 11:44:46,420 INFO L429 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1751794773, now seen corresponding path program 1 times [2021-01-06 11:44:46,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:46,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569162783] [2021-01-06 11:44:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:46,511 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:44:46,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569162783] [2021-01-06 11:44:46,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:46,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:46,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958536029] [2021-01-06 11:44:46,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:46,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:46,513 INFO L87 Difference]: Start difference. First operand 839 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:47,208 INFO L93 Difference]: Finished difference Result 1759 states and 2625 transitions. [2021-01-06 11:44:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:47,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 11:44:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:47,211 INFO L225 Difference]: With dead ends: 1759 [2021-01-06 11:44:47,211 INFO L226 Difference]: Without dead ends: 941 [2021-01-06 11:44:47,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-01-06 11:44:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 839. [2021-01-06 11:44:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2021-01-06 11:44:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1253 transitions. [2021-01-06 11:44:47,249 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1253 transitions. Word has length 149 [2021-01-06 11:44:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:47,250 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1253 transitions. [2021-01-06 11:44:47,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1253 transitions. [2021-01-06 11:44:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 11:44:47,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:47,252 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] [2021-01-06 11:44:47,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-01-06 11:44:47,252 INFO L429 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash -740877549, now seen corresponding path program 1 times [2021-01-06 11:44:47,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:47,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712753671] [2021-01-06 11:44:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:47,342 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:44:47,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712753671] [2021-01-06 11:44:47,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:47,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:47,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037126046] [2021-01-06 11:44:47,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:47,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:47,344 INFO L87 Difference]: Start difference. First operand 839 states and 1253 transitions. Second operand 4 states. [2021-01-06 11:44:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:47,972 INFO L93 Difference]: Finished difference Result 1749 states and 2609 transitions. [2021-01-06 11:44:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:47,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 11:44:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:47,976 INFO L225 Difference]: With dead ends: 1749 [2021-01-06 11:44:47,976 INFO L226 Difference]: Without dead ends: 931 [2021-01-06 11:44:47,977 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:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-01-06 11:44:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 841. [2021-01-06 11:44:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2021-01-06 11:44:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1255 transitions. [2021-01-06 11:44:48,015 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1255 transitions. Word has length 149 [2021-01-06 11:44:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:48,015 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1255 transitions. [2021-01-06 11:44:48,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1255 transitions. [2021-01-06 11:44:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 11:44:48,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:48,018 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] [2021-01-06 11:44:48,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-01-06 11:44:48,018 INFO L429 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -380262177, now seen corresponding path program 1 times [2021-01-06 11:44:48,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:48,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145119576] [2021-01-06 11:44:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:48,104 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:44:48,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145119576] [2021-01-06 11:44:48,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:48,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:48,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175162580] [2021-01-06 11:44:48,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:48,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:48,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:48,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:48,106 INFO L87 Difference]: Start difference. First operand 841 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:48,707 INFO L93 Difference]: Finished difference Result 1711 states and 2555 transitions. [2021-01-06 11:44:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:48,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 11:44:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:48,709 INFO L225 Difference]: With dead ends: 1711 [2021-01-06 11:44:48,709 INFO L226 Difference]: Without dead ends: 891 [2021-01-06 11:44:48,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-01-06 11:44:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 841. [2021-01-06 11:44:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2021-01-06 11:44:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1253 transitions. [2021-01-06 11:44:48,746 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1253 transitions. Word has length 149 [2021-01-06 11:44:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:48,747 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1253 transitions. [2021-01-06 11:44:48,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1253 transitions. [2021-01-06 11:44:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 11:44:48,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:48,749 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] [2021-01-06 11:44:48,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-01-06 11:44:48,749 INFO L429 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1679741845, now seen corresponding path program 1 times [2021-01-06 11:44:48,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:48,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111895591] [2021-01-06 11:44:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:48,836 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:44:48,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111895591] [2021-01-06 11:44:48,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:48,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:48,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110420365] [2021-01-06 11:44:48,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:48,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:48,838 INFO L87 Difference]: Start difference. First operand 841 states and 1253 transitions. Second operand 4 states. [2021-01-06 11:44:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:49,528 INFO L93 Difference]: Finished difference Result 1739 states and 2589 transitions. [2021-01-06 11:44:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:49,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2021-01-06 11:44:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:49,532 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:44:49,532 INFO L226 Difference]: Without dead ends: 919 [2021-01-06 11:44:49,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:44:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-01-06 11:44:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 843. [2021-01-06 11:44:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2021-01-06 11:44:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1255 transitions. [2021-01-06 11:44:49,572 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1255 transitions. Word has length 150 [2021-01-06 11:44:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:49,573 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1255 transitions. [2021-01-06 11:44:49,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1255 transitions. [2021-01-06 11:44:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 11:44:49,574 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:49,576 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] [2021-01-06 11:44:49,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-01-06 11:44:49,576 INFO L429 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 276844141, now seen corresponding path program 1 times [2021-01-06 11:44:49,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:49,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988499746] [2021-01-06 11:44:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:49,677 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:44:49,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988499746] [2021-01-06 11:44:49,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:49,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:49,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074885380] [2021-01-06 11:44:49,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:49,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:49,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:49,679 INFO L87 Difference]: Start difference. First operand 843 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:50,292 INFO L93 Difference]: Finished difference Result 1741 states and 2589 transitions. [2021-01-06 11:44:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:50,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2021-01-06 11:44:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:50,297 INFO L225 Difference]: With dead ends: 1741 [2021-01-06 11:44:50,297 INFO L226 Difference]: Without dead ends: 919 [2021-01-06 11:44:50,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:44:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-01-06 11:44:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2021-01-06 11:44:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:44:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1257 transitions. [2021-01-06 11:44:50,337 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1257 transitions. Word has length 150 [2021-01-06 11:44:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:50,337 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1257 transitions. [2021-01-06 11:44:50,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1257 transitions. [2021-01-06 11:44:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:44:50,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:50,340 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] [2021-01-06 11:44:50,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-01-06 11:44:50,340 INFO L429 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1358699259, now seen corresponding path program 1 times [2021-01-06 11:44:50,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:50,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559838749] [2021-01-06 11:44:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:50,424 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:44:50,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559838749] [2021-01-06 11:44:50,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:50,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:50,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470853217] [2021-01-06 11:44:50,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:50,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:50,427 INFO L87 Difference]: Start difference. First operand 845 states and 1257 transitions. Second operand 4 states. [2021-01-06 11:44:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:51,093 INFO L93 Difference]: Finished difference Result 1765 states and 2617 transitions. [2021-01-06 11:44:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:51,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 11:44:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:51,096 INFO L225 Difference]: With dead ends: 1765 [2021-01-06 11:44:51,096 INFO L226 Difference]: Without dead ends: 941 [2021-01-06 11:44:51,097 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:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-01-06 11:44:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 845. [2021-01-06 11:44:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2021-01-06 11:44:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1255 transitions. [2021-01-06 11:44:51,122 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1255 transitions. Word has length 151 [2021-01-06 11:44:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:51,122 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1255 transitions. [2021-01-06 11:44:51,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1255 transitions. [2021-01-06 11:44:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:44:51,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:51,124 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] [2021-01-06 11:44:51,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-01-06 11:44:51,124 INFO L429 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash -386294923, now seen corresponding path program 1 times [2021-01-06 11:44:51,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:51,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947864375] [2021-01-06 11:44:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:51,204 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:44:51,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947864375] [2021-01-06 11:44:51,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:51,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:51,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968167528] [2021-01-06 11:44:51,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:51,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:51,206 INFO L87 Difference]: Start difference. First operand 845 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:51,868 INFO L93 Difference]: Finished difference Result 1737 states and 2578 transitions. [2021-01-06 11:44:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:51,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 11:44:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:51,871 INFO L225 Difference]: With dead ends: 1737 [2021-01-06 11:44:51,871 INFO L226 Difference]: Without dead ends: 913 [2021-01-06 11:44:51,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:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-01-06 11:44:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 847. [2021-01-06 11:44:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:44:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1257 transitions. [2021-01-06 11:44:51,904 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1257 transitions. Word has length 151 [2021-01-06 11:44:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:51,904 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1257 transitions. [2021-01-06 11:44:51,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1257 transitions. [2021-01-06 11:44:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 11:44:51,906 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:51,906 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] [2021-01-06 11:44:51,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-01-06 11:44:51,906 INFO L429 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2134972602, now seen corresponding path program 1 times [2021-01-06 11:44:51,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:51,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231285288] [2021-01-06 11:44:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:51,988 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:44:51,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231285288] [2021-01-06 11:44:51,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:51,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:51,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173905674] [2021-01-06 11:44:51,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:51,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:51,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:51,989 INFO L87 Difference]: Start difference. First operand 847 states and 1257 transitions. Second operand 4 states. [2021-01-06 11:44:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:52,646 INFO L93 Difference]: Finished difference Result 1763 states and 2609 transitions. [2021-01-06 11:44:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:52,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2021-01-06 11:44:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:52,649 INFO L225 Difference]: With dead ends: 1763 [2021-01-06 11:44:52,649 INFO L226 Difference]: Without dead ends: 937 [2021-01-06 11:44:52,650 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,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-01-06 11:44:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 847. [2021-01-06 11:44:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:44:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1255 transitions. [2021-01-06 11:44:52,682 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1255 transitions. Word has length 152 [2021-01-06 11:44:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:52,682 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1255 transitions. [2021-01-06 11:44:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1255 transitions. [2021-01-06 11:44:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 11:44:52,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:52,684 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] [2021-01-06 11:44:52,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-01-06 11:44:52,684 INFO L429 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1128818102, now seen corresponding path program 1 times [2021-01-06 11:44:52,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:52,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671205014] [2021-01-06 11:44:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:52,764 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:44:52,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671205014] [2021-01-06 11:44:52,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:52,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:52,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176207728] [2021-01-06 11:44:52,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:52,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:52,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:52,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:52,766 INFO L87 Difference]: Start difference. First operand 847 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:53,423 INFO L93 Difference]: Finished difference Result 1757 states and 2597 transitions. [2021-01-06 11:44:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:53,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2021-01-06 11:44:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:53,427 INFO L225 Difference]: With dead ends: 1757 [2021-01-06 11:44:53,427 INFO L226 Difference]: Without dead ends: 931 [2021-01-06 11:44:53,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-01-06 11:44:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 847. [2021-01-06 11:44:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2021-01-06 11:44:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1253 transitions. [2021-01-06 11:44:53,471 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1253 transitions. Word has length 152 [2021-01-06 11:44:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:53,471 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1253 transitions. [2021-01-06 11:44:53,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1253 transitions. [2021-01-06 11:44:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 11:44:53,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:53,473 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] [2021-01-06 11:44:53,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-01-06 11:44:53,474 INFO L429 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash 173535669, now seen corresponding path program 1 times [2021-01-06 11:44:53,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:53,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593718354] [2021-01-06 11:44:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:53,569 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:44:53,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593718354] [2021-01-06 11:44:53,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:53,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:53,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495353698] [2021-01-06 11:44:53,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:53,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:53,571 INFO L87 Difference]: Start difference. First operand 847 states and 1253 transitions. Second operand 4 states. [2021-01-06 11:44:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:54,199 INFO L93 Difference]: Finished difference Result 1739 states and 2570 transitions. [2021-01-06 11:44:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:54,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2021-01-06 11:44:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:54,202 INFO L225 Difference]: With dead ends: 1739 [2021-01-06 11:44:54,202 INFO L226 Difference]: Without dead ends: 913 [2021-01-06 11:44:54,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:44:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-01-06 11:44:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 849. [2021-01-06 11:44:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2021-01-06 11:44:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1255 transitions. [2021-01-06 11:44:54,251 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1255 transitions. Word has length 152 [2021-01-06 11:44:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:54,251 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 1255 transitions. [2021-01-06 11:44:54,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1255 transitions. [2021-01-06 11:44:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 11:44:54,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:54,254 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] [2021-01-06 11:44:54,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-01-06 11:44:54,254 INFO L429 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1223905309, now seen corresponding path program 1 times [2021-01-06 11:44:54,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:54,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788439234] [2021-01-06 11:44:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:54,367 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:44:54,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788439234] [2021-01-06 11:44:54,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:54,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:54,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777946305] [2021-01-06 11:44:54,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:54,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:54,369 INFO L87 Difference]: Start difference. First operand 849 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:54,976 INFO L93 Difference]: Finished difference Result 1735 states and 2563 transitions. [2021-01-06 11:44:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:54,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 11:44:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:54,978 INFO L225 Difference]: With dead ends: 1735 [2021-01-06 11:44:54,978 INFO L226 Difference]: Without dead ends: 907 [2021-01-06 11:44:54,979 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:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2021-01-06 11:44:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 851. [2021-01-06 11:44:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2021-01-06 11:44:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1257 transitions. [2021-01-06 11:44:55,008 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1257 transitions. Word has length 153 [2021-01-06 11:44:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:55,008 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1257 transitions. [2021-01-06 11:44:55,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1257 transitions. [2021-01-06 11:44:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 11:44:55,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:55,010 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] [2021-01-06 11:44:55,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-01-06 11:44:55,010 INFO L429 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1915229475, now seen corresponding path program 1 times [2021-01-06 11:44:55,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:55,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402730540] [2021-01-06 11:44:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:55,095 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:44:55,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402730540] [2021-01-06 11:44:55,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:55,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:55,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377389008] [2021-01-06 11:44:55,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:55,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:55,096 INFO L87 Difference]: Start difference. First operand 851 states and 1257 transitions. Second operand 4 states. [2021-01-06 11:44:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:55,726 INFO L93 Difference]: Finished difference Result 1761 states and 2593 transitions. [2021-01-06 11:44:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:55,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 11:44:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:55,728 INFO L225 Difference]: With dead ends: 1761 [2021-01-06 11:44:55,728 INFO L226 Difference]: Without dead ends: 931 [2021-01-06 11:44:55,729 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:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-01-06 11:44:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 851. [2021-01-06 11:44:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2021-01-06 11:44:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1255 transitions. [2021-01-06 11:44:55,767 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1255 transitions. Word has length 155 [2021-01-06 11:44:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:55,767 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1255 transitions. [2021-01-06 11:44:55,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1255 transitions. [2021-01-06 11:44:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 11:44:55,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:55,769 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] [2021-01-06 11:44:55,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-01-06 11:44:55,769 INFO L429 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 570054113, now seen corresponding path program 1 times [2021-01-06 11:44:55,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:55,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639031296] [2021-01-06 11:44:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:55,862 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:44:55,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639031296] [2021-01-06 11:44:55,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:55,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:55,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910317364] [2021-01-06 11:44:55,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:55,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:55,864 INFO L87 Difference]: Start difference. First operand 851 states and 1255 transitions. Second operand 4 states. [2021-01-06 11:44:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:56,490 INFO L93 Difference]: Finished difference Result 1749 states and 2573 transitions. [2021-01-06 11:44:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:56,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2021-01-06 11:44:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:56,492 INFO L225 Difference]: With dead ends: 1749 [2021-01-06 11:44:56,492 INFO L226 Difference]: Without dead ends: 919 [2021-01-06 11:44:56,493 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:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-01-06 11:44:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 851. [2021-01-06 11:44:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2021-01-06 11:44:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1253 transitions. [2021-01-06 11:44:56,525 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1253 transitions. Word has length 156 [2021-01-06 11:44:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:56,525 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1253 transitions. [2021-01-06 11:44:56,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1253 transitions. [2021-01-06 11:44:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 11:44:56,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:56,527 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] [2021-01-06 11:44:56,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-01-06 11:44:56,527 INFO L429 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1768327197, now seen corresponding path program 1 times [2021-01-06 11:44:56,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:56,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694401904] [2021-01-06 11:44:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:56,615 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:44:56,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694401904] [2021-01-06 11:44:56,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:56,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:56,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122858333] [2021-01-06 11:44:56,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:56,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:56,617 INFO L87 Difference]: Start difference. First operand 851 states and 1253 transitions. Second operand 4 states. [2021-01-06 11:44:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:57,299 INFO L93 Difference]: Finished difference Result 1749 states and 2569 transitions. [2021-01-06 11:44:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:57,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2021-01-06 11:44:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:57,301 INFO L225 Difference]: With dead ends: 1749 [2021-01-06 11:44:57,301 INFO L226 Difference]: Without dead ends: 919 [2021-01-06 11:44:57,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:44:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-01-06 11:44:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 851. [2021-01-06 11:44:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2021-01-06 11:44:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1251 transitions. [2021-01-06 11:44:57,348 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1251 transitions. Word has length 156 [2021-01-06 11:44:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:57,348 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1251 transitions. [2021-01-06 11:44:57,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1251 transitions. [2021-01-06 11:44:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 11:44:57,350 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:57,350 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] [2021-01-06 11:44:57,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-01-06 11:44:57,351 INFO L429 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash -370540048, now seen corresponding path program 1 times [2021-01-06 11:44:57,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:57,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470116395] [2021-01-06 11:44:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:57,444 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:44:57,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470116395] [2021-01-06 11:44:57,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:57,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:57,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51700165] [2021-01-06 11:44:57,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:57,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:57,446 INFO L87 Difference]: Start difference. First operand 851 states and 1251 transitions. Second operand 4 states. [2021-01-06 11:44:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:58,103 INFO L93 Difference]: Finished difference Result 1815 states and 2683 transitions. [2021-01-06 11:44:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:58,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2021-01-06 11:44:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:58,105 INFO L225 Difference]: With dead ends: 1815 [2021-01-06 11:44:58,105 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:44:58,106 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:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:44:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 911. [2021-01-06 11:44:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2021-01-06 11:44:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1357 transitions. [2021-01-06 11:44:58,154 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1357 transitions. Word has length 156 [2021-01-06 11:44:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:58,154 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 1357 transitions. [2021-01-06 11:44:58,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1357 transitions. [2021-01-06 11:44:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 11:44:58,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:58,156 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] [2021-01-06 11:44:58,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-01-06 11:44:58,156 INFO L429 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 637903039, now seen corresponding path program 1 times [2021-01-06 11:44:58,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:58,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772709669] [2021-01-06 11:44:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:58,249 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:44:58,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772709669] [2021-01-06 11:44:58,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:58,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:58,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274963141] [2021-01-06 11:44:58,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:58,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:58,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:58,251 INFO L87 Difference]: Start difference. First operand 911 states and 1357 transitions. Second operand 4 states. [2021-01-06 11:44:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:58,908 INFO L93 Difference]: Finished difference Result 1863 states and 2770 transitions. [2021-01-06 11:44:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:58,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-06 11:44:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:58,911 INFO L225 Difference]: With dead ends: 1863 [2021-01-06 11:44:58,911 INFO L226 Difference]: Without dead ends: 973 [2021-01-06 11:44:58,912 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:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-01-06 11:44:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 911. [2021-01-06 11:44:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2021-01-06 11:44:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1355 transitions. [2021-01-06 11:44:58,943 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1355 transitions. Word has length 157 [2021-01-06 11:44:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:58,943 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 1355 transitions. [2021-01-06 11:44:58,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1355 transitions. [2021-01-06 11:44:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 11:44:58,944 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:58,944 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] [2021-01-06 11:44:58,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-01-06 11:44:58,944 INFO L429 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1858901419, now seen corresponding path program 1 times [2021-01-06 11:44:58,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:58,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083036050] [2021-01-06 11:44:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:59,030 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:44:59,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083036050] [2021-01-06 11:44:59,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:59,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:59,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398521042] [2021-01-06 11:44:59,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:59,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:59,032 INFO L87 Difference]: Start difference. First operand 911 states and 1355 transitions. Second operand 4 states. [2021-01-06 11:44:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:44:59,654 INFO L93 Difference]: Finished difference Result 1863 states and 2766 transitions. [2021-01-06 11:44:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:44:59,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2021-01-06 11:44:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:44:59,656 INFO L225 Difference]: With dead ends: 1863 [2021-01-06 11:44:59,656 INFO L226 Difference]: Without dead ends: 973 [2021-01-06 11:44:59,657 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:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-01-06 11:44:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 911. [2021-01-06 11:44:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2021-01-06 11:44:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1353 transitions. [2021-01-06 11:44:59,687 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1353 transitions. Word has length 158 [2021-01-06 11:44:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:44:59,687 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 1353 transitions. [2021-01-06 11:44:59,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:44:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1353 transitions. [2021-01-06 11:44:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:44:59,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:44:59,688 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] [2021-01-06 11:44:59,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-01-06 11:44:59,688 INFO L429 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:44:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:44:59,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1930636007, now seen corresponding path program 1 times [2021-01-06 11:44:59,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:44:59,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878542705] [2021-01-06 11:44:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:44:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:44:59,781 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:44:59,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878542705] [2021-01-06 11:44:59,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:44:59,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:44:59,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241579185] [2021-01-06 11:44:59,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:44:59,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:44:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:44:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:44:59,783 INFO L87 Difference]: Start difference. First operand 911 states and 1353 transitions. Second operand 4 states. [2021-01-06 11:45:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:00,413 INFO L93 Difference]: Finished difference Result 1857 states and 2755 transitions. [2021-01-06 11:45:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:00,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 11:45:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:00,416 INFO L225 Difference]: With dead ends: 1857 [2021-01-06 11:45:00,416 INFO L226 Difference]: Without dead ends: 967 [2021-01-06 11:45:00,416 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,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-01-06 11:45:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 835. [2021-01-06 11:45:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2021-01-06 11:45:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1241 transitions. [2021-01-06 11:45:00,467 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1241 transitions. Word has length 159 [2021-01-06 11:45:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:00,467 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 1241 transitions. [2021-01-06 11:45:00,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1241 transitions. [2021-01-06 11:45:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:45:00,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:00,469 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] [2021-01-06 11:45:00,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-01-06 11:45:00,469 INFO L429 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash 515522094, now seen corresponding path program 1 times [2021-01-06 11:45:00,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:00,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980806598] [2021-01-06 11:45:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:00,557 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:00,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980806598] [2021-01-06 11:45:00,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:00,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:00,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138657693] [2021-01-06 11:45:00,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:00,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:00,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:00,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:00,559 INFO L87 Difference]: Start difference. First operand 835 states and 1241 transitions. Second operand 4 states. [2021-01-06 11:45:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:01,184 INFO L93 Difference]: Finished difference Result 1781 states and 2641 transitions. [2021-01-06 11:45:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:01,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 11:45:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:01,187 INFO L225 Difference]: With dead ends: 1781 [2021-01-06 11:45:01,187 INFO L226 Difference]: Without dead ends: 967 [2021-01-06 11:45:01,188 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,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-01-06 11:45:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 895. [2021-01-06 11:45:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2021-01-06 11:45:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2021-01-06 11:45:01,235 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 159 [2021-01-06 11:45:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:01,235 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2021-01-06 11:45:01,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2021-01-06 11:45:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 11:45:01,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:01,236 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] [2021-01-06 11:45:01,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-01-06 11:45:01,237 INFO L429 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1330228607, now seen corresponding path program 1 times [2021-01-06 11:45:01,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:01,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076140207] [2021-01-06 11:45:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:01,314 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:01,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076140207] [2021-01-06 11:45:01,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:01,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:01,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130150800] [2021-01-06 11:45:01,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:01,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:01,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:01,316 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 4 states. [2021-01-06 11:45:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:01,906 INFO L93 Difference]: Finished difference Result 1819 states and 2707 transitions. [2021-01-06 11:45:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:01,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 11:45:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:01,908 INFO L225 Difference]: With dead ends: 1819 [2021-01-06 11:45:01,908 INFO L226 Difference]: Without dead ends: 945 [2021-01-06 11:45:01,909 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,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-01-06 11:45:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 895. [2021-01-06 11:45:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2021-01-06 11:45:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1329 transitions. [2021-01-06 11:45:01,941 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1329 transitions. Word has length 159 [2021-01-06 11:45:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:01,941 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1329 transitions. [2021-01-06 11:45:01,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1329 transitions. [2021-01-06 11:45:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 11:45:01,942 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:01,942 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] [2021-01-06 11:45:01,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-01-06 11:45:01,942 INFO L429 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash 762046113, now seen corresponding path program 1 times [2021-01-06 11:45:01,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:01,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181628076] [2021-01-06 11:45:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:02,045 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:02,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181628076] [2021-01-06 11:45:02,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:02,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:02,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091824940] [2021-01-06 11:45:02,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:02,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:02,047 INFO L87 Difference]: Start difference. First operand 895 states and 1329 transitions. Second operand 4 states. [2021-01-06 11:45:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:02,682 INFO L93 Difference]: Finished difference Result 1837 states and 2721 transitions. [2021-01-06 11:45:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:02,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 11:45:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:02,684 INFO L225 Difference]: With dead ends: 1837 [2021-01-06 11:45:02,684 INFO L226 Difference]: Without dead ends: 963 [2021-01-06 11:45:02,685 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,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-01-06 11:45:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 897. [2021-01-06 11:45:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2021-01-06 11:45:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1331 transitions. [2021-01-06 11:45:02,716 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1331 transitions. Word has length 160 [2021-01-06 11:45:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:02,717 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1331 transitions. [2021-01-06 11:45:02,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1331 transitions. [2021-01-06 11:45:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 11:45:02,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:02,718 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] [2021-01-06 11:45:02,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-01-06 11:45:02,718 INFO L429 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1252382390, now seen corresponding path program 1 times [2021-01-06 11:45:02,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:02,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610099867] [2021-01-06 11:45:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:02,800 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:02,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610099867] [2021-01-06 11:45:02,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:02,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:02,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411035696] [2021-01-06 11:45:02,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:02,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:02,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:02,802 INFO L87 Difference]: Start difference. First operand 897 states and 1331 transitions. Second operand 4 states. [2021-01-06 11:45:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:03,381 INFO L93 Difference]: Finished difference Result 1819 states and 2703 transitions. [2021-01-06 11:45:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:03,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 11:45:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:03,383 INFO L225 Difference]: With dead ends: 1819 [2021-01-06 11:45:03,384 INFO L226 Difference]: Without dead ends: 943 [2021-01-06 11:45:03,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-01-06 11:45:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 897. [2021-01-06 11:45:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2021-01-06 11:45:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1329 transitions. [2021-01-06 11:45:03,417 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1329 transitions. Word has length 160 [2021-01-06 11:45:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:03,417 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1329 transitions. [2021-01-06 11:45:03,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1329 transitions. [2021-01-06 11:45:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 11:45:03,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:03,418 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] [2021-01-06 11:45:03,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-01-06 11:45:03,419 INFO L429 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1357963213, now seen corresponding path program 1 times [2021-01-06 11:45:03,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:03,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829211023] [2021-01-06 11:45:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:03,505 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:03,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829211023] [2021-01-06 11:45:03,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:03,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:03,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301157547] [2021-01-06 11:45:03,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:03,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:03,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:03,507 INFO L87 Difference]: Start difference. First operand 897 states and 1329 transitions. Second operand 4 states. [2021-01-06 11:45:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:04,126 INFO L93 Difference]: Finished difference Result 1839 states and 2717 transitions. [2021-01-06 11:45:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:04,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 11:45:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:04,128 INFO L225 Difference]: With dead ends: 1839 [2021-01-06 11:45:04,128 INFO L226 Difference]: Without dead ends: 963 [2021-01-06 11:45:04,129 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,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-01-06 11:45:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 921. [2021-01-06 11:45:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2021-01-06 11:45:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1357 transitions. [2021-01-06 11:45:04,163 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1357 transitions. Word has length 161 [2021-01-06 11:45:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:04,163 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1357 transitions. [2021-01-06 11:45:04,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1357 transitions. [2021-01-06 11:45:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-01-06 11:45:04,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:04,165 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] [2021-01-06 11:45:04,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-01-06 11:45:04,165 INFO L429 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1425723221, now seen corresponding path program 1 times [2021-01-06 11:45:04,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:04,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038493661] [2021-01-06 11:45:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:04,250 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:04,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038493661] [2021-01-06 11:45:04,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:04,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:04,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848918072] [2021-01-06 11:45:04,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:04,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:04,252 INFO L87 Difference]: Start difference. First operand 921 states and 1357 transitions. Second operand 4 states. [2021-01-06 11:45:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:04,870 INFO L93 Difference]: Finished difference Result 1855 states and 2733 transitions. [2021-01-06 11:45:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:04,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2021-01-06 11:45:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:04,872 INFO L225 Difference]: With dead ends: 1855 [2021-01-06 11:45:04,873 INFO L226 Difference]: Without dead ends: 951 [2021-01-06 11:45:04,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-01-06 11:45:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 919. [2021-01-06 11:45:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2021-01-06 11:45:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2021-01-06 11:45:04,906 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 162 [2021-01-06 11:45:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:04,906 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2021-01-06 11:45:04,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2021-01-06 11:45:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-01-06 11:45:04,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:04,908 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] [2021-01-06 11:45:04,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-01-06 11:45:04,908 INFO L429 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1881078131, now seen corresponding path program 1 times [2021-01-06 11:45:04,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:04,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663288753] [2021-01-06 11:45:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:05,134 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:05,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663288753] [2021-01-06 11:45:05,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:05,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:05,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290744328] [2021-01-06 11:45:05,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:05,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:05,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:05,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:05,136 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 5 states. [2021-01-06 11:45:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:06,172 INFO L93 Difference]: Finished difference Result 1975 states and 2923 transitions. [2021-01-06 11:45:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:45:06,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2021-01-06 11:45:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:06,174 INFO L225 Difference]: With dead ends: 1975 [2021-01-06 11:45:06,174 INFO L226 Difference]: Without dead ends: 1077 [2021-01-06 11:45:06,175 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:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2021-01-06 11:45:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 985. [2021-01-06 11:45:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2021-01-06 11:45:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1471 transitions. [2021-01-06 11:45:06,215 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1471 transitions. Word has length 162 [2021-01-06 11:45:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:06,215 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1471 transitions. [2021-01-06 11:45:06,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1471 transitions. [2021-01-06 11:45:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-01-06 11:45:06,216 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:06,216 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] [2021-01-06 11:45:06,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-01-06 11:45:06,216 INFO L429 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1044817544, now seen corresponding path program 1 times [2021-01-06 11:45:06,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:06,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806882863] [2021-01-06 11:45:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:06,310 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:06,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806882863] [2021-01-06 11:45:06,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:06,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:06,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315771345] [2021-01-06 11:45:06,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:06,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:06,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:06,312 INFO L87 Difference]: Start difference. First operand 985 states and 1471 transitions. Second operand 4 states. [2021-01-06 11:45:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:06,933 INFO L93 Difference]: Finished difference Result 2001 states and 2987 transitions. [2021-01-06 11:45:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:06,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2021-01-06 11:45:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:06,936 INFO L225 Difference]: With dead ends: 2001 [2021-01-06 11:45:06,936 INFO L226 Difference]: Without dead ends: 1037 [2021-01-06 11:45:06,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-01-06 11:45:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 985. [2021-01-06 11:45:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2021-01-06 11:45:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1469 transitions. [2021-01-06 11:45:06,974 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1469 transitions. Word has length 165 [2021-01-06 11:45:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:06,974 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1469 transitions. [2021-01-06 11:45:06,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1469 transitions. [2021-01-06 11:45:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-01-06 11:45:06,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:06,975 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] [2021-01-06 11:45:06,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-01-06 11:45:06,975 INFO L429 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash -363842409, now seen corresponding path program 1 times [2021-01-06 11:45:06,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:06,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127203405] [2021-01-06 11:45:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:07,069 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:07,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127203405] [2021-01-06 11:45:07,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:07,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:07,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44189571] [2021-01-06 11:45:07,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:07,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:07,071 INFO L87 Difference]: Start difference. First operand 985 states and 1469 transitions. Second operand 4 states. [2021-01-06 11:45:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:07,716 INFO L93 Difference]: Finished difference Result 1997 states and 2979 transitions. [2021-01-06 11:45:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:07,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2021-01-06 11:45:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:07,719 INFO L225 Difference]: With dead ends: 1997 [2021-01-06 11:45:07,719 INFO L226 Difference]: Without dead ends: 1033 [2021-01-06 11:45:07,720 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,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-01-06 11:45:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 985. [2021-01-06 11:45:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2021-01-06 11:45:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1467 transitions. [2021-01-06 11:45:07,755 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1467 transitions. Word has length 166 [2021-01-06 11:45:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:07,755 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1467 transitions. [2021-01-06 11:45:07,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1467 transitions. [2021-01-06 11:45:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 11:45:07,757 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:07,757 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] [2021-01-06 11:45:07,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-01-06 11:45:07,757 INFO L429 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1900769027, now seen corresponding path program 1 times [2021-01-06 11:45:07,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:07,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642501202] [2021-01-06 11:45:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:08,288 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:08,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642501202] [2021-01-06 11:45:08,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885977320] [2021-01-06 11:45:08,289 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:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:08,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-06 11:45:08,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:08,924 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:08,924 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:08,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,036 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:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,102 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:09,105 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,192 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:09,195 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,290 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:09,291 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:09,294 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,320 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:09,320 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2021-01-06 11:45:09,415 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:09,416 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:09,419 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:09,534 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:09,534 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:09,537 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,552 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:09,567 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:09,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,578 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:09,580 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,638 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:09,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,726 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:09,729 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,757 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2021-01-06 11:45:09,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:09,851 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:09,853 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:09,872 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:09,872 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2021-01-06 11:45:09,988 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:09,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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:09,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:10,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:10,006 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:10,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:10,071 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:10,071 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:10,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:10,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:10,089 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:10,089 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:45:10,178 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2021-01-06 11:45:10,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:10,186 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:10,188 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:10,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:10,528 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-06 11:45:10,529 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2021-01-06 11:45:10,530 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:10,544 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:10,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:45:10,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:10,557 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:10,559 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:10,561 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:10,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2021-01-06 11:45:10,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 11:45:10,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:10,573 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:10,575 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:10,577 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:10,585 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:10,632 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2021-01-06 11:45:10,635 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:10,635 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2021-01-06 11:45:10,725 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2021-01-06 11:45:10,731 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:10,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,111 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2021-01-06 11:45:11,112 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2021-01-06 11:45:11,112 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:11,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:45:11,119 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:11,123 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:11,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,147 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:11,147 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2021-01-06 11:45:11,359 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2021-01-06 11:45:11,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11,367 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:11,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,691 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-01-06 11:45:11,692 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2021-01-06 11:45:11,693 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:11,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-06 11:45:11,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:45:11,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-06 11:45:11,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:45:11,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:45:11,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:11,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:45:11,705 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:11,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:45:11,706 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:11,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:45:11,707 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:11,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:45:11,707 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:11,715 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:11,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,739 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:11,739 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2021-01-06 11:45:11,828 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:11,835 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:11,837 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:11,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,873 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:11,874 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:11,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:11,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:11,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:12,014 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-01-06 11:45:12,015 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:12,016 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:12,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:45:12,028 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:12,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:45:12,030 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:12,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:45:12,031 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:45:12,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:45:12,033 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,039 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,040 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,042 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,043 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,045 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,047 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,050 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:12,051 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,052 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,053 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:45:12,056 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:12,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:12,059 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,063 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,064 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,068 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,069 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:45:12,070 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,072 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,074 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,076 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:12,077 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,080 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,081 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,083 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:45:12,084 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:45:12,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:12,088 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,089 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,090 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,091 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,092 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,097 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,099 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,100 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,103 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,104 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:12,109 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,110 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,114 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,115 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,116 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,117 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,122 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,124 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,125 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,128 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,129 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,130 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,135 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,137 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,138 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,141 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:45:12,142 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,144 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2021-01-06 11:45:12,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:12,146 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,147 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:12,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:12,151 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,152 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2021-01-06 11:45:12,153 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:45:12,154 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:45:12,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:12,158 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:45:12,162 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:12,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:12,176 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:12,176 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2021-01-06 11:45:12,244 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:45:12,244 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:12,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:12,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:12,264 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:12,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2021-01-06 11:45:12,523 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:12,523 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:12,526 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:12,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:12,537 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:12,537 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2021-01-06 11:45:12,957 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:12,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:12,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-01-06 11:45:12,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645124802] [2021-01-06 11:45:12,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 11:45:12,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 11:45:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:45:12,960 INFO L87 Difference]: Start difference. First operand 985 states and 1467 transitions. Second operand 16 states. [2021-01-06 11:45:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:21,069 INFO L93 Difference]: Finished difference Result 3729 states and 5515 transitions. [2021-01-06 11:45:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:45:21,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 167 [2021-01-06 11:45:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:21,076 INFO L225 Difference]: With dead ends: 3729 [2021-01-06 11:45:21,076 INFO L226 Difference]: Without dead ends: 2765 [2021-01-06 11:45:21,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2021-01-06 11:45:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2021-01-06 11:45:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1838. [2021-01-06 11:45:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2738 transitions. [2021-01-06 11:45:21,249 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2738 transitions. Word has length 167 [2021-01-06 11:45:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:21,250 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2738 transitions. [2021-01-06 11:45:21,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 11:45:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2738 transitions. [2021-01-06 11:45:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 11:45:21,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:21,253 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] [2021-01-06 11:45:21,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2021-01-06 11:45:21,462 INFO L429 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash -456243620, now seen corresponding path program 1 times [2021-01-06 11:45:21,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:21,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528354353] [2021-01-06 11:45:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:21,582 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:21,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528354353] [2021-01-06 11:45:21,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:21,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:21,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307004938] [2021-01-06 11:45:21,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:21,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:21,583 INFO L87 Difference]: Start difference. First operand 1838 states and 2738 transitions. Second operand 4 states. [2021-01-06 11:45:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:22,387 INFO L93 Difference]: Finished difference Result 2930 states and 4351 transitions. [2021-01-06 11:45:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:22,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 11:45:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:22,391 INFO L225 Difference]: With dead ends: 2930 [2021-01-06 11:45:22,391 INFO L226 Difference]: Without dead ends: 1966 [2021-01-06 11:45:22,392 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,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-01-06 11:45:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1838. [2021-01-06 11:45:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2734 transitions. [2021-01-06 11:45:22,529 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2734 transitions. Word has length 171 [2021-01-06 11:45:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:22,530 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2734 transitions. [2021-01-06 11:45:22,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2734 transitions. [2021-01-06 11:45:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-01-06 11:45:22,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:22,532 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] [2021-01-06 11:45:22,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-01-06 11:45:22,533 INFO L429 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1193301233, now seen corresponding path program 1 times [2021-01-06 11:45:22,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:22,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337815258] [2021-01-06 11:45:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:22,634 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:22,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337815258] [2021-01-06 11:45:22,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:22,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:22,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236463555] [2021-01-06 11:45:22,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:22,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:22,635 INFO L87 Difference]: Start difference. First operand 1838 states and 2734 transitions. Second operand 4 states. [2021-01-06 11:45:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:23,531 INFO L93 Difference]: Finished difference Result 2930 states and 4345 transitions. [2021-01-06 11:45:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:23,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2021-01-06 11:45:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:23,535 INFO L225 Difference]: With dead ends: 2930 [2021-01-06 11:45:23,535 INFO L226 Difference]: Without dead ends: 1966 [2021-01-06 11:45:23,536 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,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-01-06 11:45:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1838. [2021-01-06 11:45:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2730 transitions. [2021-01-06 11:45:23,671 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2730 transitions. Word has length 172 [2021-01-06 11:45:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:23,672 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2730 transitions. [2021-01-06 11:45:23,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2730 transitions. [2021-01-06 11:45:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-01-06 11:45:23,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:23,674 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] [2021-01-06 11:45:23,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-01-06 11:45:23,674 INFO L429 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1302488063, now seen corresponding path program 1 times [2021-01-06 11:45:23,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:23,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448387948] [2021-01-06 11:45:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:23,773 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:23,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448387948] [2021-01-06 11:45:23,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:23,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:23,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517134729] [2021-01-06 11:45:23,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:23,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:23,775 INFO L87 Difference]: Start difference. First operand 1838 states and 2730 transitions. Second operand 4 states. [2021-01-06 11:45:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:24,581 INFO L93 Difference]: Finished difference Result 2930 states and 4339 transitions. [2021-01-06 11:45:24,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:24,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2021-01-06 11:45:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:24,585 INFO L225 Difference]: With dead ends: 2930 [2021-01-06 11:45:24,585 INFO L226 Difference]: Without dead ends: 1966 [2021-01-06 11:45:24,586 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,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-01-06 11:45:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1838. [2021-01-06 11:45:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2726 transitions. [2021-01-06 11:45:24,716 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2726 transitions. Word has length 173 [2021-01-06 11:45:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:24,716 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2726 transitions. [2021-01-06 11:45:24,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2726 transitions. [2021-01-06 11:45:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-01-06 11:45:24,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:24,718 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] [2021-01-06 11:45:24,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-01-06 11:45:24,718 INFO L429 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 872450196, now seen corresponding path program 1 times [2021-01-06 11:45:24,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:24,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023509616] [2021-01-06 11:45:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:24,820 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:24,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023509616] [2021-01-06 11:45:24,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:24,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:45:24,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773684247] [2021-01-06 11:45:24,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:24,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:24,822 INFO L87 Difference]: Start difference. First operand 1838 states and 2726 transitions. Second operand 4 states. [2021-01-06 11:45:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:25,655 INFO L93 Difference]: Finished difference Result 2910 states and 4309 transitions. [2021-01-06 11:45:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:25,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2021-01-06 11:45:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:25,660 INFO L225 Difference]: With dead ends: 2910 [2021-01-06 11:45:25,660 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 11:45:25,661 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,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 11:45:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1838. [2021-01-06 11:45:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2722 transitions. [2021-01-06 11:45:25,791 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2722 transitions. Word has length 174 [2021-01-06 11:45:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:25,791 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2722 transitions. [2021-01-06 11:45:25,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2722 transitions. [2021-01-06 11:45:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-06 11:45:25,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:25,794 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] [2021-01-06 11:45:25,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-01-06 11:45:25,794 INFO L429 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -623839111, now seen corresponding path program 1 times [2021-01-06 11:45:25,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:25,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032179801] [2021-01-06 11:45:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:25,970 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:25,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032179801] [2021-01-06 11:45:25,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:25,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:25,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853407448] [2021-01-06 11:45:25,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:25,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:25,972 INFO L87 Difference]: Start difference. First operand 1838 states and 2722 transitions. Second operand 5 states. [2021-01-06 11:45:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:27,043 INFO L93 Difference]: Finished difference Result 4178 states and 6240 transitions. [2021-01-06 11:45:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:27,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2021-01-06 11:45:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:27,048 INFO L225 Difference]: With dead ends: 4178 [2021-01-06 11:45:27,048 INFO L226 Difference]: Without dead ends: 2361 [2021-01-06 11:45:27,050 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:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2021-01-06 11:45:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1996. [2021-01-06 11:45:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2021-01-06 11:45:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3008 transitions. [2021-01-06 11:45:27,186 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3008 transitions. Word has length 177 [2021-01-06 11:45:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:27,187 INFO L481 AbstractCegarLoop]: Abstraction has 1996 states and 3008 transitions. [2021-01-06 11:45:27,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3008 transitions. [2021-01-06 11:45:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 11:45:27,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:27,189 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:27,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-01-06 11:45:27,189 INFO L429 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1894627737, now seen corresponding path program 1 times [2021-01-06 11:45:27,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:27,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998767921] [2021-01-06 11:45:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:27,385 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:27,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998767921] [2021-01-06 11:45:27,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:27,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:45:27,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357936352] [2021-01-06 11:45:27,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:45:27,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:45:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:27,386 INFO L87 Difference]: Start difference. First operand 1996 states and 3008 transitions. Second operand 5 states. [2021-01-06 11:45:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:28,413 INFO L93 Difference]: Finished difference Result 4382 states and 6630 transitions. [2021-01-06 11:45:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:28,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 11:45:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:28,417 INFO L225 Difference]: With dead ends: 4382 [2021-01-06 11:45:28,417 INFO L226 Difference]: Without dead ends: 2407 [2021-01-06 11:45:28,418 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:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2021-01-06 11:45:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2104. [2021-01-06 11:45:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2021-01-06 11:45:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3228 transitions. [2021-01-06 11:45:28,510 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 3228 transitions. Word has length 178 [2021-01-06 11:45:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:28,510 INFO L481 AbstractCegarLoop]: Abstraction has 2104 states and 3228 transitions. [2021-01-06 11:45:28,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:45:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 3228 transitions. [2021-01-06 11:45:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-06 11:45:28,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:28,512 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] [2021-01-06 11:45:28,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-01-06 11:45:28,513 INFO L429 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1918301126, now seen corresponding path program 1 times [2021-01-06 11:45:28,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:28,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653056763] [2021-01-06 11:45:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:29,311 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:29,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653056763] [2021-01-06 11:45:29,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253691884] [2021-01-06 11:45:29,312 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:45:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:29,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-06 11:45:29,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:29,887 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:45:29,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:29,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:29,950 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:45:29,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:29,990 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:45:29,992 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,062 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:45:30,065 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,158 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:45:30,158 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:45:30,160 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,176 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:30,176 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:10 [2021-01-06 11:45:30,228 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:45:30,228 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:45:30,230 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,233 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,234 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:45:30,279 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:45:30,280 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:45:30,281 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,286 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:45:30,299 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:30,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,360 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-01-06 11:45:30,361 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:45:30,363 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,374 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,375 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:45:30,434 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:45:30,434 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:45:30,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,441 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:45:30,465 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:45:30,466 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:45:30,467 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,471 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2021-01-06 11:45:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,531 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:45:30,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,570 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-01-06 11:45:30,571 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:45:30,573 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,578 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,578 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:45:30,621 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 2=[|v_#memory_$Pointer$.base_186|]} [2021-01-06 11:45:30,626 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:45:30,628 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:30,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,676 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2021-01-06 11:45:30,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:45:30,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:30,682 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,687 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2021-01-06 11:45:30,708 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:30,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,767 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-01-06 11:45:30,768 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:45:30,769 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,780 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,780 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2021-01-06 11:45:30,836 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 2=[|v_#memory_$Pointer$.base_188|]} [2021-01-06 11:45:30,843 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:45:30,845 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:30,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,891 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,891 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:45:30,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-06 11:45:30,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:45:30,898 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:30,903 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:30,903 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2021-01-06 11:45:30,914 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:45:30,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:30,934 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:45:30,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,020 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:31,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:31,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:31,097 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:45:31,099 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:31,167 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:45:31,168 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,214 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:45:31,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:45:31,343 INFO L348 Elim1Store]: treesize reduction 68, result has 47.3 percent of original size [2021-01-06 11:45:31,343 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:45:31,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 1] term [2021-01-06 11:45:31,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:45:31,349 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,380 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,380 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:275, output treesize:50 [2021-01-06 11:45:31,499 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:45:31,504 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:45:31,506 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:31,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,534 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:45:31,536 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:31,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,582 INFO L348 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-01-06 11:45:31,583 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:45:31,585 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,603 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:45:31,603 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:38 [2021-01-06 11:45:31,874 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:45:31,874 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2021-01-06 11:45:31,876 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:45:31,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:45:31,886 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:31,886 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2021-01-06 11:45:32,102 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:45:32,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:45:32,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-01-06 11:45:32,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217255844] [2021-01-06 11:45:32,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:45:32,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:45:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:45:32,104 INFO L87 Difference]: Start difference. First operand 2104 states and 3228 transitions. Second operand 13 states. [2021-01-06 11:45:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:38,572 INFO L93 Difference]: Finished difference Result 6559 states and 10027 transitions. [2021-01-06 11:45:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:45:38,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 191 [2021-01-06 11:45:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:38,578 INFO L225 Difference]: With dead ends: 6559 [2021-01-06 11:45:38,578 INFO L226 Difference]: Without dead ends: 4476 [2021-01-06 11:45:38,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-01-06 11:45:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2021-01-06 11:45:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 3335. [2021-01-06 11:45:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3335 states. [2021-01-06 11:45:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 5263 transitions. [2021-01-06 11:45:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 5263 transitions. Word has length 191 [2021-01-06 11:45:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:38,770 INFO L481 AbstractCegarLoop]: Abstraction has 3335 states and 5263 transitions. [2021-01-06 11:45:38,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:45:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 5263 transitions. [2021-01-06 11:45:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-01-06 11:45:38,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:38,772 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] [2021-01-06 11:45:38,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:38,974 INFO L429 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1233344752, now seen corresponding path program 1 times [2021-01-06 11:45:38,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:38,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881205359] [2021-01-06 11:45:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:45:39,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:45:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:45:39,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:45:39,375 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:45:39,375 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:45:39,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-01-06 11:45:39,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:45:39 BoogieIcfgContainer [2021-01-06 11:45:39,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:45:39,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:45:39,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:45:39,627 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:45:39,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:43:47" (3/4) ... [2021-01-06 11:45:39,631 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:45:39,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:45:39,632 INFO L168 Benchmark]: Toolchain (without parser) took 115183.26 ms. Allocated memory was 169.9 MB in the beginning and 577.8 MB in the end (delta: 407.9 MB). Free memory was 142.2 MB in the beginning and 360.5 MB in the end (delta: -218.3 MB). Peak memory consumption was 190.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:45:39,633 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 169.9 MB. Free memory is still 140.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:45:39,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.66 ms. Allocated memory is still 169.9 MB. Free memory was 142.0 MB in the beginning and 143.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 32.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:45:39,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.01 ms. Allocated memory is still 169.9 MB. Free memory was 143.8 MB in the beginning and 139.1 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:45:39,634 INFO L168 Benchmark]: Boogie Preprocessor took 84.07 ms. Allocated memory is still 169.9 MB. Free memory was 139.1 MB in the beginning and 132.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:45:39,634 INFO L168 Benchmark]: RCFGBuilder took 1537.36 ms. Allocated memory was 169.9 MB in the beginning and 218.1 MB in the end (delta: 48.2 MB). Free memory was 132.2 MB in the beginning and 178.9 MB in the end (delta: -46.7 MB). Peak memory consumption was 84.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:45:39,635 INFO L168 Benchmark]: TraceAbstraction took 112534.80 ms. Allocated memory was 218.1 MB in the beginning and 577.8 MB in the end (delta: 359.7 MB). Free memory was 178.4 MB in the beginning and 360.5 MB in the end (delta: -182.1 MB). Peak memory consumption was 177.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:45:39,635 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 577.8 MB. Free memory is still 360.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:45:39,639 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.20 ms. Allocated memory is still 169.9 MB. Free memory is still 140.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 866.66 ms. Allocated memory is still 169.9 MB. Free memory was 142.0 MB in the beginning and 143.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 32.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 146.01 ms. Allocated memory is still 169.9 MB. Free memory was 143.8 MB in the beginning and 139.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 84.07 ms. Allocated memory is still 169.9 MB. Free memory was 139.1 MB in the beginning and 132.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1537.36 ms. Allocated memory was 169.9 MB in the beginning and 218.1 MB in the end (delta: 48.2 MB). Free memory was 132.2 MB in the beginning and 178.9 MB in the end (delta: -46.7 MB). Peak memory consumption was 84.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 112534.80 ms. Allocated memory was 218.1 MB in the beginning and 577.8 MB in the end (delta: 359.7 MB). Free memory was 178.4 MB in the beginning and 360.5 MB in the end (delta: -182.1 MB). Peak memory consumption was 177.6 MB. Max. memory is 8.0 GB. * Witness Printer took 5.01 ms. Allocated memory is still 577.8 MB. Free memory is still 360.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1752]: 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}] [L1711] EXPR s->s3 [L1711] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1711] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1740] 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}] [L1711] EXPR s->s3 [L1711] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1711] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1740] 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 [L1596] EXPR s->session [L1596] EXPR s->s3 [L1596] EXPR (s->s3)->tmp.new_cipher [L1596] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1597] COND FALSE !(! tmp___9) [L1603] ret = __VERIFIER_nondet_int() [L1604] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1607] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8672 [L1619] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1620] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1711] EXPR s->s3 [L1711] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1711] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1740] 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 [L1629] ret = __VERIFIER_nondet_int() [L1630] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1633] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1639] COND FALSE !(ret <= 0) [L1644] s->state = 8448 [L1645] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1645] COND TRUE s->hit [L1646] EXPR s->s3 [L1646] (s->s3)->tmp.next_state = 8640 [L1650] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1711] EXPR s->s3 [L1711] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1711] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1740] 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 [L1711] EXPR s->s3 [L1711] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1711] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1740] 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}] [L1752] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 112.2s, OverallIterations: 121, TraceHistogramMax: 7, AutomataDifference: 87.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27554 SDtfs, 9859 SDslu, 45181 SDs, 0 SdLazy, 29406 SolverSat, 1436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1047 GetRequests, 602 SyntacticMatches, 45 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3335occurred 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.3s AutomataMinimizationTime, 120 MinimizatonAttempts, 9684 StatesRemovedByMinimization, 118 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 15109 NumberOfCodeBlocks, 15109 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 14791 ConstructedInterpolants, 115 QuantifiedInterpolants, 8244282 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 86 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...