/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-178dd20 [2021-01-06 16:13:27,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:13:27,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:13:27,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:13:27,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:13:27,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:13:27,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:13:27,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:13:27,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:13:27,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:13:27,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:13:27,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:13:27,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:13:27,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:13:27,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:13:27,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:13:27,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:13:27,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:13:27,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:13:27,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:13:27,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:13:27,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:13:27,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:13:27,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:13:27,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:13:27,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:13:27,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:13:27,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:13:27,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:13:27,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:13:27,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:13:27,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:13:27,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:13:27,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:13:27,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:13:27,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:13:27,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:13:27,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:13:27,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:13:27,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:13:27,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:13:27,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:13:27,652 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:13:27,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:13:27,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:13:27,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:13:27,659 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:13:27,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:13:27,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:13:27,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:13:27,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:13:27,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:13:27,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:13:27,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:13:27,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:13:27,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:13:27,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:13:27,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:13:27,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:13:27,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:13:27,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:13:27,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:13:27,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:13:27,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:13:27,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:13:27,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:13:27,664 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:13:27,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:13:28,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:13:28,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:13:28,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:13:28,147 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:13:28,148 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:13:28,149 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 [2021-01-06 16:13:28,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7f6d5b4e8/61ec9ec47b3c4e5492d1f843f0399301/FLAG0a998b749 [2021-01-06 16:13:28,898 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:13:28,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-01-06 16:13:28,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7f6d5b4e8/61ec9ec47b3c4e5492d1f843f0399301/FLAG0a998b749 [2021-01-06 16:13:29,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7f6d5b4e8/61ec9ec47b3c4e5492d1f843f0399301 [2021-01-06 16:13:29,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:13:29,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:13:29,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:29,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:13:29,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:13:29,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:29,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6770ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29, skipping insertion in model container [2021-01-06 16:13:29,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:29,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:13:29,280 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,] [2021-01-06 16:13:29,677 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,] [2021-01-06 16:13:29,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:29,709 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,] [2021-01-06 16:13:29,792 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,] [2021-01-06 16:13:29,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:29,884 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:13:29,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29 WrapperNode [2021-01-06 16:13:29,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:29,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:29,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:13:29,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:13:29,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:29,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:29,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:29,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:13:29,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:13:29,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:13:30,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... [2021-01-06 16:13:30,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:13:30,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:13:30,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:13:30,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:13:30,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:13:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:13:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:13:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:13:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:13:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:13:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:13:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:13:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:13:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:13:30,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:13:30,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:13:30,820 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-01-06 16:13:30,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:30 BoogieIcfgContainer [2021-01-06 16:13:30,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:13:30,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:13:30,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:13:30,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:13:30,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:13:29" (1/3) ... [2021-01-06 16:13:30,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553b7ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:30, skipping insertion in model container [2021-01-06 16:13:30,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:29" (2/3) ... [2021-01-06 16:13:30,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553b7ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:30, skipping insertion in model container [2021-01-06 16:13:30,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:30" (3/3) ... [2021-01-06 16:13:30,832 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-01-06 16:13:30,840 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:13:30,846 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:13:30,867 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:13:30,895 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:13:30,895 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:13:30,895 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:13:30,896 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:13:30,896 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:13:30,896 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:13:30,896 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:13:30,896 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:13:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2021-01-06 16:13:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:13:30,918 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:30,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:30,920 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2021-01-06 16:13:30,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:30,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674493834] [2021-01-06 16:13:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:31,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674493834] [2021-01-06 16:13:31,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:31,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:13:31,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134574086] [2021-01-06 16:13:31,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:13:31,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:13:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:13:31,166 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2021-01-06 16:13:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:31,190 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2021-01-06 16:13:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:13:31,192 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2021-01-06 16:13:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:31,203 INFO L225 Difference]: With dead ends: 51 [2021-01-06 16:13:31,203 INFO L226 Difference]: Without dead ends: 22 [2021-01-06 16:13:31,206 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 [2021-01-06 16:13:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-01-06 16:13:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-01-06 16:13:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-01-06 16:13:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-01-06 16:13:31,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2021-01-06 16:13:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:31,248 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-01-06 16:13:31,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:13:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2021-01-06 16:13:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:13:31,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:31,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:31,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:13:31,250 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2021-01-06 16:13:31,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:31,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001301194] [2021-01-06 16:13:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:31,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001301194] [2021-01-06 16:13:31,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:31,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:31,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236045006] [2021-01-06 16:13:31,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:31,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:31,351 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2021-01-06 16:13:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:31,395 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-01-06 16:13:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:31,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-06 16:13:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:31,397 INFO L225 Difference]: With dead ends: 37 [2021-01-06 16:13:31,397 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 16:13:31,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 16:13:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-01-06 16:13:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 16:13:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2021-01-06 16:13:31,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2021-01-06 16:13:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:31,405 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-01-06 16:13:31,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2021-01-06 16:13:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:13:31,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:31,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:31,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:13:31,407 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:31,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2021-01-06 16:13:31,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:31,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027847517] [2021-01-06 16:13:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:31,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027847517] [2021-01-06 16:13:31,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:31,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:13:31,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403186619] [2021-01-06 16:13:31,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:13:31,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:13:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:31,594 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2021-01-06 16:13:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:31,827 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2021-01-06 16:13:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:13:31,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-06 16:13:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:31,830 INFO L225 Difference]: With dead ends: 41 [2021-01-06 16:13:31,830 INFO L226 Difference]: Without dead ends: 39 [2021-01-06 16:13:31,831 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 [2021-01-06 16:13:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-06 16:13:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2021-01-06 16:13:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-01-06 16:13:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2021-01-06 16:13:31,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2021-01-06 16:13:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:31,837 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2021-01-06 16:13:31,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:13:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2021-01-06 16:13:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:13:31,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:31,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:31,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:13:31,839 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2021-01-06 16:13:31,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:31,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327087921] [2021-01-06 16:13:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:32,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327087921] [2021-01-06 16:13:32,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:32,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:13:32,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440209320] [2021-01-06 16:13:32,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:13:32,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:13:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:13:32,073 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2021-01-06 16:13:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:32,488 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2021-01-06 16:13:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:13:32,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-01-06 16:13:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:32,490 INFO L225 Difference]: With dead ends: 93 [2021-01-06 16:13:32,490 INFO L226 Difference]: Without dead ends: 74 [2021-01-06 16:13:32,491 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 [2021-01-06 16:13:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-06 16:13:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2021-01-06 16:13:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-01-06 16:13:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2021-01-06 16:13:32,501 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2021-01-06 16:13:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:32,501 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2021-01-06 16:13:32,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:13:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2021-01-06 16:13:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:13:32,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:32,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:32,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:13:32,503 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2021-01-06 16:13:32,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:32,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652535560] [2021-01-06 16:13:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:32,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652535560] [2021-01-06 16:13:32,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:32,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:13:32,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469774708] [2021-01-06 16:13:32,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:13:32,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:13:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:32,581 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2021-01-06 16:13:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:32,810 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2021-01-06 16:13:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:13:32,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-06 16:13:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:32,815 INFO L225 Difference]: With dead ends: 87 [2021-01-06 16:13:32,815 INFO L226 Difference]: Without dead ends: 64 [2021-01-06 16:13:32,816 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 [2021-01-06 16:13:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-01-06 16:13:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2021-01-06 16:13:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-01-06 16:13:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2021-01-06 16:13:32,834 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2021-01-06 16:13:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:32,834 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-01-06 16:13:32,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:13:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2021-01-06 16:13:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 16:13:32,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:32,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:32,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:13:32,836 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2021-01-06 16:13:32,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:32,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287552007] [2021-01-06 16:13:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:32,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287552007] [2021-01-06 16:13:32,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:32,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:13:32,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202987824] [2021-01-06 16:13:32,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:13:32,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:32,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:13:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:32,965 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2021-01-06 16:13:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:33,308 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2021-01-06 16:13:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:13:33,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-06 16:13:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:33,310 INFO L225 Difference]: With dead ends: 105 [2021-01-06 16:13:33,311 INFO L226 Difference]: Without dead ends: 86 [2021-01-06 16:13:33,311 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 [2021-01-06 16:13:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-06 16:13:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2021-01-06 16:13:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-01-06 16:13:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2021-01-06 16:13:33,319 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2021-01-06 16:13:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:33,320 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2021-01-06 16:13:33,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:13:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2021-01-06 16:13:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 16:13:33,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:33,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:33,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:13:33,321 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2021-01-06 16:13:33,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:33,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507035249] [2021-01-06 16:13:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:33,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507035249] [2021-01-06 16:13:33,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:33,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:13:33,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596258321] [2021-01-06 16:13:33,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:33,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:33,379 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2021-01-06 16:13:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:33,569 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2021-01-06 16:13:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:13:33,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-01-06 16:13:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:33,570 INFO L225 Difference]: With dead ends: 84 [2021-01-06 16:13:33,571 INFO L226 Difference]: Without dead ends: 82 [2021-01-06 16:13:33,571 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 [2021-01-06 16:13:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-06 16:13:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2021-01-06 16:13:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-01-06 16:13:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2021-01-06 16:13:33,578 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2021-01-06 16:13:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:33,579 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2021-01-06 16:13:33,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2021-01-06 16:13:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:13:33,580 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:33,580 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:33,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:13:33,581 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2021-01-06 16:13:33,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:33,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714029650] [2021-01-06 16:13:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:33,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714029650] [2021-01-06 16:13:33,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883165182] [2021-01-06 16:13:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:34,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-06 16:13:34,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:34,113 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 [2021-01-06 16:13:34,114 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-06 16:13:34,184 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,185 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 [2021-01-06 16:13:34,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:34,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,229 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 [2021-01-06 16:13:34,231 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,253 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 [2021-01-06 16:13:34,254 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,294 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. [2021-01-06 16:13:34,294 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2021-01-06 16:13:34,529 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,529 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 [2021-01-06 16:13:34,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:13:34,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:34,548 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,651 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_42|], 24=[|v_#memory_$Pointer$.base_42|]} [2021-01-06 16:13:34,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:34,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:34,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:34,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:13:34,685 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:34,685 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 [2021-01-06 16:13:34,689 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:34,843 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-01-06 16:13:34,844 INFO L625 ElimStorePlain]: treesize reduction 12, result has 94.4 percent of original size [2021-01-06 16:13:34,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:34,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:34,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:35,061 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-01-06 16:13:35,062 INFO L348 Elim1Store]: treesize reduction 23, result has 85.9 percent of original size [2021-01-06 16:13:35,063 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 [2021-01-06 16:13:35,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,074 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:13:35,077 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:13:35,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,090 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:13:35,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:13:35,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:13:35,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:13:35,106 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:35,283 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2021-01-06 16:13:35,284 INFO L625 ElimStorePlain]: treesize reduction 90, result has 56.9 percent of original size [2021-01-06 16:13:35,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,299 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. [2021-01-06 16:13:35,299 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:228, output treesize:157 [2021-01-06 16:13:35,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:13:35,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 16:13:35,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 16:13:35,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:13:35,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-06 16:13:35,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-06 16:13:35,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-06 16:13:35,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 16:13:35,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:13:35,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-06 16:13:35,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-06 16:13:35,840 INFO L244 Elim1Store]: Index analysis took 114 ms [2021-01-06 16:13:35,879 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:35,880 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 [2021-01-06 16:13:35,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:13:35,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:13:35,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:35,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:35,966 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:35,967 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 [2021-01-06 16:13:35,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:13:35,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:13:35,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:35,976 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,663 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 105 [2021-01-06 16:13:37,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,669 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|]} [2021-01-06 16:13:37,693 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:37,704 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,477 WARN L197 SmtUtils]: Spent 772.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-01-06 16:13:38,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,492 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,500 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,851 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-01-06 16:13:38,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,641 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2021-01-06 16:13:39,642 INFO L348 Elim1Store]: treesize reduction 217, result has 64.6 percent of original size [2021-01-06 16:13:39,644 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 [2021-01-06 16:13:39,668 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:39,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:39,671 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:13:39,672 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:13:39,674 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2021-01-06 16:13:39,677 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:39,678 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:39,680 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:13:39,681 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2021-01-06 16:13:39,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[24, 4, 2, 1] term [2021-01-06 16:13:39,687 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 24 disjuncts [2021-01-06 16:13:39,690 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:39,691 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:39,693 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:13:39,694 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:13:39,695 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2021-01-06 16:13:39,698 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:39,699 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:39,700 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:13:39,701 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2021-01-06 16:13:39,712 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:39,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:39,836 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:39,837 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 [2021-01-06 16:13:39,850 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:40,397 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2021-01-06 16:13:40,398 INFO L625 ElimStorePlain]: treesize reduction 8, result has 98.3 percent of original size [2021-01-06 16:13:40,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:40,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:40,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:40,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:40,565 INFO L348 Elim1Store]: treesize reduction 5, result has 93.1 percent of original size [2021-01-06 16:13:40,566 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 [2021-01-06 16:13:40,574 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:40,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:40,610 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 [2021-01-06 16:13:40,616 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:41,066 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2021-01-06 16:13:41,068 INFO L625 ElimStorePlain]: treesize reduction 44, result has 90.5 percent of original size [2021-01-06 16:13:41,078 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:41,079 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:41,084 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:41,086 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:41,088 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:41,101 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. [2021-01-06 16:13:41,102 INFO L244 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:585, output treesize:449 [2021-01-06 16:13:41,108 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:41,109 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:41,112 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:41,114 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:41,115 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:43,370 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-01-06 16:13:43,387 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:43,388 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:43,391 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:43,395 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:43,398 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:45,552 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:45,553 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:45,555 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:45,559 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:45,561 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:47,697 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:13:47,698 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:47,700 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:13:47,702 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:13:47,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:14:29,935 WARN L197 SmtUtils]: Spent 42.13 s on a formula simplification that was a NOOP. DAG size: 135 [2021-01-06 16:16:09,460 WARN L197 SmtUtils]: Spent 1.65 m on a formula simplification. DAG size of input: 176 DAG size of output: 161 [2021-01-06 16:16:09,475 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-06 16:16:57,773 WARN L197 SmtUtils]: Spent 48.18 s on a formula simplification that was a NOOP. DAG size: 161 [2021-01-06 16:16:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:16:57,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:16:57,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-01-06 16:16:57,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456396950] [2021-01-06 16:16:57,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:16:57,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:16:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:16:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=240, Unknown=1, NotChecked=0, Total=306 [2021-01-06 16:16:57,825 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 18 states. [2021-01-06 16:17:01,675 WARN L197 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2021-01-06 16:17:16,720 WARN L197 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 233 DAG size of output: 107 [2021-01-06 16:17:41,857 WARN L197 SmtUtils]: Spent 24.54 s on a formula simplification. DAG size of input: 259 DAG size of output: 176