/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/forester-heap/dll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:19:07,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:19:07,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:19:07,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:19:07,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:19:07,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:19:07,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:19:07,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:19:07,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:19:07,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:19:07,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:19:07,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:19:07,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:19:07,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:19:07,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:19:07,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:19:08,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:19:08,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:19:08,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:19:08,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:19:08,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:19:08,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:19:08,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:19:08,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:19:08,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:19:08,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:19:08,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:19:08,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:19:08,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:19:08,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:19:08,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:19:08,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:19:08,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:19:08,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:19:08,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:19:08,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:19:08,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:19:08,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:19:08,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:19:08,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:19:08,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:19:08,065 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 06:19:08,097 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:19:08,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:19:08,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:19:08,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:19:08,101 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:19:08,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:19:08,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:19:08,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:19:08,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:19:08,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:19:08,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:19:08,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:19:08,104 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:19:08,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:19:08,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:19:08,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:19:08,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:19:08,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:19:08,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:19:08,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:19:08,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:19:08,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:19:08,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:19:08,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:19:08,108 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:19:08,108 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 06:19:08,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:19:08,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:19:08,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:19:08,664 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:19:08,665 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:19:08,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2020-12-23 06:19:08,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98ec637a9/584ba722326e48dc9079b6bb88cb971b/FLAG382112a21 [2020-12-23 06:19:09,526 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:19:09,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2020-12-23 06:19:09,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98ec637a9/584ba722326e48dc9079b6bb88cb971b/FLAG382112a21 [2020-12-23 06:19:09,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98ec637a9/584ba722326e48dc9079b6bb88cb971b [2020-12-23 06:19:09,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:19:09,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:19:09,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:19:09,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:19:09,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:19:09,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:19:09" (1/1) ... [2020-12-23 06:19:09,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74489236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:09, skipping insertion in model container [2020-12-23 06:19:09,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:19:09" (1/1) ... [2020-12-23 06:19:09,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:19:09,917 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:19:10,313 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/forester-heap/dll-optional-1.i[22753,22766] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:19:10,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:19:10,335 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:19:10,418 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/forester-heap/dll-optional-1.i[22753,22766] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:19:10,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:19:10,522 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:19:10,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10 WrapperNode [2020-12-23 06:19:10,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:19:10,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:19:10,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:19:10,525 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:19:10,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:19:10,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:19:10,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:19:10,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:19:10,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (1/1) ... [2020-12-23 06:19:10,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:19:10,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:19:10,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:19:10,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:19:10,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (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 06:19:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 06:19:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 06:19:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 06:19:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 06:19:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:19:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 06:19:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 06:19:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:19:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:19:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:19:11,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:19:11,254 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-23 06:19:11,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:19:11 BoogieIcfgContainer [2020-12-23 06:19:11,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:19:11,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:19:11,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:19:11,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:19:11,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:19:09" (1/3) ... [2020-12-23 06:19:11,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fc476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:19:11, skipping insertion in model container [2020-12-23 06:19:11,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:19:10" (2/3) ... [2020-12-23 06:19:11,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fc476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:19:11, skipping insertion in model container [2020-12-23 06:19:11,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:19:11" (3/3) ... [2020-12-23 06:19:11,269 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2020-12-23 06:19:11,277 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:19:11,283 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 06:19:11,306 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 06:19:11,345 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:19:11,345 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:19:11,346 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:19:11,346 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:19:11,346 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:19:11,346 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:19:11,346 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:19:11,347 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:19:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-23 06:19:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 06:19:11,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:11,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:11,384 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2020-12-23 06:19:11,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:11,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151727877] [2020-12-23 06:19:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:11,753 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 06:19:11,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151727877] [2020-12-23 06:19:11,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:11,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 06:19:11,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857055866] [2020-12-23 06:19:11,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 06:19:11,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 06:19:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:19:11,782 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-23 06:19:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:11,808 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2020-12-23 06:19:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 06:19:11,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-23 06:19:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:11,824 INFO L225 Difference]: With dead ends: 51 [2020-12-23 06:19:11,825 INFO L226 Difference]: Without dead ends: 22 [2020-12-23 06:19:11,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:19:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-12-23 06:19:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-12-23 06:19:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-23 06:19:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-12-23 06:19:11,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2020-12-23 06:19:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:11,872 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-12-23 06:19:11,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 06:19:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-12-23 06:19:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:19:11,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:11,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:11,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:19:11,875 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2020-12-23 06:19:11,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:11,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109859502] [2020-12-23 06:19:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:11,966 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 06:19:11,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109859502] [2020-12-23 06:19:11,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:11,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:19:11,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302946415] [2020-12-23 06:19:11,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:19:11,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:19:11,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:19:11,976 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2020-12-23 06:19:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:12,059 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-12-23 06:19:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:19:12,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-23 06:19:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:12,063 INFO L225 Difference]: With dead ends: 37 [2020-12-23 06:19:12,063 INFO L226 Difference]: Without dead ends: 25 [2020-12-23 06:19:12,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:19:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-23 06:19:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-12-23 06:19:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-23 06:19:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-12-23 06:19:12,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2020-12-23 06:19:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:12,073 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-12-23 06:19:12,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:19:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-12-23 06:19:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:19:12,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:12,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:12,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 06:19:12,075 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2020-12-23 06:19:12,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:12,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092125903] [2020-12-23 06:19:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:12,231 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 06:19:12,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092125903] [2020-12-23 06:19:12,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:12,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:19:12,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204610645] [2020-12-23 06:19:12,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:19:12,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:19:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:19:12,241 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2020-12-23 06:19:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:12,451 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-12-23 06:19:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:19:12,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-23 06:19:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:12,453 INFO L225 Difference]: With dead ends: 41 [2020-12-23 06:19:12,453 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 06:19:12,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:19:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 06:19:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2020-12-23 06:19:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-23 06:19:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-12-23 06:19:12,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-12-23 06:19:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:12,460 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-12-23 06:19:12,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:19:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-12-23 06:19:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:19:12,461 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:12,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:12,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:19:12,462 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2020-12-23 06:19:12,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:12,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127611779] [2020-12-23 06:19:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:12,650 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 06:19:12,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127611779] [2020-12-23 06:19:12,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:12,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 06:19:12,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053352519] [2020-12-23 06:19:12,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 06:19:12,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 06:19:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:19:12,654 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2020-12-23 06:19:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:13,027 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2020-12-23 06:19:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:19:13,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-23 06:19:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:13,029 INFO L225 Difference]: With dead ends: 93 [2020-12-23 06:19:13,030 INFO L226 Difference]: Without dead ends: 74 [2020-12-23 06:19:13,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:19:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-23 06:19:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2020-12-23 06:19:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-23 06:19:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-12-23 06:19:13,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2020-12-23 06:19:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:13,041 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-12-23 06:19:13,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 06:19:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-12-23 06:19:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:19:13,043 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:13,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:13,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:19:13,043 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2020-12-23 06:19:13,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:13,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052655058] [2020-12-23 06:19:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:13,116 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 06:19:13,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052655058] [2020-12-23 06:19:13,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:13,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:19:13,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352226969] [2020-12-23 06:19:13,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:19:13,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:19:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:19:13,120 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2020-12-23 06:19:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:13,373 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2020-12-23 06:19:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:19:13,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-23 06:19:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:13,375 INFO L225 Difference]: With dead ends: 87 [2020-12-23 06:19:13,376 INFO L226 Difference]: Without dead ends: 64 [2020-12-23 06:19:13,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:19:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-23 06:19:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2020-12-23 06:19:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-23 06:19:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2020-12-23 06:19:13,384 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2020-12-23 06:19:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:13,385 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-12-23 06:19:13,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:19:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-12-23 06:19:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 06:19:13,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:13,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:13,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 06:19:13,386 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2020-12-23 06:19:13,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:13,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376008327] [2020-12-23 06:19:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:13,459 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 06:19:13,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376008327] [2020-12-23 06:19:13,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:13,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:19:13,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044329263] [2020-12-23 06:19:13,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:19:13,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:19:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:19:13,462 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2020-12-23 06:19:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:13,770 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2020-12-23 06:19:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 06:19:13,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-23 06:19:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:13,776 INFO L225 Difference]: With dead ends: 105 [2020-12-23 06:19:13,776 INFO L226 Difference]: Without dead ends: 86 [2020-12-23 06:19:13,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:19:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-23 06:19:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2020-12-23 06:19:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-23 06:19:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2020-12-23 06:19:13,803 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2020-12-23 06:19:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:13,803 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2020-12-23 06:19:13,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:19:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2020-12-23 06:19:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 06:19:13,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:13,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:13,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 06:19:13,807 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2020-12-23 06:19:13,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:13,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204028624] [2020-12-23 06:19:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:13,905 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 06:19:13,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204028624] [2020-12-23 06:19:13,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:19:13,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:19:13,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928135770] [2020-12-23 06:19:13,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:19:13,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:19:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:19:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:19:13,908 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2020-12-23 06:19:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:19:14,100 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2020-12-23 06:19:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:19:14,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-23 06:19:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:19:14,102 INFO L225 Difference]: With dead ends: 84 [2020-12-23 06:19:14,102 INFO L226 Difference]: Without dead ends: 82 [2020-12-23 06:19:14,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:19:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-23 06:19:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2020-12-23 06:19:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-23 06:19:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2020-12-23 06:19:14,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2020-12-23 06:19:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:19:14,110 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2020-12-23 06:19:14,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:19:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2020-12-23 06:19:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 06:19:14,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:19:14,111 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:19:14,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 06:19:14,112 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:19:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:19:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2020-12-23 06:19:14,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:19:14,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974247605] [2020-12-23 06:19:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:19:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:19:14,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974247605] [2020-12-23 06:19:14,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935853762] [2020-12-23 06:19:14,387 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 06:19:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:19:14,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-23 06:19:14,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:19:14,607 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 06:19:14,608 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,615 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:19:14,684 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 06:19:14,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:19:14,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,730 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 0 case distinctions, treesize of input 31 treesize of output 17 [2020-12-23 06:19:14,732 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,756 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 0 case distinctions, treesize of input 31 treesize of output 17 [2020-12-23 06:19:14,758 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,777 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:19:14,777 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2020-12-23 06:19:14,979 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:14,980 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 28 treesize of output 99 [2020-12-23 06:19:14,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:19:14,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:19:14,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:15,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:15,092 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_42|], 24=[|v_#memory_$Pointer$.base_42|]} [2020-12-23 06:19:15,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,124 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 06:19:15,146 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:15,147 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2020-12-23 06:19:15,154 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:15,315 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-12-23 06:19:15,316 INFO L625 ElimStorePlain]: treesize reduction 12, result has 94.4 percent of original size [2020-12-23 06:19:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:15,519 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-12-23 06:19:15,521 INFO L348 Elim1Store]: treesize reduction 23, result has 85.9 percent of original size [2020-12-23 06:19:15,522 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 176 [2020-12-23 06:19:15,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,552 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:19:15,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:19:15,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,579 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:19:15,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 06:19:15,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:19:15,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 06:19:15,592 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 06:19:15,753 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-12-23 06:19:15,754 INFO L625 ElimStorePlain]: treesize reduction 90, result has 56.9 percent of original size [2020-12-23 06:19:15,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,773 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:19:15,773 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:228, output treesize:157 [2020-12-23 06:19:15,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 06:19:15,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:15,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 06:19:15,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:15,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 06:19:16,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:19:16,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:16,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-12-23 06:19:16,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:16,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-12-23 06:19:16,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2020-12-23 06:19:16,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:16,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:16,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 06:19:16,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 06:19:16,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-12-23 06:19:16,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2020-12-23 06:19:16,414 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:16,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-12-23 06:19:16,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:19:16,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:19:16,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:19:16,430 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:16,516 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:16,517 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-12-23 06:19:16,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:19:16,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:19:16,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:19:16,525 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:18,145 WARN L197 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 105 [2020-12-23 06:19:18,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:18,150 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 34=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_43|]} [2020-12-23 06:19:18,176 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 06:19:18,188 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 06:19:18,800 WARN L197 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-23 06:19:18,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:18,813 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 06:19:18,821 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 06:19:19,188 WARN L197 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-12-23 06:19:19,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:19,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:19,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:19,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:19,973 WARN L197 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-12-23 06:19:19,974 INFO L348 Elim1Store]: treesize reduction 217, result has 64.6 percent of original size [2020-12-23 06:19:19,975 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 235 treesize of output 500 [2020-12-23 06:19:20,008 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:20,009 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:20,011 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:19:20,013 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:19:20,014 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:19:20,020 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:20,021 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:20,026 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:19:20,028 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-23 06:19:20,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[24, 4, 2, 1] term [2020-12-23 06:19:20,036 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 24 disjuncts [2020-12-23 06:19:20,047 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:20,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:20,050 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:19:20,051 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:19:20,052 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:19:20,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:20,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:20,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:19:20,058 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-23 06:19:20,072 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:19:20,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,208 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:19:20,209 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 197 treesize of output 239 [2020-12-23 06:19:20,220 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:20,796 WARN L197 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-12-23 06:19:20,797 INFO L625 ElimStorePlain]: treesize reduction 8, result has 98.3 percent of original size [2020-12-23 06:19:20,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,948 INFO L348 Elim1Store]: treesize reduction 5, result has 93.1 percent of original size [2020-12-23 06:19:20,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 155 [2020-12-23 06:19:20,958 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:19:20,988 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2020-12-23 06:19:20,990 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-12-23 06:19:21,447 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2020-12-23 06:19:21,448 INFO L625 ElimStorePlain]: treesize reduction 44, result has 90.5 percent of original size [2020-12-23 06:19:21,465 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:21,467 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:21,469 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:21,471 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:21,473 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:21,484 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 06:19:21,485 INFO L244 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:585, output treesize:449 [2020-12-23 06:19:21,490 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:21,491 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:21,493 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:21,495 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:21,496 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:23,728 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-23 06:19:23,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:23,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:23,750 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:23,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:23,757 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:25,908 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:25,910 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:25,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:25,915 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:25,917 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:28,052 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:19:28,053 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:28,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:19:28,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:19:28,059 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-23 06:20:11,400 WARN L197 SmtUtils]: Spent 43.24 s on a formula simplification that was a NOOP. DAG size: 135 [2020-12-23 06:21:48,689 WARN L197 SmtUtils]: Spent 1.61 m on a formula simplification. DAG size of input: 176 DAG size of output: 161 [2020-12-23 06:21:48,708 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 06:22:37,060 WARN L197 SmtUtils]: Spent 48.22 s on a formula simplification that was a NOOP. DAG size: 161 [2020-12-23 06:22:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:22:37,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:22:37,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-12-23 06:22:37,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972327650] [2020-12-23 06:22:37,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 06:22:37,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:22:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 06:22:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=240, Unknown=1, NotChecked=0, Total=306 [2020-12-23 06:22:37,083 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 18 states. [2020-12-23 06:22:52,287 WARN L197 SmtUtils]: Spent 12.48 s on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2020-12-23 06:23:07,490 WARN L197 SmtUtils]: Spent 6.35 s on a formula simplification. DAG size of input: 233 DAG size of output: 107 [2020-12-23 06:23:32,848 WARN L197 SmtUtils]: Spent 24.61 s on a formula simplification. DAG size of input: 259 DAG size of output: 176