/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/recursive-with-pointer/system-with-recursion.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:28:03,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:28:03,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:28:04,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:28:04,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:28:04,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:28:04,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:28:04,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:28:04,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:28:04,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:28:04,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:28:04,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:28:04,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:28:04,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:28:04,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:28:04,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:28:04,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:28:04,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:28:04,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:28:04,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:28:04,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:28:04,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:28:04,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:28:04,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:28:04,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:28:04,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:28:04,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:28:04,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:28:04,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:28:04,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:28:04,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:28:04,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:28:04,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:28:04,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:28:04,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:28:04,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:28:04,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:28:04,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:28:04,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:28:04,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:28:04,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:28:04,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:28:04,204 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:28:04,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:28:04,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:28:04,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:28:04,210 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:28:04,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:28:04,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:28:04,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:28:04,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:28:04,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:28:04,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:28:04,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:28:04,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:28:04,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:28:04,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:28:04,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:28:04,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:28:04,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:28:04,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:28:04,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:28:04,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:28:04,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:28:04,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:28:04,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:28:04,218 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:28:04,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:28:04,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:28:04,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:28:04,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:28:04,690 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:28:04,691 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:28:04,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2020-12-23 09:28:04,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4242bbd8b/3d4dc4aae0e241e685491333574ac076/FLAGab4b5a265 [2020-12-23 09:28:05,603 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:28:05,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2020-12-23 09:28:05,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4242bbd8b/3d4dc4aae0e241e685491333574ac076/FLAGab4b5a265 [2020-12-23 09:28:05,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4242bbd8b/3d4dc4aae0e241e685491333574ac076 [2020-12-23 09:28:05,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:28:05,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:28:05,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:05,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:28:05,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:28:05,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:05" (1/1) ... [2020-12-23 09:28:05,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11331a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:05, skipping insertion in model container [2020-12-23 09:28:05,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:05" (1/1) ... [2020-12-23 09:28:05,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:28:05,967 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem19,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem19,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem21,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem21,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem25,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem25,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem27,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[#t~mem27,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem29,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[#t~mem29,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~e~0,],primitive] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~e~1,],primitive] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~e~1,],primitive] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~message~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~1,],base],StructAccessExpression[IdentifierExpression[~message~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~e,],base],StructAccessExpression[IdentifierExpression[~e,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~message~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~2,],base],StructAccessExpression[IdentifierExpression[~message~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~e,],base],StructAccessExpression[IdentifierExpression[~e,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~message~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~3,],base],StructAccessExpression[IdentifierExpression[~message~3,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] [2020-12-23 09:28:06,406 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/recursive-with-pointer/system-with-recursion.i[36399,36412] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem90,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem90,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,GLOBAL] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~e~2,],primitive] [2020-12-23 09:28:06,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:06,437 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem19,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem19,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem21,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem21,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem25,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem25,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem27,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[#t~mem27,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem29,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[#t~mem29,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#e~0,],base],StructAccessExpression[IdentifierExpression[~#e~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#e~1,],base],StructAccessExpression[IdentifierExpression[~#e~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#e~1,],base],StructAccessExpression[IdentifierExpression[~#e~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],StructAccessExpression[IdentifierExpression[~message,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~message,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~message~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~1,],base],StructAccessExpression[IdentifierExpression[~message~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~e,],base],StructAccessExpression[IdentifierExpression[~e,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~message~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~2,],base],StructAccessExpression[IdentifierExpression[~message~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~e,],base],StructAccessExpression[IdentifierExpression[~e,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~rc~0,] left hand side expression in assignment: lhs: VariableLHS[~message~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~3,],base],StructAccessExpression[IdentifierExpression[~message~3,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~message~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~message~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] [2020-12-23 09:28:06,516 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/recursive-with-pointer/system-with-recursion.i[36399,36412] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~1,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: lhs: VariableLHS[~rc~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem84,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem84,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#e~2,],base],StructAccessExpression[IdentifierExpression[~#e~2,],offset]]] [2020-12-23 09:28:06,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:06,711 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:28:06,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06 WrapperNode [2020-12-23 09:28:06,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:06,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:06,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:28:06,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:28:06,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:06,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:28:06,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:28:06,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:28:06,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:28:06,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:28:06,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:28:06,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:28:06,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:28:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 09:28:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2020-12-23 09:28:07,000 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2020-12-23 09:28:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 09:28:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 09:28:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2020-12-23 09:28:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2020-12-23 09:28:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 09:28:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:28:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2020-12-23 09:28:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2020-12-23 09:28:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2020-12-23 09:28:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2020-12-23 09:28:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 09:28:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2020-12-23 09:28:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2020-12-23 09:28:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 09:28:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2020-12-23 09:28:07,003 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2020-12-23 09:28:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:28:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2020-12-23 09:28:07,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2020-12-23 09:28:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-12-23 09:28:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:28:07,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:28:08,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:28:08,466 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2020-12-23 09:28:08,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:08 BoogieIcfgContainer [2020-12-23 09:28:08,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:28:08,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:28:08,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:28:08,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:28:08,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:28:05" (1/3) ... [2020-12-23 09:28:08,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53846cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:08, skipping insertion in model container [2020-12-23 09:28:08,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (2/3) ... [2020-12-23 09:28:08,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53846cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:08, skipping insertion in model container [2020-12-23 09:28:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:08" (3/3) ... [2020-12-23 09:28:08,478 INFO L111 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2020-12-23 09:28:08,492 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:28:08,498 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:28:08,518 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:28:08,550 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:28:08,550 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:28:08,550 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:28:08,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:28:08,550 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:28:08,551 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:28:08,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:28:08,551 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:28:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2020-12-23 09:28:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 09:28:08,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:08,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:08,580 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2020-12-23 09:28:08,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:08,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426045605] [2020-12-23 09:28:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:09,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426045605] [2020-12-23 09:28:09,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:09,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:09,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806523095] [2020-12-23 09:28:09,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:09,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:09,219 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 8 states. [2020-12-23 09:28:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:10,293 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2020-12-23 09:28:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:28:10,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-23 09:28:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:10,309 INFO L225 Difference]: With dead ends: 269 [2020-12-23 09:28:10,309 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 09:28:10,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:28:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 09:28:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2020-12-23 09:28:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 09:28:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2020-12-23 09:28:10,373 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2020-12-23 09:28:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:10,373 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2020-12-23 09:28:10,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2020-12-23 09:28:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 09:28:10,378 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:10,378 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] [2020-12-23 09:28:10,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:28:10,379 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2020-12-23 09:28:10,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:10,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091735668] [2020-12-23 09:28:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:10,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091735668] [2020-12-23 09:28:10,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:10,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:10,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108255128] [2020-12-23 09:28:10,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:10,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:10,629 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 3 states. [2020-12-23 09:28:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:10,673 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2020-12-23 09:28:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:10,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 09:28:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:10,680 INFO L225 Difference]: With dead ends: 236 [2020-12-23 09:28:10,681 INFO L226 Difference]: Without dead ends: 126 [2020-12-23 09:28:10,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-12-23 09:28:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-12-23 09:28:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 09:28:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2020-12-23 09:28:10,713 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 27 [2020-12-23 09:28:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:10,714 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2020-12-23 09:28:10,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2020-12-23 09:28:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:28:10,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:10,717 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] [2020-12-23 09:28:10,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:28:10,717 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash 313595982, now seen corresponding path program 1 times [2020-12-23 09:28:10,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:10,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097411892] [2020-12-23 09:28:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:10,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097411892] [2020-12-23 09:28:10,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:10,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:10,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075701028] [2020-12-23 09:28:10,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:10,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:10,946 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand 8 states. [2020-12-23 09:28:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:11,911 INFO L93 Difference]: Finished difference Result 276 states and 409 transitions. [2020-12-23 09:28:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:28:11,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-12-23 09:28:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:11,915 INFO L225 Difference]: With dead ends: 276 [2020-12-23 09:28:11,915 INFO L226 Difference]: Without dead ends: 166 [2020-12-23 09:28:11,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:28:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-12-23 09:28:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2020-12-23 09:28:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-12-23 09:28:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2020-12-23 09:28:11,940 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 28 [2020-12-23 09:28:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:11,941 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2020-12-23 09:28:11,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2020-12-23 09:28:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:28:11,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:11,945 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] [2020-12-23 09:28:11,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:28:11,945 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2020-12-23 09:28:11,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:11,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070105416] [2020-12-23 09:28:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:12,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070105416] [2020-12-23 09:28:12,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456052125] [2020-12-23 09:28:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:12,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-23 09:28:12,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:12,622 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 11 treesize of output 7 [2020-12-23 09:28:12,628 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:12,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-12-23 09:28:12,775 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:12,776 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 19 treesize of output 34 [2020-12-23 09:28:12,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,806 INFO L625 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2020-12-23 09:28:12,807 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-12-23 09:28:12,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:13,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:13,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-12-23 09:28:13,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719137609] [2020-12-23 09:28:13,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 09:28:13,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 09:28:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:28:13,105 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 17 states. [2020-12-23 09:28:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:17,300 INFO L93 Difference]: Finished difference Result 509 states and 787 transitions. [2020-12-23 09:28:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 09:28:17,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-12-23 09:28:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:17,310 INFO L225 Difference]: With dead ends: 509 [2020-12-23 09:28:17,311 INFO L226 Difference]: Without dead ends: 366 [2020-12-23 09:28:17,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 09:28:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-12-23 09:28:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 343. [2020-12-23 09:28:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-12-23 09:28:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 500 transitions. [2020-12-23 09:28:17,377 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 500 transitions. Word has length 28 [2020-12-23 09:28:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:17,377 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 500 transitions. [2020-12-23 09:28:17,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 09:28:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 500 transitions. [2020-12-23 09:28:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 09:28:17,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:17,380 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] [2020-12-23 09:28:17,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:17,594 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2020-12-23 09:28:17,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:17,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741519236] [2020-12-23 09:28:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:17,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741519236] [2020-12-23 09:28:17,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:17,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:17,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211812511] [2020-12-23 09:28:17,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:17,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:17,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:17,845 INFO L87 Difference]: Start difference. First operand 343 states and 500 transitions. Second operand 7 states. [2020-12-23 09:28:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:18,786 INFO L93 Difference]: Finished difference Result 687 states and 1002 transitions. [2020-12-23 09:28:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:18,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-12-23 09:28:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:18,791 INFO L225 Difference]: With dead ends: 687 [2020-12-23 09:28:18,792 INFO L226 Difference]: Without dead ends: 350 [2020-12-23 09:28:18,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-12-23 09:28:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2020-12-23 09:28:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-12-23 09:28:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 503 transitions. [2020-12-23 09:28:18,838 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 503 transitions. Word has length 29 [2020-12-23 09:28:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:18,838 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 503 transitions. [2020-12-23 09:28:18,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 503 transitions. [2020-12-23 09:28:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 09:28:18,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:18,840 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] [2020-12-23 09:28:18,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:28:18,841 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1907924199, now seen corresponding path program 1 times [2020-12-23 09:28:18,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:18,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383089174] [2020-12-23 09:28:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:19,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383089174] [2020-12-23 09:28:19,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:19,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:19,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024621520] [2020-12-23 09:28:19,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:19,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:19,005 INFO L87 Difference]: Start difference. First operand 346 states and 503 transitions. Second operand 8 states. [2020-12-23 09:28:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:20,024 INFO L93 Difference]: Finished difference Result 681 states and 994 transitions. [2020-12-23 09:28:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:20,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-12-23 09:28:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:20,029 INFO L225 Difference]: With dead ends: 681 [2020-12-23 09:28:20,029 INFO L226 Difference]: Without dead ends: 344 [2020-12-23 09:28:20,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:28:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-12-23 09:28:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2020-12-23 09:28:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-23 09:28:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 497 transitions. [2020-12-23 09:28:20,067 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 497 transitions. Word has length 30 [2020-12-23 09:28:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:20,068 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 497 transitions. [2020-12-23 09:28:20,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 497 transitions. [2020-12-23 09:28:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 09:28:20,070 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:20,070 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:28:20,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:28:20,070 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -540510950, now seen corresponding path program 1 times [2020-12-23 09:28:20,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:20,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204040536] [2020-12-23 09:28:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:20,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204040536] [2020-12-23 09:28:20,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:20,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:20,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804926523] [2020-12-23 09:28:20,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:20,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:20,293 INFO L87 Difference]: Start difference. First operand 341 states and 497 transitions. Second operand 7 states. [2020-12-23 09:28:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:21,079 INFO L93 Difference]: Finished difference Result 729 states and 1200 transitions. [2020-12-23 09:28:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:28:21,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-12-23 09:28:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:21,084 INFO L225 Difference]: With dead ends: 729 [2020-12-23 09:28:21,084 INFO L226 Difference]: Without dead ends: 397 [2020-12-23 09:28:21,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-12-23 09:28:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 368. [2020-12-23 09:28:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-12-23 09:28:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 539 transitions. [2020-12-23 09:28:21,121 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 539 transitions. Word has length 42 [2020-12-23 09:28:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:21,121 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 539 transitions. [2020-12-23 09:28:21,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 539 transitions. [2020-12-23 09:28:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 09:28:21,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:21,123 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:28:21,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:28:21,124 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash -478471336, now seen corresponding path program 1 times [2020-12-23 09:28:21,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:21,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185531161] [2020-12-23 09:28:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:21,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185531161] [2020-12-23 09:28:21,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:21,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:21,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15254361] [2020-12-23 09:28:21,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:21,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:21,285 INFO L87 Difference]: Start difference. First operand 368 states and 539 transitions. Second operand 8 states. [2020-12-23 09:28:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:22,159 INFO L93 Difference]: Finished difference Result 777 states and 1279 transitions. [2020-12-23 09:28:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:28:22,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-12-23 09:28:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:22,166 INFO L225 Difference]: With dead ends: 777 [2020-12-23 09:28:22,166 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 09:28:22,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:28:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 09:28:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2020-12-23 09:28:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-12-23 09:28:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 589 transitions. [2020-12-23 09:28:22,207 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 589 transitions. Word has length 42 [2020-12-23 09:28:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:22,208 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 589 transitions. [2020-12-23 09:28:22,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 589 transitions. [2020-12-23 09:28:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:28:22,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:22,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:22,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:28:22,211 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1846598544, now seen corresponding path program 1 times [2020-12-23 09:28:22,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:22,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844882359] [2020-12-23 09:28:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:22,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:22,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844882359] [2020-12-23 09:28:22,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:22,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:28:22,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267896987] [2020-12-23 09:28:22,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:28:22,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:28:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:22,327 INFO L87 Difference]: Start difference. First operand 405 states and 589 transitions. Second operand 6 states. [2020-12-23 09:28:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:23,027 INFO L93 Difference]: Finished difference Result 875 states and 1445 transitions. [2020-12-23 09:28:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:28:23,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-12-23 09:28:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:23,034 INFO L225 Difference]: With dead ends: 875 [2020-12-23 09:28:23,034 INFO L226 Difference]: Without dead ends: 479 [2020-12-23 09:28:23,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-12-23 09:28:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2020-12-23 09:28:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-12-23 09:28:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2020-12-23 09:28:23,082 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 46 [2020-12-23 09:28:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:23,082 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2020-12-23 09:28:23,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:28:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2020-12-23 09:28:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:28:23,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:23,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:23,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:28:23,085 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash -629719738, now seen corresponding path program 1 times [2020-12-23 09:28:23,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:23,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90424580] [2020-12-23 09:28:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:23,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:23,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90424580] [2020-12-23 09:28:23,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:23,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:28:23,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368661041] [2020-12-23 09:28:23,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:28:23,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:28:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:23,224 INFO L87 Difference]: Start difference. First operand 430 states and 624 transitions. Second operand 6 states. [2020-12-23 09:28:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:24,188 INFO L93 Difference]: Finished difference Result 902 states and 1482 transitions. [2020-12-23 09:28:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:28:24,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-12-23 09:28:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:24,195 INFO L225 Difference]: With dead ends: 902 [2020-12-23 09:28:24,195 INFO L226 Difference]: Without dead ends: 481 [2020-12-23 09:28:24,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-23 09:28:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 432. [2020-12-23 09:28:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-12-23 09:28:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 626 transitions. [2020-12-23 09:28:24,240 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 626 transitions. Word has length 47 [2020-12-23 09:28:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:24,240 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 626 transitions. [2020-12-23 09:28:24,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:28:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 626 transitions. [2020-12-23 09:28:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:28:24,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:24,242 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:24,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:28:24,243 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 797842586, now seen corresponding path program 1 times [2020-12-23 09:28:24,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:24,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359689189] [2020-12-23 09:28:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:24,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:24,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359689189] [2020-12-23 09:28:24,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:24,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:24,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472895493] [2020-12-23 09:28:24,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:24,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:24,370 INFO L87 Difference]: Start difference. First operand 432 states and 626 transitions. Second operand 8 states. [2020-12-23 09:28:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:25,667 INFO L93 Difference]: Finished difference Result 940 states and 1573 transitions. [2020-12-23 09:28:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:28:25,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-12-23 09:28:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:25,674 INFO L225 Difference]: With dead ends: 940 [2020-12-23 09:28:25,674 INFO L226 Difference]: Without dead ends: 517 [2020-12-23 09:28:25,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:28:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-12-23 09:28:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 512. [2020-12-23 09:28:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2020-12-23 09:28:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 775 transitions. [2020-12-23 09:28:25,728 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 775 transitions. Word has length 48 [2020-12-23 09:28:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:25,728 INFO L481 AbstractCegarLoop]: Abstraction has 512 states and 775 transitions. [2020-12-23 09:28:25,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 775 transitions. [2020-12-23 09:28:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 09:28:25,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:25,731 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:25,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:28:25,731 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 27769970, now seen corresponding path program 1 times [2020-12-23 09:28:25,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:25,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838038979] [2020-12-23 09:28:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:25,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:25,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838038979] [2020-12-23 09:28:25,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:25,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:28:25,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913150453] [2020-12-23 09:28:25,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:28:25,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:28:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:25,913 INFO L87 Difference]: Start difference. First operand 512 states and 775 transitions. Second operand 9 states. [2020-12-23 09:28:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:27,720 INFO L93 Difference]: Finished difference Result 1071 states and 1842 transitions. [2020-12-23 09:28:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:28:27,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-12-23 09:28:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:27,730 INFO L225 Difference]: With dead ends: 1071 [2020-12-23 09:28:27,732 INFO L226 Difference]: Without dead ends: 568 [2020-12-23 09:28:27,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:28:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-12-23 09:28:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 559. [2020-12-23 09:28:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-12-23 09:28:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 856 transitions. [2020-12-23 09:28:27,798 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 856 transitions. Word has length 49 [2020-12-23 09:28:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:27,799 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 856 transitions. [2020-12-23 09:28:27,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:28:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 856 transitions. [2020-12-23 09:28:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 09:28:27,804 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:27,804 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:27,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:28:27,805 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2055690899, now seen corresponding path program 1 times [2020-12-23 09:28:27,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:27,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131462881] [2020-12-23 09:28:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:28,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131462881] [2020-12-23 09:28:28,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:28,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:28,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922291099] [2020-12-23 09:28:28,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:28,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:28,006 INFO L87 Difference]: Start difference. First operand 559 states and 856 transitions. Second operand 7 states. [2020-12-23 09:28:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:28,970 INFO L93 Difference]: Finished difference Result 1126 states and 1931 transitions. [2020-12-23 09:28:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:28,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2020-12-23 09:28:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:28,980 INFO L225 Difference]: With dead ends: 1126 [2020-12-23 09:28:28,981 INFO L226 Difference]: Without dead ends: 576 [2020-12-23 09:28:28,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-12-23 09:28:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 565. [2020-12-23 09:28:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2020-12-23 09:28:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 862 transitions. [2020-12-23 09:28:29,112 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 862 transitions. Word has length 55 [2020-12-23 09:28:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:29,113 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 862 transitions. [2020-12-23 09:28:29,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 862 transitions. [2020-12-23 09:28:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:28:29,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:29,117 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:29,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:28:29,118 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -103288946, now seen corresponding path program 1 times [2020-12-23 09:28:29,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:29,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446676632] [2020-12-23 09:28:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:29,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:29,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:28:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:29,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446676632] [2020-12-23 09:28:29,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688481886] [2020-12-23 09:28:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:29,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 09:28:29,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:29,579 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 15 treesize of output 7 [2020-12-23 09:28:29,581 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:29,584 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:29,584 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:29,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-23 09:28:29,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:28:29,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:29,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-23 09:28:29,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133893734] [2020-12-23 09:28:29,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:29,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:29,611 INFO L87 Difference]: Start difference. First operand 565 states and 862 transitions. Second operand 8 states. [2020-12-23 09:28:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:30,867 INFO L93 Difference]: Finished difference Result 1248 states and 2137 transitions. [2020-12-23 09:28:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:30,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-12-23 09:28:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:30,878 INFO L225 Difference]: With dead ends: 1248 [2020-12-23 09:28:30,879 INFO L226 Difference]: Without dead ends: 692 [2020-12-23 09:28:30,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-12-23 09:28:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 670. [2020-12-23 09:28:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2020-12-23 09:28:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1042 transitions. [2020-12-23 09:28:30,969 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1042 transitions. Word has length 54 [2020-12-23 09:28:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:30,970 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 1042 transitions. [2020-12-23 09:28:30,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1042 transitions. [2020-12-23 09:28:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 09:28:30,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:30,974 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:31,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 09:28:31,190 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2078071639, now seen corresponding path program 1 times [2020-12-23 09:28:31,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465230186] [2020-12-23 09:28:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:28:31,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465230186] [2020-12-23 09:28:31,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:31,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906770516] [2020-12-23 09:28:31,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:31,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:31,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,314 INFO L87 Difference]: Start difference. First operand 670 states and 1042 transitions. Second operand 3 states. [2020-12-23 09:28:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,372 INFO L93 Difference]: Finished difference Result 1349 states and 2397 transitions. [2020-12-23 09:28:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:31,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-23 09:28:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,383 INFO L225 Difference]: With dead ends: 1349 [2020-12-23 09:28:31,383 INFO L226 Difference]: Without dead ends: 688 [2020-12-23 09:28:31,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-12-23 09:28:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 682. [2020-12-23 09:28:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2020-12-23 09:28:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1050 transitions. [2020-12-23 09:28:31,462 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1050 transitions. Word has length 55 [2020-12-23 09:28:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:31,463 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 1050 transitions. [2020-12-23 09:28:31,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1050 transitions. [2020-12-23 09:28:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 09:28:31,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:31,467 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-12-23 09:28:31,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:28:31,468 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1620941101, now seen corresponding path program 1 times [2020-12-23 09:28:31,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879998246] [2020-12-23 09:28:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:28:31,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879998246] [2020-12-23 09:28:31,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:31,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613363617] [2020-12-23 09:28:31,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:31,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:31,631 INFO L87 Difference]: Start difference. First operand 682 states and 1050 transitions. Second operand 7 states. [2020-12-23 09:28:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,886 INFO L93 Difference]: Finished difference Result 1725 states and 3255 transitions. [2020-12-23 09:28:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:32,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-12-23 09:28:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,901 INFO L225 Difference]: With dead ends: 1725 [2020-12-23 09:28:32,901 INFO L226 Difference]: Without dead ends: 1052 [2020-12-23 09:28:32,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:28:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-12-23 09:28:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1024. [2020-12-23 09:28:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2020-12-23 09:28:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1783 transitions. [2020-12-23 09:28:33,018 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1783 transitions. Word has length 56 [2020-12-23 09:28:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:33,018 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1783 transitions. [2020-12-23 09:28:33,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1783 transitions. [2020-12-23 09:28:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 09:28:33,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:33,024 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-12-23 09:28:33,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:28:33,024 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2087220181, now seen corresponding path program 1 times [2020-12-23 09:28:33,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:33,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829335592] [2020-12-23 09:28:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:28:33,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829335592] [2020-12-23 09:28:33,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:33,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:28:33,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878135592] [2020-12-23 09:28:33,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:28:33,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:28:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:33,179 INFO L87 Difference]: Start difference. First operand 1024 states and 1783 transitions. Second operand 6 states. [2020-12-23 09:28:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:33,793 INFO L93 Difference]: Finished difference Result 2289 states and 4646 transitions. [2020-12-23 09:28:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:28:33,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-12-23 09:28:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:33,816 INFO L225 Difference]: With dead ends: 2289 [2020-12-23 09:28:33,816 INFO L226 Difference]: Without dead ends: 1274 [2020-12-23 09:28:33,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2020-12-23 09:28:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1231. [2020-12-23 09:28:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2020-12-23 09:28:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2176 transitions. [2020-12-23 09:28:34,048 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2176 transitions. Word has length 56 [2020-12-23 09:28:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:34,048 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 2176 transitions. [2020-12-23 09:28:34,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:28:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2176 transitions. [2020-12-23 09:28:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 09:28:34,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:34,055 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:34,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:28:34,055 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1327114492, now seen corresponding path program 1 times [2020-12-23 09:28:34,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:34,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715648411] [2020-12-23 09:28:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:34,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715648411] [2020-12-23 09:28:34,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:34,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:34,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542003212] [2020-12-23 09:28:34,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:34,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:34,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:34,166 INFO L87 Difference]: Start difference. First operand 1231 states and 2176 transitions. Second operand 8 states. [2020-12-23 09:28:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:35,474 INFO L93 Difference]: Finished difference Result 2518 states and 5311 transitions. [2020-12-23 09:28:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 09:28:35,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2020-12-23 09:28:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:35,498 INFO L225 Difference]: With dead ends: 2518 [2020-12-23 09:28:35,499 INFO L226 Difference]: Without dead ends: 1296 [2020-12-23 09:28:35,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-12-23 09:28:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1279. [2020-12-23 09:28:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-12-23 09:28:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2235 transitions. [2020-12-23 09:28:35,665 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2235 transitions. Word has length 56 [2020-12-23 09:28:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:35,666 INFO L481 AbstractCegarLoop]: Abstraction has 1279 states and 2235 transitions. [2020-12-23 09:28:35,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2235 transitions. [2020-12-23 09:28:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 09:28:35,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:35,671 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:35,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:28:35,672 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1709178951, now seen corresponding path program 1 times [2020-12-23 09:28:35,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:35,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600704659] [2020-12-23 09:28:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:35,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600704659] [2020-12-23 09:28:35,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:35,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:35,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82471217] [2020-12-23 09:28:35,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:35,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:35,869 INFO L87 Difference]: Start difference. First operand 1279 states and 2235 transitions. Second operand 7 states. [2020-12-23 09:28:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:37,049 INFO L93 Difference]: Finished difference Result 2527 states and 5243 transitions. [2020-12-23 09:28:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:37,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-12-23 09:28:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:37,069 INFO L225 Difference]: With dead ends: 2527 [2020-12-23 09:28:37,069 INFO L226 Difference]: Without dead ends: 1257 [2020-12-23 09:28:37,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-12-23 09:28:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1250. [2020-12-23 09:28:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2020-12-23 09:28:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2194 transitions. [2020-12-23 09:28:37,207 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2194 transitions. Word has length 57 [2020-12-23 09:28:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:37,207 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 2194 transitions. [2020-12-23 09:28:37,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2194 transitions. [2020-12-23 09:28:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 09:28:37,213 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:37,214 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:37,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:28:37,214 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 388417727, now seen corresponding path program 1 times [2020-12-23 09:28:37,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:37,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364133393] [2020-12-23 09:28:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:28:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:28:37,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364133393] [2020-12-23 09:28:37,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428904012] [2020-12-23 09:28:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 09:28:37,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:37,645 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 16 treesize of output 8 [2020-12-23 09:28:37,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:37,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:37,648 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:37,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-23 09:28:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:28:37,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:37,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-23 09:28:37,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384059620] [2020-12-23 09:28:37,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:28:37,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:28:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:28:37,694 INFO L87 Difference]: Start difference. First operand 1250 states and 2194 transitions. Second operand 13 states. [2020-12-23 09:28:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:41,168 INFO L93 Difference]: Finished difference Result 3228 states and 7755 transitions. [2020-12-23 09:28:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 09:28:41,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2020-12-23 09:28:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:41,206 INFO L225 Difference]: With dead ends: 3228 [2020-12-23 09:28:41,206 INFO L226 Difference]: Without dead ends: 1987 [2020-12-23 09:28:41,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 09:28:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2020-12-23 09:28:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1917. [2020-12-23 09:28:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2020-12-23 09:28:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 4090 transitions. [2020-12-23 09:28:41,448 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 4090 transitions. Word has length 60 [2020-12-23 09:28:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:41,448 INFO L481 AbstractCegarLoop]: Abstraction has 1917 states and 4090 transitions. [2020-12-23 09:28:41,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:28:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 4090 transitions. [2020-12-23 09:28:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:28:41,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:41,455 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:41,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:41,668 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1086799729, now seen corresponding path program 1 times [2020-12-23 09:28:41,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:41,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644133951] [2020-12-23 09:28:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:41,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:41,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644133951] [2020-12-23 09:28:41,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:41,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:41,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183750359] [2020-12-23 09:28:41,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:41,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:41,868 INFO L87 Difference]: Start difference. First operand 1917 states and 4090 transitions. Second operand 8 states. [2020-12-23 09:28:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:43,179 INFO L93 Difference]: Finished difference Result 3842 states and 10100 transitions. [2020-12-23 09:28:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:43,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-12-23 09:28:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:43,214 INFO L225 Difference]: With dead ends: 3842 [2020-12-23 09:28:43,214 INFO L226 Difference]: Without dead ends: 1934 [2020-12-23 09:28:43,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-12-23 09:28:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1933. [2020-12-23 09:28:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2020-12-23 09:28:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 4050 transitions. [2020-12-23 09:28:43,463 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 4050 transitions. Word has length 61 [2020-12-23 09:28:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:43,464 INFO L481 AbstractCegarLoop]: Abstraction has 1933 states and 4050 transitions. [2020-12-23 09:28:43,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 4050 transitions. [2020-12-23 09:28:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:28:43,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:43,472 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:43,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:28:43,473 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 808375225, now seen corresponding path program 1 times [2020-12-23 09:28:43,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:43,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950047595] [2020-12-23 09:28:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:43,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:43,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950047595] [2020-12-23 09:28:43,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:43,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:43,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043973477] [2020-12-23 09:28:43,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:43,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:43,690 INFO L87 Difference]: Start difference. First operand 1933 states and 4050 transitions. Second operand 8 states. [2020-12-23 09:28:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:45,157 INFO L93 Difference]: Finished difference Result 3878 states and 10063 transitions. [2020-12-23 09:28:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:45,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-12-23 09:28:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:45,197 INFO L225 Difference]: With dead ends: 3878 [2020-12-23 09:28:45,198 INFO L226 Difference]: Without dead ends: 1954 [2020-12-23 09:28:45,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2020-12-23 09:28:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1953. [2020-12-23 09:28:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2020-12-23 09:28:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 4108 transitions. [2020-12-23 09:28:45,444 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 4108 transitions. Word has length 62 [2020-12-23 09:28:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:45,444 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 4108 transitions. [2020-12-23 09:28:45,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 4108 transitions. [2020-12-23 09:28:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:28:45,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:45,451 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-12-23 09:28:45,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:28:45,451 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1807165209, now seen corresponding path program 1 times [2020-12-23 09:28:45,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:45,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694948455] [2020-12-23 09:28:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:45,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:28:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:45,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:28:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:45,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:28:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:28:45,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694948455] [2020-12-23 09:28:45,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723625511] [2020-12-23 09:28:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:45,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 09:28:45,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:46,091 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 7 treesize of output 3 [2020-12-23 09:28:46,092 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:46,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:46,095 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:46,095 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2020-12-23 09:28:46,122 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 15 treesize of output 7 [2020-12-23 09:28:46,124 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:46,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:46,126 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:46,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-23 09:28:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 09:28:46,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:46,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2020-12-23 09:28:46,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863290624] [2020-12-23 09:28:46,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:28:46,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:28:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:46,160 INFO L87 Difference]: Start difference. First operand 1953 states and 4108 transitions. Second operand 12 states. [2020-12-23 09:28:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:48,017 INFO L93 Difference]: Finished difference Result 4833 states and 13515 transitions. [2020-12-23 09:28:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 09:28:48,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-12-23 09:28:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:48,082 INFO L225 Difference]: With dead ends: 4833 [2020-12-23 09:28:48,082 INFO L226 Difference]: Without dead ends: 2889 [2020-12-23 09:28:48,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:28:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-12-23 09:28:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2856. [2020-12-23 09:28:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2020-12-23 09:28:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 7029 transitions. [2020-12-23 09:28:48,550 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 7029 transitions. Word has length 76 [2020-12-23 09:28:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:48,551 INFO L481 AbstractCegarLoop]: Abstraction has 2856 states and 7029 transitions. [2020-12-23 09:28:48,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:28:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 7029 transitions. [2020-12-23 09:28:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:28:48,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:48,560 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:48,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:48,775 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 662556486, now seen corresponding path program 1 times [2020-12-23 09:28:48,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:48,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949202133] [2020-12-23 09:28:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:48,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:48,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949202133] [2020-12-23 09:28:48,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:48,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:28:48,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314129016] [2020-12-23 09:28:48,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:28:48,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:48,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:28:48,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:48,977 INFO L87 Difference]: Start difference. First operand 2856 states and 7029 transitions. Second operand 9 states. [2020-12-23 09:28:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:50,790 INFO L93 Difference]: Finished difference Result 5717 states and 18051 transitions. [2020-12-23 09:28:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:28:50,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-12-23 09:28:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:50,833 INFO L225 Difference]: With dead ends: 5717 [2020-12-23 09:28:50,834 INFO L226 Difference]: Without dead ends: 2870 [2020-12-23 09:28:50,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:28:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2020-12-23 09:28:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2869. [2020-12-23 09:28:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2869 states. [2020-12-23 09:28:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 6956 transitions. [2020-12-23 09:28:51,203 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 6956 transitions. Word has length 63 [2020-12-23 09:28:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:51,203 INFO L481 AbstractCegarLoop]: Abstraction has 2869 states and 6956 transitions. [2020-12-23 09:28:51,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:28:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 6956 transitions. [2020-12-23 09:28:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 09:28:51,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:51,212 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:51,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:28:51,212 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -678786254, now seen corresponding path program 1 times [2020-12-23 09:28:51,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:51,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487727347] [2020-12-23 09:28:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:51,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:51,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487727347] [2020-12-23 09:28:51,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:51,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:28:51,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296918064] [2020-12-23 09:28:51,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:28:51,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:28:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:51,356 INFO L87 Difference]: Start difference. First operand 2869 states and 6956 transitions. Second operand 9 states. [2020-12-23 09:28:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:53,108 INFO L93 Difference]: Finished difference Result 5816 states and 18066 transitions. [2020-12-23 09:28:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 09:28:53,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-12-23 09:28:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:53,147 INFO L225 Difference]: With dead ends: 5816 [2020-12-23 09:28:53,148 INFO L226 Difference]: Without dead ends: 2956 [2020-12-23 09:28:53,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:28:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-12-23 09:28:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2943. [2020-12-23 09:28:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2943 states. [2020-12-23 09:28:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 7055 transitions. [2020-12-23 09:28:53,545 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 7055 transitions. Word has length 64 [2020-12-23 09:28:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:53,545 INFO L481 AbstractCegarLoop]: Abstraction has 2943 states and 7055 transitions. [2020-12-23 09:28:53,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:28:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 7055 transitions. [2020-12-23 09:28:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 09:28:53,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:53,556 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-12-23 09:28:53,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:28:53,556 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 572592902, now seen corresponding path program 1 times [2020-12-23 09:28:53,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:53,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322986844] [2020-12-23 09:28:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:53,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:28:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:28:53,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322986844] [2020-12-23 09:28:53,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:53,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:53,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40398083] [2020-12-23 09:28:53,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:53,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:53,867 INFO L87 Difference]: Start difference. First operand 2943 states and 7055 transitions. Second operand 8 states. [2020-12-23 09:28:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:55,372 INFO L93 Difference]: Finished difference Result 5813 states and 17881 transitions. [2020-12-23 09:28:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:55,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-12-23 09:28:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:55,418 INFO L225 Difference]: With dead ends: 5813 [2020-12-23 09:28:55,419 INFO L226 Difference]: Without dead ends: 2879 [2020-12-23 09:28:55,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-12-23 09:28:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2878. [2020-12-23 09:28:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2020-12-23 09:28:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 6873 transitions. [2020-12-23 09:28:55,924 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 6873 transitions. Word has length 65 [2020-12-23 09:28:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:55,924 INFO L481 AbstractCegarLoop]: Abstraction has 2878 states and 6873 transitions. [2020-12-23 09:28:55,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:28:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 6873 transitions. [2020-12-23 09:28:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:28:55,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:55,932 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:55,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:28:55,933 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1835600644, now seen corresponding path program 1 times [2020-12-23 09:28:55,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:55,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175265190] [2020-12-23 09:28:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:56,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:28:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:56,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:28:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:56,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:28:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 09:28:56,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175265190] [2020-12-23 09:28:56,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:56,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:28:56,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886367674] [2020-12-23 09:28:56,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:28:56,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:28:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:56,171 INFO L87 Difference]: Start difference. First operand 2878 states and 6873 transitions. Second operand 9 states. [2020-12-23 09:28:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:57,548 INFO L93 Difference]: Finished difference Result 5772 states and 17660 transitions. [2020-12-23 09:28:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:28:57,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2020-12-23 09:28:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:57,583 INFO L225 Difference]: With dead ends: 5772 [2020-12-23 09:28:57,583 INFO L226 Difference]: Without dead ends: 2903 [2020-12-23 09:28:57,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:28:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-12-23 09:28:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2882. [2020-12-23 09:28:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2020-12-23 09:28:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 6882 transitions. [2020-12-23 09:28:58,101 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 6882 transitions. Word has length 80 [2020-12-23 09:28:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:58,101 INFO L481 AbstractCegarLoop]: Abstraction has 2882 states and 6882 transitions. [2020-12-23 09:28:58,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:28:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 6882 transitions. [2020-12-23 09:28:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:28:58,108 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:58,108 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:58,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:28:58,108 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1499328999, now seen corresponding path program 1 times [2020-12-23 09:28:58,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:58,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891102367] [2020-12-23 09:28:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:58,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:58,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-12-23 09:28:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:28:58,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891102367] [2020-12-23 09:28:58,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:58,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:28:58,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574462685] [2020-12-23 09:28:58,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:58,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:58,234 INFO L87 Difference]: Start difference. First operand 2882 states and 6882 transitions. Second operand 4 states. [2020-12-23 09:28:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:58,875 INFO L93 Difference]: Finished difference Result 5832 states and 17981 transitions. [2020-12-23 09:28:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:58,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 09:28:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:58,912 INFO L225 Difference]: With dead ends: 5832 [2020-12-23 09:28:58,912 INFO L226 Difference]: Without dead ends: 2959 [2020-12-23 09:28:58,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-12-23 09:28:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2914. [2020-12-23 09:28:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2020-12-23 09:28:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 7015 transitions. [2020-12-23 09:28:59,339 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 7015 transitions. Word has length 66 [2020-12-23 09:28:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:59,339 INFO L481 AbstractCegarLoop]: Abstraction has 2914 states and 7015 transitions. [2020-12-23 09:28:59,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 7015 transitions. [2020-12-23 09:28:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 09:28:59,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:59,348 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:59,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:28:59,349 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 287099147, now seen corresponding path program 1 times [2020-12-23 09:28:59,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:59,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232017359] [2020-12-23 09:28:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:59,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:28:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:59,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-12-23 09:28:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 09:28:59,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232017359] [2020-12-23 09:28:59,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:59,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:28:59,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973731675] [2020-12-23 09:28:59,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:28:59,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:28:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:28:59,540 INFO L87 Difference]: Start difference. First operand 2914 states and 7015 transitions. Second operand 8 states. [2020-12-23 09:29:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:01,122 INFO L93 Difference]: Finished difference Result 5731 states and 16981 transitions. [2020-12-23 09:29:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:29:01,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-12-23 09:29:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:01,155 INFO L225 Difference]: With dead ends: 5731 [2020-12-23 09:29:01,155 INFO L226 Difference]: Without dead ends: 2826 [2020-12-23 09:29:01,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:29:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2020-12-23 09:29:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2792. [2020-12-23 09:29:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2020-12-23 09:29:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 6391 transitions. [2020-12-23 09:29:01,647 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 6391 transitions. Word has length 67 [2020-12-23 09:29:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:01,647 INFO L481 AbstractCegarLoop]: Abstraction has 2792 states and 6391 transitions. [2020-12-23 09:29:01,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 6391 transitions. [2020-12-23 09:29:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 09:29:01,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:01,653 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:01,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:29:01,653 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2020-12-23 09:29:01,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:01,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629893632] [2020-12-23 09:29:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:29:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-12-23 09:29:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 09:29:02,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629893632] [2020-12-23 09:29:02,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:02,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 09:29:02,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876939885] [2020-12-23 09:29:02,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 09:29:02,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 09:29:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:29:02,052 INFO L87 Difference]: Start difference. First operand 2792 states and 6391 transitions. Second operand 10 states. [2020-12-23 09:29:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:03,687 INFO L93 Difference]: Finished difference Result 5586 states and 12823 transitions. [2020-12-23 09:29:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:03,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-12-23 09:29:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:03,731 INFO L225 Difference]: With dead ends: 5586 [2020-12-23 09:29:03,731 INFO L226 Difference]: Without dead ends: 2801 [2020-12-23 09:29:03,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:29:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2020-12-23 09:29:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2800. [2020-12-23 09:29:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2020-12-23 09:29:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 6399 transitions. [2020-12-23 09:29:04,147 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 6399 transitions. Word has length 67 [2020-12-23 09:29:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:04,148 INFO L481 AbstractCegarLoop]: Abstraction has 2800 states and 6399 transitions. [2020-12-23 09:29:04,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 09:29:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 6399 transitions. [2020-12-23 09:29:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:29:04,154 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:04,154 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:04,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:29:04,155 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 300293739, now seen corresponding path program 1 times [2020-12-23 09:29:04,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:04,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625038355] [2020-12-23 09:29:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-12-23 09:29:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-23 09:29:04,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625038355] [2020-12-23 09:29:04,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:04,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 09:29:04,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802536769] [2020-12-23 09:29:04,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:29:04,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:29:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:29:04,432 INFO L87 Difference]: Start difference. First operand 2800 states and 6399 transitions. Second operand 12 states. [2020-12-23 09:29:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:05,966 INFO L93 Difference]: Finished difference Result 5620 states and 16371 transitions. [2020-12-23 09:29:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 09:29:05,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2020-12-23 09:29:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:06,029 INFO L225 Difference]: With dead ends: 5620 [2020-12-23 09:29:06,030 INFO L226 Difference]: Without dead ends: 2837 [2020-12-23 09:29:06,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2020-12-23 09:29:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2805. [2020-12-23 09:29:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2020-12-23 09:29:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 6406 transitions. [2020-12-23 09:29:06,482 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 6406 transitions. Word has length 89 [2020-12-23 09:29:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:06,483 INFO L481 AbstractCegarLoop]: Abstraction has 2805 states and 6406 transitions. [2020-12-23 09:29:06,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:29:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 6406 transitions. [2020-12-23 09:29:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:29:06,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:06,490 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2020-12-23 09:29:06,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:29:06,491 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash -407366979, now seen corresponding path program 1 times [2020-12-23 09:29:06,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:06,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296102617] [2020-12-23 09:29:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:29:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:29:06,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296102617] [2020-12-23 09:29:06,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:06,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 09:29:06,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675631250] [2020-12-23 09:29:06,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:29:06,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:29:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:29:06,763 INFO L87 Difference]: Start difference. First operand 2805 states and 6406 transitions. Second operand 12 states. [2020-12-23 09:29:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:08,374 INFO L93 Difference]: Finished difference Result 5627 states and 16380 transitions. [2020-12-23 09:29:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 09:29:08,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-12-23 09:29:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:08,423 INFO L225 Difference]: With dead ends: 5627 [2020-12-23 09:29:08,424 INFO L226 Difference]: Without dead ends: 2839 [2020-12-23 09:29:08,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2020-12-23 09:29:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2807. [2020-12-23 09:29:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2807 states. [2020-12-23 09:29:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 6408 transitions. [2020-12-23 09:29:08,727 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 6408 transitions. Word has length 82 [2020-12-23 09:29:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:08,727 INFO L481 AbstractCegarLoop]: Abstraction has 2807 states and 6408 transitions. [2020-12-23 09:29:08,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:29:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 6408 transitions. [2020-12-23 09:29:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:29:08,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:08,733 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:08,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:29:08,734 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1077259773, now seen corresponding path program 1 times [2020-12-23 09:29:08,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:08,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993114303] [2020-12-23 09:29:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 09:29:08,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993114303] [2020-12-23 09:29:08,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:08,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:29:08,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657459755] [2020-12-23 09:29:08,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:29:08,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:29:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:08,870 INFO L87 Difference]: Start difference. First operand 2807 states and 6408 transitions. Second operand 6 states. [2020-12-23 09:29:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:09,584 INFO L93 Difference]: Finished difference Result 6774 states and 20004 transitions. [2020-12-23 09:29:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:09,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-12-23 09:29:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:09,654 INFO L225 Difference]: With dead ends: 6774 [2020-12-23 09:29:09,655 INFO L226 Difference]: Without dead ends: 3984 [2020-12-23 09:29:09,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2020-12-23 09:29:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3928. [2020-12-23 09:29:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2020-12-23 09:29:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 9099 transitions. [2020-12-23 09:29:10,078 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 9099 transitions. Word has length 72 [2020-12-23 09:29:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:10,079 INFO L481 AbstractCegarLoop]: Abstraction has 3928 states and 9099 transitions. [2020-12-23 09:29:10,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:29:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 9099 transitions. [2020-12-23 09:29:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 09:29:10,083 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:10,084 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:10,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:29:10,084 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -744354658, now seen corresponding path program 1 times [2020-12-23 09:29:10,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:10,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100907754] [2020-12-23 09:29:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:29:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-12-23 09:29:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-12-23 09:29:10,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100907754] [2020-12-23 09:29:10,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:10,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 09:29:10,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438826108] [2020-12-23 09:29:10,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:10,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:10,325 INFO L87 Difference]: Start difference. First operand 3928 states and 9099 transitions. Second operand 11 states. [2020-12-23 09:29:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:11,612 INFO L93 Difference]: Finished difference Result 7945 states and 23632 transitions. [2020-12-23 09:29:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 09:29:11,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2020-12-23 09:29:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:11,676 INFO L225 Difference]: With dead ends: 7945 [2020-12-23 09:29:11,676 INFO L226 Difference]: Without dead ends: 4034 [2020-12-23 09:29:11,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:29:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2020-12-23 09:29:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 3953. [2020-12-23 09:29:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2020-12-23 09:29:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 9156 transitions. [2020-12-23 09:29:12,005 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 9156 transitions. Word has length 106 [2020-12-23 09:29:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:12,005 INFO L481 AbstractCegarLoop]: Abstraction has 3953 states and 9156 transitions. [2020-12-23 09:29:12,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 9156 transitions. [2020-12-23 09:29:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 09:29:12,009 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:12,009 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:12,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:29:12,010 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:12,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1099723664, now seen corresponding path program 1 times [2020-12-23 09:29:12,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:12,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642144528] [2020-12-23 09:29:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:29:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-12-23 09:29:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 09:29:12,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642144528] [2020-12-23 09:29:12,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:12,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 09:29:12,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20631031] [2020-12-23 09:29:12,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:12,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:12,229 INFO L87 Difference]: Start difference. First operand 3953 states and 9156 transitions. Second operand 11 states. [2020-12-23 09:29:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:13,532 INFO L93 Difference]: Finished difference Result 7972 states and 23691 transitions. [2020-12-23 09:29:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 09:29:13,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2020-12-23 09:29:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:13,582 INFO L225 Difference]: With dead ends: 7972 [2020-12-23 09:29:13,582 INFO L226 Difference]: Without dead ends: 4036 [2020-12-23 09:29:13,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:29:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-12-23 09:29:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3951. [2020-12-23 09:29:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2020-12-23 09:29:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 9152 transitions. [2020-12-23 09:29:14,100 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 9152 transitions. Word has length 107 [2020-12-23 09:29:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:14,101 INFO L481 AbstractCegarLoop]: Abstraction has 3951 states and 9152 transitions. [2020-12-23 09:29:14,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 9152 transitions. [2020-12-23 09:29:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:29:14,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:14,112 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:14,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:29:14,112 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:14,113 INFO L82 PathProgramCache]: Analyzing trace with hash 488053929, now seen corresponding path program 1 times [2020-12-23 09:29:14,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:14,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677831871] [2020-12-23 09:29:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:14,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-12-23 09:29:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:14,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-12-23 09:29:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-23 09:29:14,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677831871] [2020-12-23 09:29:14,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:14,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:29:14,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066684483] [2020-12-23 09:29:14,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:29:14,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:29:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:29:14,328 INFO L87 Difference]: Start difference. First operand 3951 states and 9152 transitions. Second operand 8 states. [2020-12-23 09:29:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:16,084 INFO L93 Difference]: Finished difference Result 7912 states and 23684 transitions. [2020-12-23 09:29:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:29:16,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2020-12-23 09:29:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:16,139 INFO L225 Difference]: With dead ends: 7912 [2020-12-23 09:29:16,140 INFO L226 Difference]: Without dead ends: 3969 [2020-12-23 09:29:16,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:29:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2020-12-23 09:29:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 3955. [2020-12-23 09:29:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2020-12-23 09:29:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 9185 transitions. [2020-12-23 09:29:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 9185 transitions. Word has length 82 [2020-12-23 09:29:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:16,761 INFO L481 AbstractCegarLoop]: Abstraction has 3955 states and 9185 transitions. [2020-12-23 09:29:16,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 9185 transitions. [2020-12-23 09:29:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:29:16,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:16,769 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 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] [2020-12-23 09:29:16,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 09:29:16,769 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash 388051094, now seen corresponding path program 1 times [2020-12-23 09:29:16,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:16,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334969739] [2020-12-23 09:29:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:16,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-12-23 09:29:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:16,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-12-23 09:29:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 09:29:16,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334969739] [2020-12-23 09:29:16,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:16,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:29:16,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161154448] [2020-12-23 09:29:16,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:29:16,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:29:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:29:16,975 INFO L87 Difference]: Start difference. First operand 3955 states and 9185 transitions. Second operand 8 states. [2020-12-23 09:29:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:18,926 INFO L93 Difference]: Finished difference Result 7960 states and 23812 transitions. [2020-12-23 09:29:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:29:18,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2020-12-23 09:29:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:18,975 INFO L225 Difference]: With dead ends: 7960 [2020-12-23 09:29:18,976 INFO L226 Difference]: Without dead ends: 4022 [2020-12-23 09:29:19,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:29:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2020-12-23 09:29:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3983. [2020-12-23 09:29:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-23 09:29:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 9181 transitions. [2020-12-23 09:29:19,473 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 9181 transitions. Word has length 80 [2020-12-23 09:29:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:19,473 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 9181 transitions. [2020-12-23 09:29:19,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 9181 transitions. [2020-12-23 09:29:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 09:29:19,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:19,484 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:19,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 09:29:19,484 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1052225459, now seen corresponding path program 1 times [2020-12-23 09:29:19,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:19,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026042376] [2020-12-23 09:29:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-23 09:29:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-12-23 09:29:19,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026042376] [2020-12-23 09:29:19,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075185020] [2020-12-23 09:29:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:19,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 09:29:19,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-12-23 09:29:20,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:20,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2020-12-23 09:29:20,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031715896] [2020-12-23 09:29:20,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:29:20,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:29:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:20,146 INFO L87 Difference]: Start difference. First operand 3983 states and 9181 transitions. Second operand 8 states. [2020-12-23 09:29:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:20,694 INFO L93 Difference]: Finished difference Result 8035 states and 23837 transitions. [2020-12-23 09:29:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:29:20,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2020-12-23 09:29:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:20,782 INFO L225 Difference]: With dead ends: 8035 [2020-12-23 09:29:20,782 INFO L226 Difference]: Without dead ends: 4069 [2020-12-23 09:29:20,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2020-12-23 09:29:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 3993. [2020-12-23 09:29:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3993 states. [2020-12-23 09:29:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 9195 transitions. [2020-12-23 09:29:21,241 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 9195 transitions. Word has length 103 [2020-12-23 09:29:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:21,242 INFO L481 AbstractCegarLoop]: Abstraction has 3993 states and 9195 transitions. [2020-12-23 09:29:21,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 9195 transitions. [2020-12-23 09:29:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:29:21,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:21,248 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:21,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-23 09:29:21,449 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1144829659, now seen corresponding path program 1 times [2020-12-23 09:29:21,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:21,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102495007] [2020-12-23 09:29:21,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-12-23 09:29:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-12-23 09:29:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-23 09:29:21,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102495007] [2020-12-23 09:29:21,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:21,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:21,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591645381] [2020-12-23 09:29:21,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:21,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:21,759 INFO L87 Difference]: Start difference. First operand 3993 states and 9195 transitions. Second operand 4 states. [2020-12-23 09:29:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:22,806 INFO L93 Difference]: Finished difference Result 8076 states and 24178 transitions. [2020-12-23 09:29:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:22,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 09:29:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:22,873 INFO L225 Difference]: With dead ends: 8076 [2020-12-23 09:29:22,874 INFO L226 Difference]: Without dead ends: 4100 [2020-12-23 09:29:22,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2020-12-23 09:29:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4069. [2020-12-23 09:29:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2020-12-23 09:29:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 9592 transitions. [2020-12-23 09:29:23,395 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 9592 transitions. Word has length 111 [2020-12-23 09:29:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:23,395 INFO L481 AbstractCegarLoop]: Abstraction has 4069 states and 9592 transitions. [2020-12-23 09:29:23,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 9592 transitions. [2020-12-23 09:29:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 09:29:23,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:23,401 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:23,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 09:29:23,402 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1575384743, now seen corresponding path program 1 times [2020-12-23 09:29:23,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:23,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988451082] [2020-12-23 09:29:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 09:29:23,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988451082] [2020-12-23 09:29:23,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:23,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:29:23,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701556356] [2020-12-23 09:29:23,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:29:23,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:29:23,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:23,690 INFO L87 Difference]: Start difference. First operand 4069 states and 9592 transitions. Second operand 9 states. [2020-12-23 09:29:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:25,232 INFO L93 Difference]: Finished difference Result 8164 states and 24934 transitions. [2020-12-23 09:29:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 09:29:25,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2020-12-23 09:29:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:25,276 INFO L225 Difference]: With dead ends: 8164 [2020-12-23 09:29:25,276 INFO L226 Difference]: Without dead ends: 4107 [2020-12-23 09:29:25,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2020-12-23 09:29:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4068. [2020-12-23 09:29:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2020-12-23 09:29:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 9590 transitions. [2020-12-23 09:29:25,622 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 9590 transitions. Word has length 97 [2020-12-23 09:29:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:25,623 INFO L481 AbstractCegarLoop]: Abstraction has 4068 states and 9590 transitions. [2020-12-23 09:29:25,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:29:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 9590 transitions. [2020-12-23 09:29:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 09:29:25,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:25,629 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:25,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 09:29:25,630 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1329574627, now seen corresponding path program 1 times [2020-12-23 09:29:25,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:25,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977465598] [2020-12-23 09:29:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:29:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-12-23 09:29:26,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977465598] [2020-12-23 09:29:26,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:26,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 09:29:26,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874174413] [2020-12-23 09:29:26,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:29:26,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:29:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:26,073 INFO L87 Difference]: Start difference. First operand 4068 states and 9590 transitions. Second operand 15 states. [2020-12-23 09:29:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:27,509 INFO L93 Difference]: Finished difference Result 8185 states and 24958 transitions. [2020-12-23 09:29:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 09:29:27,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2020-12-23 09:29:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:27,556 INFO L225 Difference]: With dead ends: 8185 [2020-12-23 09:29:27,556 INFO L226 Difference]: Without dead ends: 4134 [2020-12-23 09:29:27,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:29:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2020-12-23 09:29:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 4109. [2020-12-23 09:29:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2020-12-23 09:29:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 9707 transitions. [2020-12-23 09:29:27,873 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 9707 transitions. Word has length 143 [2020-12-23 09:29:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:27,874 INFO L481 AbstractCegarLoop]: Abstraction has 4109 states and 9707 transitions. [2020-12-23 09:29:27,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:29:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 9707 transitions. [2020-12-23 09:29:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 09:29:27,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:27,882 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:27,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 09:29:27,882 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1946947355, now seen corresponding path program 1 times [2020-12-23 09:29:27,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:27,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890440930] [2020-12-23 09:29:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-12-23 09:29:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-12-23 09:29:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-23 09:29:28,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890440930] [2020-12-23 09:29:28,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56445411] [2020-12-23 09:29:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 09:29:28,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-12-23 09:29:28,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:28,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2020-12-23 09:29:28,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333669001] [2020-12-23 09:29:28,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:29:28,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:28,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:29:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:28,762 INFO L87 Difference]: Start difference. First operand 4109 states and 9707 transitions. Second operand 8 states. [2020-12-23 09:29:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:29,140 INFO L93 Difference]: Finished difference Result 8281 states and 25302 transitions. [2020-12-23 09:29:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:29:29,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 154 [2020-12-23 09:29:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:29,194 INFO L225 Difference]: With dead ends: 8281 [2020-12-23 09:29:29,194 INFO L226 Difference]: Without dead ends: 4189 [2020-12-23 09:29:29,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:29:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2020-12-23 09:29:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4113. [2020-12-23 09:29:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2020-12-23 09:29:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 9711 transitions. [2020-12-23 09:29:29,598 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 9711 transitions. Word has length 154 [2020-12-23 09:29:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:29,599 INFO L481 AbstractCegarLoop]: Abstraction has 4113 states and 9711 transitions. [2020-12-23 09:29:29,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 9711 transitions. [2020-12-23 09:29:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:29:29,605 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:29,605 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:29,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:29,806 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -541709257, now seen corresponding path program 1 times [2020-12-23 09:29:29,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:29,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629945331] [2020-12-23 09:29:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-12-23 09:29:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-12-23 09:29:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-12-23 09:29:30,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629945331] [2020-12-23 09:29:30,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042263071] [2020-12-23 09:29:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:30,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 09:29:30,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:30,556 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 16 treesize of output 8 [2020-12-23 09:29:30,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:30,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:30,560 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:29:30,560 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-23 09:29:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 131 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-12-23 09:29:30,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:30,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2020-12-23 09:29:30,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068463914] [2020-12-23 09:29:30,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 09:29:30,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 09:29:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:29:30,650 INFO L87 Difference]: Start difference. First operand 4113 states and 9711 transitions. Second operand 16 states. [2020-12-23 09:29:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:33,746 INFO L93 Difference]: Finished difference Result 8889 states and 26245 transitions. [2020-12-23 09:29:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-23 09:29:33,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 145 [2020-12-23 09:29:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:33,792 INFO L225 Difference]: With dead ends: 8889 [2020-12-23 09:29:33,792 INFO L226 Difference]: Without dead ends: 4784 [2020-12-23 09:29:33,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 09:29:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2020-12-23 09:29:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 4691. [2020-12-23 09:29:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4691 states. [2020-12-23 09:29:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 10555 transitions. [2020-12-23 09:29:34,138 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 10555 transitions. Word has length 145 [2020-12-23 09:29:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:34,139 INFO L481 AbstractCegarLoop]: Abstraction has 4691 states and 10555 transitions. [2020-12-23 09:29:34,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 09:29:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 10555 transitions. [2020-12-23 09:29:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:29:34,146 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:34,146 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:34,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:34,347 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1495999487, now seen corresponding path program 1 times [2020-12-23 09:29:34,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:34,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475751447] [2020-12-23 09:29:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:34,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:34,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-12-23 09:29:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:34,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-12-23 09:29:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-23 09:29:34,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475751447] [2020-12-23 09:29:34,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:34,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:29:34,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539511559] [2020-12-23 09:29:34,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:29:34,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:29:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:29:34,526 INFO L87 Difference]: Start difference. First operand 4691 states and 10555 transitions. Second operand 8 states. [2020-12-23 09:29:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:36,095 INFO L93 Difference]: Finished difference Result 9416 states and 27305 transitions. [2020-12-23 09:29:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:36,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-12-23 09:29:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:36,160 INFO L225 Difference]: With dead ends: 9416 [2020-12-23 09:29:36,161 INFO L226 Difference]: Without dead ends: 4738 [2020-12-23 09:29:36,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:29:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4738 states. [2020-12-23 09:29:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4738 to 4690. [2020-12-23 09:29:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2020-12-23 09:29:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 10472 transitions. [2020-12-23 09:29:36,544 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 10472 transitions. Word has length 89 [2020-12-23 09:29:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:36,544 INFO L481 AbstractCegarLoop]: Abstraction has 4690 states and 10472 transitions. [2020-12-23 09:29:36,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:29:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 10472 transitions. [2020-12-23 09:29:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:29:36,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:36,552 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:36,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 09:29:36,552 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1624124430, now seen corresponding path program 1 times [2020-12-23 09:29:36,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:36,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646411870] [2020-12-23 09:29:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-12-23 09:29:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-12-23 09:29:37,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646411870] [2020-12-23 09:29:37,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 09:29:37,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665291517] [2020-12-23 09:29:37,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 09:29:37,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 09:29:37,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:29:37,032 INFO L87 Difference]: Start difference. First operand 4690 states and 10472 transitions. Second operand 14 states. [2020-12-23 09:29:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,510 INFO L93 Difference]: Finished difference Result 9562 states and 27392 transitions. [2020-12-23 09:29:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 09:29:38,511 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2020-12-23 09:29:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,560 INFO L225 Difference]: With dead ends: 9562 [2020-12-23 09:29:38,560 INFO L226 Difference]: Without dead ends: 4889 [2020-12-23 09:29:38,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:29:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2020-12-23 09:29:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4814. [2020-12-23 09:29:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-12-23 09:29:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 10763 transitions. [2020-12-23 09:29:38,978 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 10763 transitions. Word has length 145 [2020-12-23 09:29:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:38,979 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 10763 transitions. [2020-12-23 09:29:38,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 09:29:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 10763 transitions. [2020-12-23 09:29:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 09:29:38,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:38,991 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:38,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 09:29:38,991 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:38,992 INFO L82 PathProgramCache]: Analyzing trace with hash -448293933, now seen corresponding path program 1 times [2020-12-23 09:29:38,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:38,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090675253] [2020-12-23 09:29:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-12-23 09:29:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-23 09:29:39,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090675253] [2020-12-23 09:29:39,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 09:29:39,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245684579] [2020-12-23 09:29:39,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 09:29:39,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 09:29:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:29:39,326 INFO L87 Difference]: Start difference. First operand 4814 states and 10763 transitions. Second operand 14 states. [2020-12-23 09:29:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:41,112 INFO L93 Difference]: Finished difference Result 9676 states and 27789 transitions. [2020-12-23 09:29:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 09:29:41,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2020-12-23 09:29:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:41,161 INFO L225 Difference]: With dead ends: 9676 [2020-12-23 09:29:41,162 INFO L226 Difference]: Without dead ends: 4879 [2020-12-23 09:29:41,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:29:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2020-12-23 09:29:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4808. [2020-12-23 09:29:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2020-12-23 09:29:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 10753 transitions. [2020-12-23 09:29:41,601 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 10753 transitions. Word has length 117 [2020-12-23 09:29:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:41,601 INFO L481 AbstractCegarLoop]: Abstraction has 4808 states and 10753 transitions. [2020-12-23 09:29:41,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 09:29:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 10753 transitions. [2020-12-23 09:29:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 09:29:41,608 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:41,608 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:41,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 09:29:41,608 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1072667975, now seen corresponding path program 1 times [2020-12-23 09:29:41,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:41,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004928439] [2020-12-23 09:29:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:29:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:29:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 09:29:41,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004928439] [2020-12-23 09:29:41,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:41,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 09:29:41,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324787264] [2020-12-23 09:29:41,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:29:41,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:29:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:41,918 INFO L87 Difference]: Start difference. First operand 4808 states and 10753 transitions. Second operand 15 states. [2020-12-23 09:29:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:43,494 INFO L93 Difference]: Finished difference Result 9718 states and 27861 transitions. [2020-12-23 09:29:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 09:29:43,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 138 [2020-12-23 09:29:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:43,545 INFO L225 Difference]: With dead ends: 9718 [2020-12-23 09:29:43,545 INFO L226 Difference]: Without dead ends: 4927 [2020-12-23 09:29:43,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2020-12-23 09:29:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2020-12-23 09:29:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4856. [2020-12-23 09:29:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4856 states. [2020-12-23 09:29:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4856 states to 4856 states and 10837 transitions. [2020-12-23 09:29:44,037 INFO L78 Accepts]: Start accepts. Automaton has 4856 states and 10837 transitions. Word has length 138 [2020-12-23 09:29:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:44,038 INFO L481 AbstractCegarLoop]: Abstraction has 4856 states and 10837 transitions. [2020-12-23 09:29:44,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:29:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4856 states and 10837 transitions. [2020-12-23 09:29:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 09:29:44,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:44,047 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:44,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 09:29:44,048 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -718806614, now seen corresponding path program 1 times [2020-12-23 09:29:44,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:44,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967275686] [2020-12-23 09:29:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-12-23 09:29:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:29:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 09:29:44,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967275686] [2020-12-23 09:29:44,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:44,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 09:29:44,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759327171] [2020-12-23 09:29:44,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:29:44,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:29:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:44,322 INFO L87 Difference]: Start difference. First operand 4856 states and 10837 transitions. Second operand 15 states. [2020-12-23 09:29:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:45,772 INFO L93 Difference]: Finished difference Result 9768 states and 27947 transitions. [2020-12-23 09:29:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 09:29:45,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2020-12-23 09:29:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:45,825 INFO L225 Difference]: With dead ends: 9768 [2020-12-23 09:29:45,825 INFO L226 Difference]: Without dead ends: 4929 [2020-12-23 09:29:45,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2020-12-23 09:29:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2020-12-23 09:29:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 4850. [2020-12-23 09:29:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2020-12-23 09:29:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 10827 transitions. [2020-12-23 09:29:46,215 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 10827 transitions. Word has length 109 [2020-12-23 09:29:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:46,215 INFO L481 AbstractCegarLoop]: Abstraction has 4850 states and 10827 transitions. [2020-12-23 09:29:46,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:29:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 10827 transitions. [2020-12-23 09:29:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-23 09:29:46,226 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:46,226 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:46,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 09:29:46,226 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash -882810934, now seen corresponding path program 1 times [2020-12-23 09:29:46,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:46,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934299699] [2020-12-23 09:29:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:29:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:29:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:29:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:29:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-12-23 09:29:46,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934299699] [2020-12-23 09:29:46,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432283937] [2020-12-23 09:29:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:47,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 09:29:47,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 80 proven. 1 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-12-23 09:29:47,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:47,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2020-12-23 09:29:47,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058476647] [2020-12-23 09:29:47,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 09:29:47,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:47,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 09:29:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2020-12-23 09:29:47,338 INFO L87 Difference]: Start difference. First operand 4850 states and 10827 transitions. Second operand 20 states. [2020-12-23 09:29:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:49,248 INFO L93 Difference]: Finished difference Result 9765 states and 28182 transitions. [2020-12-23 09:29:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 09:29:49,249 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2020-12-23 09:29:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:49,298 INFO L225 Difference]: With dead ends: 9765 [2020-12-23 09:29:49,298 INFO L226 Difference]: Without dead ends: 4932 [2020-12-23 09:29:49,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 09:29:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2020-12-23 09:29:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4839. [2020-12-23 09:29:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2020-12-23 09:29:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 10870 transitions. [2020-12-23 09:29:49,685 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 10870 transitions. Word has length 190 [2020-12-23 09:29:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:49,685 INFO L481 AbstractCegarLoop]: Abstraction has 4839 states and 10870 transitions. [2020-12-23 09:29:49,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 09:29:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 10870 transitions. [2020-12-23 09:29:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-23 09:29:49,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:49,695 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:49,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-23 09:29:49,896 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash 164353487, now seen corresponding path program 1 times [2020-12-23 09:29:49,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:49,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944998906] [2020-12-23 09:29:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-12-23 09:29:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:29:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:29:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-12-23 09:29:50,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944998906] [2020-12-23 09:29:50,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:50,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-23 09:29:50,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735087416] [2020-12-23 09:29:50,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 09:29:50,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 09:29:50,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:29:50,807 INFO L87 Difference]: Start difference. First operand 4839 states and 10870 transitions. Second operand 19 states. [2020-12-23 09:29:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:52,445 INFO L93 Difference]: Finished difference Result 10028 states and 28889 transitions. [2020-12-23 09:29:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 09:29:52,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 183 [2020-12-23 09:29:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:52,514 INFO L225 Difference]: With dead ends: 10028 [2020-12-23 09:29:52,514 INFO L226 Difference]: Without dead ends: 5206 [2020-12-23 09:29:52,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2020-12-23 09:29:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2020-12-23 09:29:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5131. [2020-12-23 09:29:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5131 states. [2020-12-23 09:29:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5131 states to 5131 states and 11631 transitions. [2020-12-23 09:29:52,917 INFO L78 Accepts]: Start accepts. Automaton has 5131 states and 11631 transitions. Word has length 183 [2020-12-23 09:29:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:52,918 INFO L481 AbstractCegarLoop]: Abstraction has 5131 states and 11631 transitions. [2020-12-23 09:29:52,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 09:29:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5131 states and 11631 transitions. [2020-12-23 09:29:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-12-23 09:29:52,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:52,930 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:52,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 09:29:52,931 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1809368164, now seen corresponding path program 1 times [2020-12-23 09:29:52,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:52,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076433155] [2020-12-23 09:29:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,316 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-23 09:29:53,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:29:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-12-23 09:29:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:29:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:29:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2020-12-23 09:29:53,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076433155] [2020-12-23 09:29:53,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228746542] [2020-12-23 09:29:53,715 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:54,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 09:29:54,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-12-23 09:29:54,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:54,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-12-23 09:29:54,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629307957] [2020-12-23 09:29:54,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:54,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:54,291 INFO L87 Difference]: Start difference. First operand 5131 states and 11631 transitions. Second operand 11 states. [2020-12-23 09:29:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:55,940 INFO L93 Difference]: Finished difference Result 10364 states and 30271 transitions. [2020-12-23 09:29:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 09:29:55,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2020-12-23 09:29:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:55,998 INFO L225 Difference]: With dead ends: 10364 [2020-12-23 09:29:55,998 INFO L226 Difference]: Without dead ends: 5250 [2020-12-23 09:29:56,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:29:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2020-12-23 09:29:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 4434. [2020-12-23 09:29:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4434 states. [2020-12-23 09:29:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 9220 transitions. [2020-12-23 09:29:56,478 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 9220 transitions. Word has length 233 [2020-12-23 09:29:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:56,479 INFO L481 AbstractCegarLoop]: Abstraction has 4434 states and 9220 transitions. [2020-12-23 09:29:56,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 9220 transitions. [2020-12-23 09:29:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 09:29:56,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:56,491 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:56,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:56,702 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1877882616, now seen corresponding path program 1 times [2020-12-23 09:29:56,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:56,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965565108] [2020-12-23 09:29:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:56,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:29:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:56,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:56,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:29:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-12-23 09:29:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:29:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:29:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:29:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:29:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:29:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2020-12-23 09:29:57,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965565108] [2020-12-23 09:29:57,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:57,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-23 09:29:57,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019144289] [2020-12-23 09:29:57,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 09:29:57,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 09:29:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:29:57,528 INFO L87 Difference]: Start difference. First operand 4434 states and 9220 transitions. Second operand 19 states. [2020-12-23 09:29:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:59,198 INFO L93 Difference]: Finished difference Result 8922 states and 23535 transitions. [2020-12-23 09:29:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 09:29:59,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 215 [2020-12-23 09:29:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:59,267 INFO L225 Difference]: With dead ends: 8922 [2020-12-23 09:29:59,267 INFO L226 Difference]: Without dead ends: 4505 [2020-12-23 09:29:59,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2020-12-23 09:29:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2020-12-23 09:29:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4346. [2020-12-23 09:29:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2020-12-23 09:29:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 9016 transitions. [2020-12-23 09:29:59,891 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 9016 transitions. Word has length 215 [2020-12-23 09:29:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:59,892 INFO L481 AbstractCegarLoop]: Abstraction has 4346 states and 9016 transitions. [2020-12-23 09:29:59,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 09:29:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 9016 transitions. [2020-12-23 09:29:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 09:29:59,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:59,909 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:59,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-23 09:29:59,909 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -493480491, now seen corresponding path program 1 times [2020-12-23 09:29:59,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:59,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027975862] [2020-12-23 09:29:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:30:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:30:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 09:30:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:30:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-23 09:30:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-12-23 09:30:00,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027975862] [2020-12-23 09:30:00,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:00,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-23 09:30:00,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274534865] [2020-12-23 09:30:00,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 09:30:00,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 09:30:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-12-23 09:30:00,345 INFO L87 Difference]: Start difference. First operand 4346 states and 9016 transitions. Second operand 18 states. [2020-12-23 09:30:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:02,375 INFO L93 Difference]: Finished difference Result 8826 states and 23181 transitions. [2020-12-23 09:30:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 09:30:02,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2020-12-23 09:30:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:02,421 INFO L225 Difference]: With dead ends: 8826 [2020-12-23 09:30:02,421 INFO L226 Difference]: Without dead ends: 4497 [2020-12-23 09:30:02,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2020-12-23 09:30:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2020-12-23 09:30:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4340. [2020-12-23 09:30:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4340 states. [2020-12-23 09:30:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 9006 transitions. [2020-12-23 09:30:02,746 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 9006 transitions. Word has length 127 [2020-12-23 09:30:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:02,746 INFO L481 AbstractCegarLoop]: Abstraction has 4340 states and 9006 transitions. [2020-12-23 09:30:02,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 09:30:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 9006 transitions. [2020-12-23 09:30:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:30:02,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:02,861 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:02,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-23 09:30:02,861 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:02,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1292773454, now seen corresponding path program 1 times [2020-12-23 09:30:02,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:02,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608002270] [2020-12-23 09:30:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-12-23 09:30:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-12-23 09:30:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 59 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:30:03,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608002270] [2020-12-23 09:30:03,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427493288] [2020-12-23 09:30:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-23 09:30:03,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:03,692 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 19 treesize of output 18 [2020-12-23 09:30:03,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:03,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:03,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:03,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2020-12-23 09:30:03,747 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 15 treesize of output 7 [2020-12-23 09:30:03,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:03,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:03,750 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:03,751 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-23 09:30:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:30:03,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:03,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2020-12-23 09:30:03,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649988604] [2020-12-23 09:30:03,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 09:30:03,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 09:30:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:30:03,849 INFO L87 Difference]: Start difference. First operand 4340 states and 9006 transitions. Second operand 23 states. [2020-12-23 09:30:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:08,323 INFO L93 Difference]: Finished difference Result 8816 states and 23096 transitions. [2020-12-23 09:30:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 09:30:08,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2020-12-23 09:30:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:08,394 INFO L225 Difference]: With dead ends: 8816 [2020-12-23 09:30:08,394 INFO L226 Difference]: Without dead ends: 4493 [2020-12-23 09:30:08,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 09:30:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2020-12-23 09:30:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 4428. [2020-12-23 09:30:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2020-12-23 09:30:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 9068 transitions. [2020-12-23 09:30:08,679 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 9068 transitions. Word has length 111 [2020-12-23 09:30:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:08,679 INFO L481 AbstractCegarLoop]: Abstraction has 4428 states and 9068 transitions. [2020-12-23 09:30:08,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 09:30:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 9068 transitions. [2020-12-23 09:30:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 09:30:08,689 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:08,689 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:08,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:08,893 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1518282338, now seen corresponding path program 1 times [2020-12-23 09:30:08,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:08,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579346166] [2020-12-23 09:30:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,102 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2020-12-23 09:30:09,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:30:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-12-23 09:30:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-12-23 09:30:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 09:30:09,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579346166] [2020-12-23 09:30:09,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698923759] [2020-12-23 09:30:09,257 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:09,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 09:30:09,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:09,538 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 16 treesize of output 8 [2020-12-23 09:30:09,540 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:09,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:09,542 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:09,543 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-23 09:30:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 80 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 09:30:09,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:09,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2020-12-23 09:30:09,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010332915] [2020-12-23 09:30:09,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:30:09,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:30:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:30:09,623 INFO L87 Difference]: Start difference. First operand 4428 states and 9068 transitions. Second operand 12 states. [2020-12-23 09:30:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:11,884 INFO L93 Difference]: Finished difference Result 10523 states and 27157 transitions. [2020-12-23 09:30:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 09:30:11,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2020-12-23 09:30:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:11,938 INFO L225 Difference]: With dead ends: 10523 [2020-12-23 09:30:11,939 INFO L226 Difference]: Without dead ends: 6100 [2020-12-23 09:30:11,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2020-12-23 09:30:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2020-12-23 09:30:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5859. [2020-12-23 09:30:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5859 states. [2020-12-23 09:30:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 12060 transitions. [2020-12-23 09:30:12,341 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 12060 transitions. Word has length 115 [2020-12-23 09:30:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:12,341 INFO L481 AbstractCegarLoop]: Abstraction has 5859 states and 12060 transitions. [2020-12-23 09:30:12,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:30:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 12060 transitions. [2020-12-23 09:30:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 09:30:12,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:12,351 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:12,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2020-12-23 09:30:12,552 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 721660617, now seen corresponding path program 1 times [2020-12-23 09:30:12,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:12,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015250734] [2020-12-23 09:30:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:30:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-12-23 09:30:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-12-23 09:30:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 09:30:12,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015250734] [2020-12-23 09:30:12,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294148436] [2020-12-23 09:30:12,753 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 09:30:12,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:13,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:13,048 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 17 treesize of output 9 [2020-12-23 09:30:13,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:13,052 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 17 treesize of output 9 [2020-12-23 09:30:13,054 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:13,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:13,058 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 09:30:13,058 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2020-12-23 09:30:13,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:13,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:13,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 09:30:13,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:13,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-12-23 09:30:13,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135402358] [2020-12-23 09:30:13,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 09:30:13,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 09:30:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:30:13,113 INFO L87 Difference]: Start difference. First operand 5859 states and 12060 transitions. Second operand 10 states. [2020-12-23 09:30:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:15,133 INFO L93 Difference]: Finished difference Result 11467 states and 29420 transitions. [2020-12-23 09:30:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:30:15,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2020-12-23 09:30:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:15,186 INFO L225 Difference]: With dead ends: 11467 [2020-12-23 09:30:15,186 INFO L226 Difference]: Without dead ends: 5625 [2020-12-23 09:30:15,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:30:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2020-12-23 09:30:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 5557. [2020-12-23 09:30:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5557 states. [2020-12-23 09:30:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 10487 transitions. [2020-12-23 09:30:15,596 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 10487 transitions. Word has length 112 [2020-12-23 09:30:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:15,597 INFO L481 AbstractCegarLoop]: Abstraction has 5557 states and 10487 transitions. [2020-12-23 09:30:15,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 09:30:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 10487 transitions. [2020-12-23 09:30:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 09:30:15,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:15,604 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:15,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:15,812 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -123563945, now seen corresponding path program 1 times [2020-12-23 09:30:15,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:15,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437396572] [2020-12-23 09:30:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-12-23 09:30:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-12-23 09:30:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:30:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-12-23 09:30:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-12-23 09:30:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 09:30:16,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437396572] [2020-12-23 09:30:16,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926642335] [2020-12-23 09:30:16,738 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:17,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 238 conjunts are in the unsatisfiable core [2020-12-23 09:30:17,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:17,045 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-23 09:30:17,046 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2020-12-23 09:30:17,047 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,055 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,055 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2020-12-23 09:30:17,105 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 09:30:17,106 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 9 [2020-12-23 09:30:17,107 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,120 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 9 treesize of output 3 [2020-12-23 09:30:17,121 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:17,132 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2020-12-23 09:30:17,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:17,205 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,205 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2020-12-23 09:30:17,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,251 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2020-12-23 09:30:17,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:17,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2020-12-23 09:30:17,420 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 11 treesize of output 7 [2020-12-23 09:30:17,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,433 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:17,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-12-23 09:30:17,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:17,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:17,526 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,527 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2020-12-23 09:30:17,529 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,572 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-12-23 09:30:17,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:17,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2020-12-23 09:30:17,648 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_149|], 2=[|v_#memory_int_135|]} [2020-12-23 09:30:17,654 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 15 treesize of output 1 [2020-12-23 09:30:17,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:17,679 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 19 treesize of output 18 [2020-12-23 09:30:17,680 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:17,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:17,696 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2020-12-23 09:30:17,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:18,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:18,291 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,292 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 09:30:18,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:30:18,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:18,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:18,335 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2020-12-23 09:30:18,339 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,381 INFO L625 ElimStorePlain]: treesize reduction 8, result has 84.9 percent of original size [2020-12-23 09:30:18,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,386 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2020-12-23 09:30:18,496 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_150|], 2=[|v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_135|, |v_#memory_$Pointer$.base_134|], 6=[|v_#memory_int_137|]} [2020-12-23 09:30:18,511 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 15 treesize of output 1 [2020-12-23 09:30:18,512 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,661 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-23 09:30:18,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,673 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 19 treesize of output 1 [2020-12-23 09:30:18,674 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,765 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:18,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,835 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:18,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:18,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:18,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-12-23 09:30:18,903 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:18,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:18,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:19,016 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,017 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 4 case distinctions, treesize of input 50 treesize of output 137 [2020-12-23 09:30:19,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:30:19,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:19,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:30:19,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:19,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:19,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:19,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:19,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-12-23 09:30:19,367 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:19,616 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-12-23 09:30:19,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,618 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_150|, |v_#memory_$Pointer$.base_BEFORE_CALL_3|], 2=[|v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_135|, |v_#memory_$Pointer$.base_134|], 3=[|v_#memory_int_137|]} [2020-12-23 09:30:19,629 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 15 treesize of output 1 [2020-12-23 09:30:19,630 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:19,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,707 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:19,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,760 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 19 treesize of output 1 [2020-12-23 09:30:19,760 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:19,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,794 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:19,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,822 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:19,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,839 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_134| vanished before elimination [2020-12-23 09:30:19,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:19,854 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:19,855 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 2 case distinctions, treesize of input 21 treesize of output 31 [2020-12-23 09:30:19,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:19,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:20,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:20,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:20,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:20,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-12-23 09:30:20,122 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:20,232 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-23 09:30:20,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,234 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_150|, |v_#memory_$Pointer$.base_BEFORE_CALL_3|], 2=[|v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_135|, |v_#memory_$Pointer$.base_134|], 3=[|v_#memory_int_137|]} [2020-12-23 09:30:20,242 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 15 treesize of output 1 [2020-12-23 09:30:20,245 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:20,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,322 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:20,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,379 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 19 treesize of output 1 [2020-12-23 09:30:20,380 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:20,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,416 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:20,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,447 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:20,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,467 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_134| vanished before elimination [2020-12-23 09:30:20,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:20,488 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:20,488 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 2 case distinctions, treesize of input 21 treesize of output 31 [2020-12-23 09:30:20,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:20,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:21,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:21,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:21,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:21,667 INFO L244 Elim1Store]: Index analysis took 486 ms [2020-12-23 09:30:21,668 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-12-23 09:30:21,673 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:24,712 WARN L197 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 158 [2020-12-23 09:30:24,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:24,721 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_150|, |v_#memory_$Pointer$.base_BEFORE_CALL_3|, |v_#memory_$Pointer$.offset_133|, |v_#memory_$Pointer$.offset_135|], 2=[|v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_135|, |v_#memory_$Pointer$.base_134|, |v_#memory_$Pointer$.offset_134|], 3=[|v_#memory_int_137|], 6=[|v_#memory_$Pointer$.base_140|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_138|]} [2020-12-23 09:30:24,926 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 15 treesize of output 1 [2020-12-23 09:30:24,927 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:27,104 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 152 [2020-12-23 09:30:27,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:27,123 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:28,619 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 144 [2020-12-23 09:30:28,620 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:28,636 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 1413 treesize of output 1383 [2020-12-23 09:30:28,639 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:29,711 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 142 [2020-12-23 09:30:29,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:29,726 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 1395 treesize of output 1377 [2020-12-23 09:30:29,728 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:30,256 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-12-23 09:30:30,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:30,295 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:30,295 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 1438 treesize of output 1308 [2020-12-23 09:30:30,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 09:30:30,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 09:30:30,309 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2020-12-23 09:30:40,502 WARN L197 SmtUtils]: Spent 10.19 s on a formula simplification. DAG size of input: 166 DAG size of output: 157 [2020-12-23 09:30:40,503 INFO L625 ElimStorePlain]: treesize reduction 69, result has 97.6 percent of original size [2020-12-23 09:30:40,836 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 19 treesize of output 1 [2020-12-23 09:30:40,837 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:44,491 WARN L197 SmtUtils]: Spent 3.65 s on a formula simplification that was a NOOP. DAG size: 149 [2020-12-23 09:30:44,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:44,522 INFO L547 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:47,549 WARN L197 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 145 [2020-12-23 09:30:47,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:47,595 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-23 09:30:49,088 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 132 [2020-12-23 09:30:49,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:49,088 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_134| vanished before elimination [2020-12-23 09:30:49,118 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 2664 treesize of output 2370 [2020-12-23 09:30:49,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:49,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:49,124 INFO L547 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:30:50,637 WARN L197 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 130 [2020-12-23 09:30:50,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:50,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:50,817 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:30:50,817 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 2 case distinctions, treesize of input 21 treesize of output 31 [2020-12-23 09:30:50,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:50,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:30:53,336 WARN L197 SmtUtils]: Spent 808.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-12-23 09:30:54,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:54,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:54,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 09:30:54,255 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-12-23 09:30:54,259 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:31:00,501 WARN L197 SmtUtils]: Spent 6.24 s on a formula simplification that was a NOOP. DAG size: 176 [2020-12-23 09:31:00,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:00,508 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_150|, |v_#memory_$Pointer$.base_BEFORE_CALL_3|, |v_#memory_$Pointer$.offset_133|, |v_#memory_$Pointer$.offset_135|], 2=[|v_#memory_$Pointer$.base_152|, |v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_135|, |v_#memory_$Pointer$.base_134|, |v_#memory_$Pointer$.offset_134|], 3=[|v_#memory_int_137|], 6=[|v_#memory_$Pointer$.base_140|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_138|]} [2020-12-23 09:31:01,061 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 15 treesize of output 1 [2020-12-23 09:31:01,062 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:31:04,899 WARN L197 SmtUtils]: Spent 3.84 s on a formula simplification that was a NOOP. DAG size: 170 [2020-12-23 09:31:04,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:05,053 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 09:31:08,688 WARN L197 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 163 [2020-12-23 09:31:08,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:08,715 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 4151 treesize of output 4085 [2020-12-23 09:31:08,717 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:31:14,088 WARN L197 SmtUtils]: Spent 5.37 s on a formula simplification that was a NOOP. DAG size: 161 [2020-12-23 09:31:14,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:14,111 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 4097 treesize of output 4067 [2020-12-23 09:31:14,113 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:31:18,061 WARN L197 SmtUtils]: Spent 3.95 s on a formula simplification that was a NOOP. DAG size: 159 [2020-12-23 09:31:18,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:18,291 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:31:22,057 WARN L197 SmtUtils]: Spent 3.77 s on a formula simplification that was a NOOP. DAG size: 156 [2020-12-23 09:31:22,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:22,112 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:31:22,113 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 4128 treesize of output 3674 [2020-12-23 09:31:22,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 09:31:22,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 09:31:22,119 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts.