/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/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:25:07,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:25:07,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:25:07,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:25:07,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:25:07,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:25:07,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:25:07,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:25:07,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:25:07,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:25:07,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:25:07,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:25:07,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:25:07,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:25:07,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:25:07,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:25:07,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:25:07,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:25:07,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:25:07,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:25:07,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:25:07,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:25:07,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:25:07,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:25:07,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:25:07,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:25:07,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:25:07,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:25:07,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:25:07,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:25:07,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:25:07,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:25:07,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:25:07,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:25:07,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:25:07,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:25:07,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:25:07,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:25:07,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:25:07,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:25:07,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:25:07,630 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:25:07,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:25:07,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:25:07,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:25:07,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:25:07,686 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:25:07,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:25:07,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:25:07,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:25:07,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:25:07,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:25:07,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:25:07,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:25:07,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:25:07,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:25:07,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:25:07,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:25:07,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:25:07,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:25:07,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:25:07,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:25:07,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:25:07,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:25:07,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:25:07,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:25:07,691 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:25:07,691 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:25:08,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:25:08,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:25:08,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:25:08,261 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:25:08,262 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:25:08,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-12-23 06:25:08,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/549273f09/1da160e6812547df97665257894a9bed/FLAG266e46f65 [2020-12-23 06:25:09,212 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:25:09,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-12-23 06:25:09,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/549273f09/1da160e6812547df97665257894a9bed/FLAG266e46f65 [2020-12-23 06:25:09,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/549273f09/1da160e6812547df97665257894a9bed [2020-12-23 06:25:09,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:25:09,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:25:09,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:25:09,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:25:09,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:25:09,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:25:09" (1/1) ... [2020-12-23 06:25:09,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1082fff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:09, skipping insertion in model container [2020-12-23 06:25:09,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:25:09" (1/1) ... [2020-12-23 06:25:09,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:25:09,582 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],StructAccessExpression[IdentifierExpression[~root~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~root~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~root~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2020-12-23 06:25:09,953 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/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2020-12-23 06:25:09,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:25:09,974 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],StructAccessExpression[IdentifierExpression[~root~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~root~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~root~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2020-12-23 06:25:10,091 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/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2020-12-23 06:25:10,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:25:10,159 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:25:10,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10 WrapperNode [2020-12-23 06:25:10,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:25:10,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:25:10,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:25:10,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:25:10,170 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:25:10" (1/1) ... [2020-12-23 06:25:10,189 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:25:10" (1/1) ... [2020-12-23 06:25:10,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:25:10,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:25:10,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:25:10,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:25:10,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (1/1) ... [2020-12-23 06:25:10,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:25:10,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:25:10,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:25:10,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:25:10,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25: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:25:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 06:25:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 06:25:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 06:25:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 06:25:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:25:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 06:25:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 06:25:10,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:25:10,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:25:10,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:25:11,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:25:11,093 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2020-12-23 06:25:11,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:25:11 BoogieIcfgContainer [2020-12-23 06:25:11,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:25:11,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:25:11,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:25:11,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:25:11,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:25:09" (1/3) ... [2020-12-23 06:25:11,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250b1de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:25:11, skipping insertion in model container [2020-12-23 06:25:11,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:25:10" (2/3) ... [2020-12-23 06:25:11,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250b1de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:25:11, skipping insertion in model container [2020-12-23 06:25:11,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:25:11" (3/3) ... [2020-12-23 06:25:11,104 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-12-23 06:25:11,112 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:25:11,119 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 06:25:11,141 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 06:25:11,172 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:25:11,173 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:25:11,173 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:25:11,173 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:25:11,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:25:11,174 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:25:11,174 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:25:11,174 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:25:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-12-23 06:25:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:25:11,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:11,202 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:25:11,202 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2020-12-23 06:25:11,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:11,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345336040] [2020-12-23 06:25:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:11,409 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:25:11,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345336040] [2020-12-23 06:25:11,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:11,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 06:25:11,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685063085] [2020-12-23 06:25:11,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 06:25:11,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 06:25:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:25:11,437 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2020-12-23 06:25:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:11,465 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2020-12-23 06:25:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 06:25:11,467 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-12-23 06:25:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:11,480 INFO L225 Difference]: With dead ends: 98 [2020-12-23 06:25:11,480 INFO L226 Difference]: Without dead ends: 43 [2020-12-23 06:25:11,484 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:25:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-23 06:25:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-23 06:25:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-23 06:25:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2020-12-23 06:25:11,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2020-12-23 06:25:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:11,529 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2020-12-23 06:25:11,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 06:25:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-12-23 06:25:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 06:25:11,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:11,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:11,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:25:11,532 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2020-12-23 06:25:11,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:11,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201321706] [2020-12-23 06:25:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:11,605 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:25:11,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201321706] [2020-12-23 06:25:11,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:11,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:25:11,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263182690] [2020-12-23 06:25:11,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:25:11,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:25:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:25:11,611 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2020-12-23 06:25:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:11,637 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2020-12-23 06:25:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:25:11,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-23 06:25:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:11,641 INFO L225 Difference]: With dead ends: 71 [2020-12-23 06:25:11,642 INFO L226 Difference]: Without dead ends: 51 [2020-12-23 06:25:11,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:25:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-23 06:25:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-23 06:25:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 06:25:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2020-12-23 06:25:11,653 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2020-12-23 06:25:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:11,653 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2020-12-23 06:25:11,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:25:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2020-12-23 06:25:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 06:25:11,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:11,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:11,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 06:25:11,656 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2020-12-23 06:25:11,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:11,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688935384] [2020-12-23 06:25:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:25:11,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688935384] [2020-12-23 06:25:11,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:11,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:25:11,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052720106] [2020-12-23 06:25:11,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:25:11,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:25:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:25:11,711 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2020-12-23 06:25:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:11,747 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2020-12-23 06:25:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:25:11,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 06:25:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:11,752 INFO L225 Difference]: With dead ends: 89 [2020-12-23 06:25:11,752 INFO L226 Difference]: Without dead ends: 53 [2020-12-23 06:25:11,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:25:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-23 06:25:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-23 06:25:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-23 06:25:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-12-23 06:25:11,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2020-12-23 06:25:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:11,766 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-12-23 06:25:11,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:25:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-12-23 06:25:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 06:25:11,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:11,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:11,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:25:11,768 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2020-12-23 06:25:11,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:11,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815723456] [2020-12-23 06:25:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:11,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815723456] [2020-12-23 06:25:11,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:11,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:25:11,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182808865] [2020-12-23 06:25:11,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:25:11,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:25:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:25:11,867 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2020-12-23 06:25:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:12,038 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-12-23 06:25:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:25:12,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-23 06:25:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:12,040 INFO L225 Difference]: With dead ends: 78 [2020-12-23 06:25:12,040 INFO L226 Difference]: Without dead ends: 74 [2020-12-23 06:25:12,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:25:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-23 06:25:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2020-12-23 06:25:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-23 06:25:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2020-12-23 06:25:12,059 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2020-12-23 06:25:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:12,059 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2020-12-23 06:25:12,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:25:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2020-12-23 06:25:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 06:25:12,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:12,064 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:12,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:25:12,064 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2020-12-23 06:25:12,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:12,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807788619] [2020-12-23 06:25:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:12,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807788619] [2020-12-23 06:25:12,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:12,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:25:12,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128487355] [2020-12-23 06:25:12,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:25:12,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:12,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:25:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:25:12,199 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2020-12-23 06:25:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:12,366 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2020-12-23 06:25:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:25:12,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-12-23 06:25:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:12,370 INFO L225 Difference]: With dead ends: 80 [2020-12-23 06:25:12,370 INFO L226 Difference]: Without dead ends: 72 [2020-12-23 06:25:12,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:25:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-23 06:25:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2020-12-23 06:25:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-23 06:25:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2020-12-23 06:25:12,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2020-12-23 06:25:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:12,400 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2020-12-23 06:25:12,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:25:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2020-12-23 06:25:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 06:25:12,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:12,403 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:12,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 06:25:12,404 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2020-12-23 06:25:12,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:12,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18397875] [2020-12-23 06:25:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:12,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18397875] [2020-12-23 06:25:12,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:25:12,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:25:12,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001132985] [2020-12-23 06:25:12,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:25:12,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:25:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:25:12,528 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2020-12-23 06:25:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:12,637 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2020-12-23 06:25:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:25:12,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-12-23 06:25:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:12,639 INFO L225 Difference]: With dead ends: 80 [2020-12-23 06:25:12,639 INFO L226 Difference]: Without dead ends: 69 [2020-12-23 06:25:12,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:25:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-23 06:25:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2020-12-23 06:25:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-23 06:25:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2020-12-23 06:25:12,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2020-12-23 06:25:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:12,645 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2020-12-23 06:25:12,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:25:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2020-12-23 06:25:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 06:25:12,647 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:12,647 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:12,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 06:25:12,647 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2020-12-23 06:25:12,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:12,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896424052] [2020-12-23 06:25:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:12,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896424052] [2020-12-23 06:25:12,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529998858] [2020-12-23 06:25:12,767 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:25:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:12,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-23 06:25:12,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:13,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 06:25:13,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:13,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-23 06:25:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:13,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 06:25:13,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:13,089 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2020-12-23 06:25:13,166 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:13,166 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2020-12-23 06:25:13,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,189 INFO L625 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2020-12-23 06:25:13,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:13,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:13,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2020-12-23 06:25:13,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:13,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:13,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-23 06:25:13,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:13,343 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 06:25:13,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:13,348 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:13,348 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-23 06:25:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:13,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:13,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2020-12-23 06:25:13,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179998756] [2020-12-23 06:25:13,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 06:25:13,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 06:25:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-12-23 06:25:13,370 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 16 states. [2020-12-23 06:25:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:13,912 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2020-12-23 06:25:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 06:25:13,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2020-12-23 06:25:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:13,914 INFO L225 Difference]: With dead ends: 82 [2020-12-23 06:25:13,914 INFO L226 Difference]: Without dead ends: 76 [2020-12-23 06:25:13,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:25:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-23 06:25:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-12-23 06:25:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-23 06:25:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2020-12-23 06:25:13,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2020-12-23 06:25:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:13,921 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2020-12-23 06:25:13,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 06:25:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2020-12-23 06:25:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 06:25:13,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:13,923 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:14,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 06:25:14,137 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2020-12-23 06:25:14,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:14,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676289804] [2020-12-23 06:25:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:14,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676289804] [2020-12-23 06:25:14,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752279119] [2020-12-23 06:25:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:14,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-23 06:25:14,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:14,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 06:25:14,462 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:14,478 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-23 06:25:14,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:14,527 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 06:25:14,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:14,539 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2020-12-23 06:25:14,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:14,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2020-12-23 06:25:14,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,620 INFO L625 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2020-12-23 06:25:14,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,624 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:14,624 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2020-12-23 06:25:14,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-23 06:25:14,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:14,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 06:25:14,802 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:14,805 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:14,805 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-23 06:25:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:14,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:14,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2020-12-23 06:25:14,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142128718] [2020-12-23 06:25:14,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 06:25:14,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 06:25:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-12-23 06:25:14,831 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 16 states. [2020-12-23 06:25:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:15,505 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2020-12-23 06:25:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 06:25:15,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2020-12-23 06:25:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:15,508 INFO L225 Difference]: With dead ends: 91 [2020-12-23 06:25:15,508 INFO L226 Difference]: Without dead ends: 87 [2020-12-23 06:25:15,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:25:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-23 06:25:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2020-12-23 06:25:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-23 06:25:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2020-12-23 06:25:15,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2020-12-23 06:25:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:15,517 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2020-12-23 06:25:15,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 06:25:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2020-12-23 06:25:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 06:25:15,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:15,519 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:15,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:15,728 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2020-12-23 06:25:15,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:15,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889122305] [2020-12-23 06:25:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:15,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889122305] [2020-12-23 06:25:15,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448526585] [2020-12-23 06:25:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:16,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 06:25:16,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:16,096 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:16,098 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,116 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:16,117 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,136 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2020-12-23 06:25:16,185 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_43|]} [2020-12-23 06:25:16,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-12-23 06:25:16,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:16,219 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 76 [2020-12-23 06:25:16,222 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,261 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 104 [2020-12-23 06:25:16,266 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,288 INFO L625 ElimStorePlain]: treesize reduction 52, result has 33.3 percent of original size [2020-12-23 06:25:16,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,290 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2020-12-23 06:25:16,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-23 06:25:16,402 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,416 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 06:25:16,418 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:16,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2020-12-23 06:25:16,500 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-12-23 06:25:16,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:16,512 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:16,512 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2020-12-23 06:25:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:16,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:16,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-12-23 06:25:16,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579933866] [2020-12-23 06:25:16,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 06:25:16,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 06:25:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-12-23 06:25:16,523 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 16 states. [2020-12-23 06:25:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:17,290 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2020-12-23 06:25:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 06:25:17,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2020-12-23 06:25:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:17,291 INFO L225 Difference]: With dead ends: 99 [2020-12-23 06:25:17,292 INFO L226 Difference]: Without dead ends: 93 [2020-12-23 06:25:17,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:25:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-23 06:25:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2020-12-23 06:25:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-23 06:25:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2020-12-23 06:25:17,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2020-12-23 06:25:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:17,318 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2020-12-23 06:25:17,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 06:25:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2020-12-23 06:25:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 06:25:17,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:17,331 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:17,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:17,540 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2020-12-23 06:25:17,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:17,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688925379] [2020-12-23 06:25:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:17,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688925379] [2020-12-23 06:25:17,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963070963] [2020-12-23 06:25:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:17,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 06:25:17,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:18,049 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:18,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,067 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:18,068 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,080 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2020-12-23 06:25:18,120 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_45|]} [2020-12-23 06:25:18,125 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-12-23 06:25:18,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:18,147 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 76 [2020-12-23 06:25:18,150 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,182 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,183 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 104 [2020-12-23 06:25:18,186 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,208 INFO L625 ElimStorePlain]: treesize reduction 52, result has 33.3 percent of original size [2020-12-23 06:25:18,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,209 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2020-12-23 06:25:18,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-23 06:25:18,273 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 06:25:18,288 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,296 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:18,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2020-12-23 06:25:18,348 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-12-23 06:25:18,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:18,357 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:18,358 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2020-12-23 06:25:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:18,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:18,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-12-23 06:25:18,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914250286] [2020-12-23 06:25:18,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 06:25:18,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 06:25:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-12-23 06:25:18,368 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 16 states. [2020-12-23 06:25:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:19,040 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-12-23 06:25:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 06:25:19,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2020-12-23 06:25:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:19,041 INFO L225 Difference]: With dead ends: 99 [2020-12-23 06:25:19,042 INFO L226 Difference]: Without dead ends: 87 [2020-12-23 06:25:19,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:25:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-23 06:25:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2020-12-23 06:25:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-23 06:25:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2020-12-23 06:25:19,048 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2020-12-23 06:25:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:19,048 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2020-12-23 06:25:19,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 06:25:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2020-12-23 06:25:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 06:25:19,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:19,050 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:19,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:19,264 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:19,265 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2020-12-23 06:25:19,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:19,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12006576] [2020-12-23 06:25:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:19,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12006576] [2020-12-23 06:25:19,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372504309] [2020-12-23 06:25:19,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:19,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:25:19,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:25:19,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 06:25:19,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:19,618 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:19,619 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,635 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 06:25:19,636 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,649 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,649 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2020-12-23 06:25:19,691 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_45|]} [2020-12-23 06:25:19,696 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-12-23 06:25:19,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,733 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,735 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 137 [2020-12-23 06:25:19,743 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,767 INFO L625 ElimStorePlain]: treesize reduction 52, result has 53.2 percent of original size [2020-12-23 06:25:19,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:19,773 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2020-12-23 06:25:19,775 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,784 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2020-12-23 06:25:19,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-23 06:25:19,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 06:25:19,873 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:19,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2020-12-23 06:25:19,924 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,924 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-12-23 06:25:19,926 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:19,932 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:19,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2020-12-23 06:25:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:19,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:19,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-12-23 06:25:19,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2216911] [2020-12-23 06:25:19,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 06:25:19,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 06:25:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-12-23 06:25:19,961 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 16 states. [2020-12-23 06:25:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:20,514 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2020-12-23 06:25:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 06:25:20,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2020-12-23 06:25:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:20,515 INFO L225 Difference]: With dead ends: 90 [2020-12-23 06:25:20,515 INFO L226 Difference]: Without dead ends: 77 [2020-12-23 06:25:20,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2020-12-23 06:25:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-23 06:25:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2020-12-23 06:25:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-23 06:25:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2020-12-23 06:25:20,520 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2020-12-23 06:25:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:20,521 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2020-12-23 06:25:20,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 06:25:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2020-12-23 06:25:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 06:25:20,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:20,522 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:20,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 06:25:20,738 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2020-12-23 06:25:20,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:20,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301205531] [2020-12-23 06:25:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:20,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301205531] [2020-12-23 06:25:20,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120974774] [2020-12-23 06:25:20,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:21,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 06:25:21,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:25:21,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-23 06:25:21,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:21,091 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:25:21,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,097 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,098 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,098 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:25:21,127 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 06:25:21,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,132 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,148 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 11 treesize of output 7 [2020-12-23 06:25:21,149 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,160 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-12-23 06:25:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:21,195 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 06:25:21,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,204 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-12-23 06:25:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:21,238 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 06:25:21,241 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2020-12-23 06:25:21,308 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-12-23 06:25:21,308 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 06:25:21,310 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:21,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2020-12-23 06:25:21,430 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:21,431 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2020-12-23 06:25:21,434 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:21,490 INFO L625 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-12-23 06:25:21,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:21,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:21,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:21,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:21,528 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:21,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2020-12-23 06:25:21,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:21,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:21,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:21,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:21,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:23,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:23,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:23,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:23,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-23 06:25:23,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:23,796 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 06:25:23,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:23,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:23,807 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:23,807 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-12-23 06:25:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:23,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:23,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2020-12-23 06:25:23,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191724119] [2020-12-23 06:25:23,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 06:25:23,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 06:25:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2020-12-23 06:25:23,823 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 17 states. [2020-12-23 06:25:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:51,187 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2020-12-23 06:25:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 06:25:51,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-12-23 06:25:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:51,190 INFO L225 Difference]: With dead ends: 109 [2020-12-23 06:25:51,190 INFO L226 Difference]: Without dead ends: 103 [2020-12-23 06:25:51,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=224, Invalid=825, Unknown=7, NotChecked=0, Total=1056 [2020-12-23 06:25:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-23 06:25:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2020-12-23 06:25:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-12-23 06:25:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2020-12-23 06:25:51,195 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 35 [2020-12-23 06:25:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:51,196 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2020-12-23 06:25:51,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 06:25:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2020-12-23 06:25:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 06:25:51,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:51,197 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:25:51,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:51,398 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2020-12-23 06:25:51,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:51,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607513241] [2020-12-23 06:25:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:51,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607513241] [2020-12-23 06:25:51,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395344929] [2020-12-23 06:25:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:51,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 06:25:51,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:51,756 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:25:51,758 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:25:51,785 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,785 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 06:25:51,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:51,790 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,805 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 11 treesize of output 7 [2020-12-23 06:25:51,806 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,819 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-12-23 06:25:51,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:51,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 06:25:51,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-12-23 06:25:51,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:51,897 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 06:25:51,898 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,910 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,910 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2020-12-23 06:25:51,954 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-12-23 06:25:51,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 06:25:51,963 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:51,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:51,977 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:51,978 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2020-12-23 06:25:52,083 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:52,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2020-12-23 06:25:52,087 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:52,137 INFO L625 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-12-23 06:25:52,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:52,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,168 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:52,169 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2020-12-23 06:25:52,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:52,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:52,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:52,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:54,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:54,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:25:54,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:25:54,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-23 06:25:54,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:54,555 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 06:25:54,556 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:54,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:54,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:54,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-12-23 06:25:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:25:54,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:54,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2020-12-23 06:25:54,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885280166] [2020-12-23 06:25:54,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 06:25:54,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:54,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 06:25:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2020-12-23 06:25:54,573 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 17 states. [2020-12-23 06:26:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:12,231 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2020-12-23 06:26:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 06:26:12,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-12-23 06:26:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:12,232 INFO L225 Difference]: With dead ends: 124 [2020-12-23 06:26:12,232 INFO L226 Difference]: Without dead ends: 118 [2020-12-23 06:26:12,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=221, Invalid=831, Unknown=4, NotChecked=0, Total=1056 [2020-12-23 06:26:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-23 06:26:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2020-12-23 06:26:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-23 06:26:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2020-12-23 06:26:12,239 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 35 [2020-12-23 06:26:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:12,239 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2020-12-23 06:26:12,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 06:26:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2020-12-23 06:26:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 06:26:12,240 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:12,240 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:12,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:12,454 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1258149093, now seen corresponding path program 1 times [2020-12-23 06:26:12,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:12,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115797346] [2020-12-23 06:26:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:26:12,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115797346] [2020-12-23 06:26:12,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72239775] [2020-12-23 06:26:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:12,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 06:26:12,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:12,765 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:26:12,766 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:26:12,804 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,805 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:26:12,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:12,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,830 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 11 treesize of output 7 [2020-12-23 06:26:12,831 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-12-23 06:26:12,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:12,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 06:26:12,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-12-23 06:26:12,948 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,948 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 06:26:12,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:12,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:12,953 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,970 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 06:26:12,972 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:12,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:12,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-12-23 06:26:13,034 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-12-23 06:26:13,035 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 06:26:13,036 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:13,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:13,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:13,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-12-23 06:26:13,114 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-12-23 06:26:13,116 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:13,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:13,134 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:13,134 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-12-23 06:26:13,217 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-12-23 06:26:13,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:13,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:13,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:13,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-12-23 06:26:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:26:13,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:26:13,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2020-12-23 06:26:13,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310185361] [2020-12-23 06:26:13,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 06:26:13,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 06:26:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-12-23 06:26:13,260 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand 18 states. [2020-12-23 06:26:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:14,106 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2020-12-23 06:26:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 06:26:14,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2020-12-23 06:26:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:14,108 INFO L225 Difference]: With dead ends: 122 [2020-12-23 06:26:14,108 INFO L226 Difference]: Without dead ends: 112 [2020-12-23 06:26:14,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2020-12-23 06:26:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-23 06:26:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2020-12-23 06:26:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-23 06:26:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2020-12-23 06:26:14,115 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 37 [2020-12-23 06:26:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:14,115 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2020-12-23 06:26:14,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 06:26:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-12-23 06:26:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 06:26:14,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:14,117 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:14,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 06:26:14,317 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2020-12-23 06:26:14,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:14,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264394488] [2020-12-23 06:26:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:26:14,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264394488] [2020-12-23 06:26:14,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457086628] [2020-12-23 06:26:14,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:14,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 06:26:14,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 06:26:14,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjunts are in the unsatisfiable core [2020-12-23 06:26:14,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:14,759 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:26:14,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 06:26:14,823 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,823 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:26:14,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:14,828 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,861 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 06:26:14,901 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 13 treesize of output 9 [2020-12-23 06:26:14,902 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,922 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 13 treesize of output 9 [2020-12-23 06:26:14,922 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,937 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:14,937 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2020-12-23 06:26:14,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:14,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2020-12-23 06:26:14,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:14,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:15,001 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,031 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_51|]} [2020-12-23 06:26:15,039 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 06:26:15,040 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:15,075 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2020-12-23 06:26:15,076 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,124 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-12-23 06:26:15,124 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2020-12-23 06:26:15,126 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,143 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,143 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:50 [2020-12-23 06:26:15,217 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,217 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 175 [2020-12-23 06:26:15,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 06:26:15,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:26:15,224 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,258 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 126 [2020-12-23 06:26:15,261 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:15,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2020-12-23 06:26:15,297 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,321 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,322 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:206, output treesize:152 [2020-12-23 06:26:15,384 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|], 6=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_53|]} [2020-12-23 06:26:15,390 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66 [2020-12-23 06:26:15,392 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,446 INFO L625 ElimStorePlain]: treesize reduction 28, result has 92.3 percent of original size [2020-12-23 06:26:15,500 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,500 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 295 [2020-12-23 06:26:15,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 06:26:15,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:26:15,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:26:15,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 06:26:15,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 06:26:15,510 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:26:15,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:26:15,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:26:15,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:26:15,518 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2020-12-23 06:26:15,591 INFO L625 ElimStorePlain]: treesize reduction 792, result has 22.5 percent of original size [2020-12-23 06:26:15,642 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 227 [2020-12-23 06:26:15,647 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,661 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,661 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:385, output treesize:77 [2020-12-23 06:26:15,732 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,733 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 50 [2020-12-23 06:26:15,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:26:15,737 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:15,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,757 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-12-23 06:26:15,759 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:15,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:15,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:15,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:18 [2020-12-23 06:26:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 06:26:15,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:26:15,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2020-12-23 06:26:15,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717437461] [2020-12-23 06:26:15,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 06:26:15,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 06:26:15,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-12-23 06:26:15,899 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2020-12-23 06:26:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:17,271 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2020-12-23 06:26:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 06:26:17,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2020-12-23 06:26:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:17,272 INFO L225 Difference]: With dead ends: 125 [2020-12-23 06:26:17,272 INFO L226 Difference]: Without dead ends: 119 [2020-12-23 06:26:17,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2020-12-23 06:26:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-23 06:26:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2020-12-23 06:26:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-12-23 06:26:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2020-12-23 06:26:17,281 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 37 [2020-12-23 06:26:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:17,282 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2020-12-23 06:26:17,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-23 06:26:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2020-12-23 06:26:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 06:26:17,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:17,283 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:17,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 06:26:17,499 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2020-12-23 06:26:17,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:17,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371315512] [2020-12-23 06:26:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 06:26:17,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 06:26:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 06:26:17,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 06:26:17,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 06:26:17,656 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 06:26:17,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 06:26:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:26:17 BoogieIcfgContainer [2020-12-23 06:26:17,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 06:26:17,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 06:26:17,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 06:26:17,734 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 06:26:17,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:25:11" (3/4) ... [2020-12-23 06:26:17,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 06:26:17,799 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr-1.i-witness.graphml [2020-12-23 06:26:17,800 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 06:26:17,801 INFO L168 Benchmark]: Toolchain (without parser) took 68277.83 ms. Allocated memory was 152.0 MB in the beginning and 268.4 MB in the end (delta: 116.4 MB). Free memory was 126.0 MB in the beginning and 233.1 MB in the end (delta: -107.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,801 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 06:26:17,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.51 ms. Allocated memory is still 152.0 MB. Free memory was 125.8 MB in the beginning and 103.1 MB in the end (delta: 22.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.41 ms. Allocated memory is still 152.0 MB. Free memory was 103.1 MB in the beginning and 100.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,802 INFO L168 Benchmark]: Boogie Preprocessor took 48.35 ms. Allocated memory is still 152.0 MB. Free memory was 100.7 MB in the beginning and 98.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,803 INFO L168 Benchmark]: RCFGBuilder took 821.81 ms. Allocated memory is still 152.0 MB. Free memory was 98.6 MB in the beginning and 102.4 MB in the end (delta: -3.8 MB). Peak memory consumption was 4.5 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,803 INFO L168 Benchmark]: TraceAbstraction took 66635.96 ms. Allocated memory was 152.0 MB in the beginning and 268.4 MB in the end (delta: 116.4 MB). Free memory was 101.9 MB in the beginning and 237.3 MB in the end (delta: -135.4 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 06:26:17,804 INFO L168 Benchmark]: Witness Printer took 66.63 ms. Allocated memory is still 268.4 MB. Free memory was 237.3 MB in the beginning and 233.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 06:26:17,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 634.51 ms. Allocated memory is still 152.0 MB. Free memory was 125.8 MB in the beginning and 103.1 MB in the end (delta: 22.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.41 ms. Allocated memory is still 152.0 MB. Free memory was 103.1 MB in the beginning and 100.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.35 ms. Allocated memory is still 152.0 MB. Free memory was 100.7 MB in the beginning and 98.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 821.81 ms. Allocated memory is still 152.0 MB. Free memory was 98.6 MB in the beginning and 102.4 MB in the end (delta: -3.8 MB). Peak memory consumption was 4.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 66635.96 ms. Allocated memory was 152.0 MB in the beginning and 268.4 MB in the end (delta: 116.4 MB). Free memory was 101.9 MB in the beginning and 237.3 MB in the end (delta: -135.4 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 66.63 ms. Allocated memory is still 268.4 MB. Free memory was 237.3 MB in the beginning and 233.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) [L597] List t; [L598] List p = a; [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 66.4s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 823 SDtfs, 838 SDslu, 4443 SDs, 0 SdLazy, 2801 SolverSat, 347 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 255 SyntacticMatches, 14 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 201 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 743 ConstructedInterpolants, 39 QuantifiedInterpolants, 229413 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 42/134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...