/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-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext-properties/list-ext_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:18:56,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:18:56,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:18:56,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:18:56,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:18:56,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:18:56,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:18:56,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:18:56,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:18:56,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:18:56,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:18:56,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:18:56,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:18:56,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:18:56,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:18:56,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:18:56,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:18:56,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:18:56,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:18:56,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:18:56,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:18:56,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:18:56,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:18:56,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:18:56,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:18:56,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:18:56,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:18:56,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:18:56,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:18:56,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:18:56,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:18:56,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:18:56,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:18:56,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:18:56,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:18:56,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:18:56,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:18:56,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:18:56,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:18:56,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:18:56,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:18:56,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:18:56,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:18:56,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:18:56,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:18:56,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:18:56,504 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:18:56,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:18:56,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:18:56,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:18:56,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:18:56,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:18:56,507 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:18:56,507 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:18:56,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:18:56,508 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:18:56,508 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:18:56,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:18:56,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:18:56,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:18:56,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:18:56,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:18:56,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:18:56,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:18:56,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:18:56,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:18:56,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 05:18:56,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:18:57,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:18:57,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:18:57,043 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:18:57,043 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:18:57,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2021-01-07 05:18:57,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d8c4ce29/b6254bad841b407396ebccfa2844fe5b/FLAGc10e23cb5 [2021-01-07 05:18:57,960 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:18:57,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2021-01-07 05:18:57,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d8c4ce29/b6254bad841b407396ebccfa2844fe5b/FLAGc10e23cb5 [2021-01-07 05:18:58,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8d8c4ce29/b6254bad841b407396ebccfa2844fe5b [2021-01-07 05:18:58,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:18:58,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:18:58,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:18:58,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:18:58,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:18:58,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b43013c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58, skipping insertion in model container [2021-01-07 05:18:58,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:18:58,259 INFO L178 MainTranslator]: Built tables and reachable declarations 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: 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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] 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,] [2021-01-07 05:18:58,623 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-ext-properties/list-ext_1.i[23553,23566] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2021-01-07 05:18:58,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:18:58,657 INFO L203 MainTranslator]: Completed pre-run 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: 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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~y~0,] 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,] [2021-01-07 05:18:58,711 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-ext-properties/list-ext_1.i[23553,23566] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2021-01-07 05:18:58,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:18:58,784 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:18:58,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58 WrapperNode [2021-01-07 05:18:58,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:18:58,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:18:58,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:18:58,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:18:58,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:18:58,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:18:58,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:18:58,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:18:58,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... [2021-01-07 05:18:58,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:18:58,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:18:58,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:18:58,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:18:58,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:18:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:18:59,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:18:59,782 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-07 05:18:59,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:18:59 BoogieIcfgContainer [2021-01-07 05:18:59,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:18:59,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:18:59,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:18:59,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:18:59,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:18:58" (1/3) ... [2021-01-07 05:18:59,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417667e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:18:59, skipping insertion in model container [2021-01-07 05:18:59,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:18:58" (2/3) ... [2021-01-07 05:18:59,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417667e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:18:59, skipping insertion in model container [2021-01-07 05:18:59,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:18:59" (3/3) ... [2021-01-07 05:18:59,805 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2021-01-07 05:18:59,816 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:18:59,824 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2021-01-07 05:18:59,847 INFO L253 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-01-07 05:18:59,889 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:18:59,890 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:18:59,890 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:18:59,890 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:18:59,890 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:18:59,890 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:18:59,890 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:18:59,891 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:18:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2021-01-07 05:18:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:18:59,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:18:59,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:18:59,937 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:18:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:18:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1807801548, now seen corresponding path program 1 times [2021-01-07 05:18:59,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:18:59,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41751633] [2021-01-07 05:18:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:00,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41751633] [2021-01-07 05:19:00,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:00,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:19:00,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169200117] [2021-01-07 05:19:00,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 05:19:00,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 05:19:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 05:19:00,228 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2021-01-07 05:19:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:00,251 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-01-07 05:19:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 05:19:00,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2021-01-07 05:19:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:00,264 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:19:00,265 INFO L226 Difference]: Without dead ends: 86 [2021-01-07 05:19:00,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 05:19:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-07 05:19:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-01-07 05:19:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:19:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-01-07 05:19:00,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2021-01-07 05:19:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:00,314 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-01-07 05:19:00,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 05:19:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-01-07 05:19:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:19:00,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:00,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:00,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:19:00,316 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash 206286314, now seen corresponding path program 1 times [2021-01-07 05:19:00,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:00,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988397739] [2021-01-07 05:19:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:00,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988397739] [2021-01-07 05:19:00,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:00,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:19:00,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81534779] [2021-01-07 05:19:00,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:19:00,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:19:00,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:19:00,438 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 4 states. [2021-01-07 05:19:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:00,746 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2021-01-07 05:19:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:19:00,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:19:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:00,749 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:19:00,749 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:19:00,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:19:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:19:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-01-07 05:19:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:19:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2021-01-07 05:19:00,761 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 8 [2021-01-07 05:19:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:00,762 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2021-01-07 05:19:00,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:19:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2021-01-07 05:19:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:19:00,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:00,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:00,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:19:00,763 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 206286315, now seen corresponding path program 1 times [2021-01-07 05:19:00,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:00,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220766685] [2021-01-07 05:19:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:00,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220766685] [2021-01-07 05:19:00,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:00,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:19:00,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716641662] [2021-01-07 05:19:00,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:19:00,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:19:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:19:00,876 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 4 states. [2021-01-07 05:19:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:01,089 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2021-01-07 05:19:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:19:01,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:19:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:01,099 INFO L225 Difference]: With dead ends: 124 [2021-01-07 05:19:01,100 INFO L226 Difference]: Without dead ends: 124 [2021-01-07 05:19:01,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:19:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-07 05:19:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2021-01-07 05:19:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 05:19:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2021-01-07 05:19:01,114 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 8 [2021-01-07 05:19:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:01,114 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2021-01-07 05:19:01,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:19:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2021-01-07 05:19:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:19:01,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:01,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:01,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:19:01,116 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1364928161, now seen corresponding path program 1 times [2021-01-07 05:19:01,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:01,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840662678] [2021-01-07 05:19:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:01,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840662678] [2021-01-07 05:19:01,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:01,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:19:01,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307186998] [2021-01-07 05:19:01,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:19:01,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:19:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:19:01,200 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 6 states. [2021-01-07 05:19:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:01,531 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2021-01-07 05:19:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:19:01,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:19:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:01,534 INFO L225 Difference]: With dead ends: 152 [2021-01-07 05:19:01,534 INFO L226 Difference]: Without dead ends: 152 [2021-01-07 05:19:01,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:19:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-01-07 05:19:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2021-01-07 05:19:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-01-07 05:19:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2021-01-07 05:19:01,544 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 17 [2021-01-07 05:19:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:01,545 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2021-01-07 05:19:01,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:19:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2021-01-07 05:19:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:19:01,546 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:01,546 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:01,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:19:01,547 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1364928160, now seen corresponding path program 1 times [2021-01-07 05:19:01,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:01,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702101723] [2021-01-07 05:19:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:01,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702101723] [2021-01-07 05:19:01,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:01,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:19:01,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735648528] [2021-01-07 05:19:01,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:19:01,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:19:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:19:01,698 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 6 states. [2021-01-07 05:19:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:02,097 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-01-07 05:19:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:19:02,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:19:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:02,099 INFO L225 Difference]: With dead ends: 155 [2021-01-07 05:19:02,099 INFO L226 Difference]: Without dead ends: 155 [2021-01-07 05:19:02,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:19:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-07 05:19:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2021-01-07 05:19:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:19:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-01-07 05:19:02,106 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 17 [2021-01-07 05:19:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:02,107 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-01-07 05:19:02,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:19:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-01-07 05:19:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:19:02,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:02,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:02,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:19:02,108 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1479745928, now seen corresponding path program 1 times [2021-01-07 05:19:02,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:02,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045888386] [2021-01-07 05:19:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:02,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045888386] [2021-01-07 05:19:02,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:02,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:19:02,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712599294] [2021-01-07 05:19:02,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:19:02,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:02,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:19:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:19:02,250 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 7 states. [2021-01-07 05:19:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:02,497 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2021-01-07 05:19:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:19:02,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2021-01-07 05:19:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:02,499 INFO L225 Difference]: With dead ends: 187 [2021-01-07 05:19:02,499 INFO L226 Difference]: Without dead ends: 187 [2021-01-07 05:19:02,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:19:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-01-07 05:19:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2021-01-07 05:19:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-01-07 05:19:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2021-01-07 05:19:02,508 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 18 [2021-01-07 05:19:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:02,508 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2021-01-07 05:19:02,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:19:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2021-01-07 05:19:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:19:02,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:02,509 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] [2021-01-07 05:19:02,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:19:02,510 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 354031242, now seen corresponding path program 1 times [2021-01-07 05:19:02,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:02,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458920605] [2021-01-07 05:19:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:02,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458920605] [2021-01-07 05:19:02,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:02,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:19:02,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216415295] [2021-01-07 05:19:02,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:19:02,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:19:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:19:02,591 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 7 states. [2021-01-07 05:19:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:02,876 INFO L93 Difference]: Finished difference Result 199 states and 216 transitions. [2021-01-07 05:19:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:19:02,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2021-01-07 05:19:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:02,878 INFO L225 Difference]: With dead ends: 199 [2021-01-07 05:19:02,878 INFO L226 Difference]: Without dead ends: 199 [2021-01-07 05:19:02,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:19:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-01-07 05:19:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2021-01-07 05:19:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-01-07 05:19:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2021-01-07 05:19:02,886 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 20 [2021-01-07 05:19:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:02,886 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2021-01-07 05:19:02,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:19:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2021-01-07 05:19:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:19:02,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:02,888 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] [2021-01-07 05:19:02,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:19:02,888 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 354083797, now seen corresponding path program 1 times [2021-01-07 05:19:02,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:02,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424222727] [2021-01-07 05:19:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:02,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424222727] [2021-01-07 05:19:02,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:02,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:19:02,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132121336] [2021-01-07 05:19:02,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:19:02,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:19:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:19:02,955 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 7 states. [2021-01-07 05:19:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:03,197 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2021-01-07 05:19:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:19:03,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2021-01-07 05:19:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:03,200 INFO L225 Difference]: With dead ends: 170 [2021-01-07 05:19:03,200 INFO L226 Difference]: Without dead ends: 170 [2021-01-07 05:19:03,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:19:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-01-07 05:19:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 110. [2021-01-07 05:19:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-01-07 05:19:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2021-01-07 05:19:03,216 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 20 [2021-01-07 05:19:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:03,216 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2021-01-07 05:19:03,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:19:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2021-01-07 05:19:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:19:03,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:03,221 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:03,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:19:03,222 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1029178319, now seen corresponding path program 1 times [2021-01-07 05:19:03,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:03,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874139793] [2021-01-07 05:19:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:03,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874139793] [2021-01-07 05:19:03,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:03,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:19:03,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818030850] [2021-01-07 05:19:03,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:19:03,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:19:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:19:03,302 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 6 states. [2021-01-07 05:19:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:03,523 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2021-01-07 05:19:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:19:03,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 05:19:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:03,524 INFO L225 Difference]: With dead ends: 122 [2021-01-07 05:19:03,524 INFO L226 Difference]: Without dead ends: 122 [2021-01-07 05:19:03,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:19:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-07 05:19:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2021-01-07 05:19:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 05:19:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2021-01-07 05:19:03,529 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 20 [2021-01-07 05:19:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:03,529 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2021-01-07 05:19:03,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:19:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2021-01-07 05:19:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:19:03,530 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:03,531 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:03,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:19:03,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1029178320, now seen corresponding path program 1 times [2021-01-07 05:19:03,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:03,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258503315] [2021-01-07 05:19:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:03,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258503315] [2021-01-07 05:19:03,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:03,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:19:03,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416025860] [2021-01-07 05:19:03,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:19:03,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:19:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:19:03,609 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 6 states. [2021-01-07 05:19:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:03,925 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2021-01-07 05:19:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:19:03,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 05:19:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:03,928 INFO L225 Difference]: With dead ends: 120 [2021-01-07 05:19:03,928 INFO L226 Difference]: Without dead ends: 120 [2021-01-07 05:19:03,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:19:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-01-07 05:19:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2021-01-07 05:19:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:19:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2021-01-07 05:19:03,933 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2021-01-07 05:19:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:03,933 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2021-01-07 05:19:03,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:19:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2021-01-07 05:19:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:19:03,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:03,934 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] [2021-01-07 05:19:03,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:19:03,935 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1053467632, now seen corresponding path program 1 times [2021-01-07 05:19:03,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:03,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434654079] [2021-01-07 05:19:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:03,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434654079] [2021-01-07 05:19:03,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:03,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:19:03,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698369165] [2021-01-07 05:19:03,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:19:03,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:19:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:19:03,987 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 4 states. [2021-01-07 05:19:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:04,075 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2021-01-07 05:19:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:19:04,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-07 05:19:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:04,077 INFO L225 Difference]: With dead ends: 113 [2021-01-07 05:19:04,077 INFO L226 Difference]: Without dead ends: 113 [2021-01-07 05:19:04,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:19:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-07 05:19:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2021-01-07 05:19:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:19:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2021-01-07 05:19:04,082 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 24 [2021-01-07 05:19:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:04,082 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2021-01-07 05:19:04,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:19:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2021-01-07 05:19:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:19:04,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:04,083 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] [2021-01-07 05:19:04,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:19:04,084 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1229881069, now seen corresponding path program 1 times [2021-01-07 05:19:04,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:04,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165177907] [2021-01-07 05:19:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:04,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165177907] [2021-01-07 05:19:04,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:04,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:19:04,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523366575] [2021-01-07 05:19:04,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:19:04,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:19:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:19:04,160 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 5 states. [2021-01-07 05:19:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:04,310 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2021-01-07 05:19:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:19:04,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-07 05:19:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:04,311 INFO L225 Difference]: With dead ends: 128 [2021-01-07 05:19:04,312 INFO L226 Difference]: Without dead ends: 124 [2021-01-07 05:19:04,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:19:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-07 05:19:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2021-01-07 05:19:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-01-07 05:19:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2021-01-07 05:19:04,315 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 26 [2021-01-07 05:19:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:04,316 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2021-01-07 05:19:04,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:19:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2021-01-07 05:19:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:19:04,317 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:04,317 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] [2021-01-07 05:19:04,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:19:04,317 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1671277061, now seen corresponding path program 1 times [2021-01-07 05:19:04,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:04,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873513959] [2021-01-07 05:19:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:04,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873513959] [2021-01-07 05:19:04,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678346205] [2021-01-07 05:19:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:04,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-07 05:19:04,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:04,665 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:04,666 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:04,749 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 [2021-01-07 05:19:04,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,766 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:19:04,768 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:04,819 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,820 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 [2021-01-07 05:19:04,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:04,841 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2021-01-07 05:19:04,901 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_19|], 2=[|v_#memory_int_18|]} [2021-01-07 05:19:04,907 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 [2021-01-07 05:19:04,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:04,932 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 [2021-01-07 05:19:04,933 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,948 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2021-01-07 05:19:04,985 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 20 treesize of output 8 [2021-01-07 05:19:04,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:04,993 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:04,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2021-01-07 05:19:05,046 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 [2021-01-07 05:19:05,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:05,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:05,056 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:05,056 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:19:05,121 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:19:05,121 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 [2021-01-07 05:19:05,123 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:05,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:05,134 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:05,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2021-01-07 05:19:05,245 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 [2021-01-07 05:19:05,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:05,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:05,253 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:05,253 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-07 05:19:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:05,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:05,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2021-01-07 05:19:05,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400195886] [2021-01-07 05:19:05,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:19:05,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:05,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:19:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:19:05,266 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 21 states. [2021-01-07 05:19:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:06,330 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2021-01-07 05:19:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:19:06,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2021-01-07 05:19:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:06,332 INFO L225 Difference]: With dead ends: 195 [2021-01-07 05:19:06,332 INFO L226 Difference]: Without dead ends: 195 [2021-01-07 05:19:06,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:19:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-01-07 05:19:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 112. [2021-01-07 05:19:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-07 05:19:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-01-07 05:19:06,341 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 27 [2021-01-07 05:19:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:06,342 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-01-07 05:19:06,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:19:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2021-01-07 05:19:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:19:06,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:06,343 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] [2021-01-07 05:19:06,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 05:19:06,556 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash 366493373, now seen corresponding path program 1 times [2021-01-07 05:19:06,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:06,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124593496] [2021-01-07 05:19:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:06,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124593496] [2021-01-07 05:19:06,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839717454] [2021-01-07 05:19:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:06,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2021-01-07 05:19:06,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:06,892 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:06,893 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:06,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:06,898 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:06,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:06,989 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:06,991 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:19:06,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:07,002 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-07 05:19:07,070 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 [2021-01-07 05:19:07,071 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,084 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2021-01-07 05:19:07,203 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:19:07,204 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 46 treesize of output 32 [2021-01-07 05:19:07,208 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,217 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2021-01-07 05:19:07,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,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 47 treesize of output 65 [2021-01-07 05:19:07,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:19:07,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:19:07,268 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,278 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. [2021-01-07 05:19:07,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2021-01-07 05:19:07,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:07,442 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,443 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 35 [2021-01-07 05:19:07,445 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:07,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:07,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:07,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2021-01-07 05:19:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:07,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:07,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2021-01-07 05:19:07,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809907092] [2021-01-07 05:19:07,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:19:07,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:19:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:19:07,524 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 25 states. [2021-01-07 05:19:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:09,249 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2021-01-07 05:19:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:19:09,249 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2021-01-07 05:19:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:09,251 INFO L225 Difference]: With dead ends: 225 [2021-01-07 05:19:09,251 INFO L226 Difference]: Without dead ends: 225 [2021-01-07 05:19:09,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:19:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-01-07 05:19:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 132. [2021-01-07 05:19:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-07 05:19:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2021-01-07 05:19:09,258 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 27 [2021-01-07 05:19:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:09,258 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2021-01-07 05:19:09,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:19:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2021-01-07 05:19:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:19:09,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:09,259 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] [2021-01-07 05:19:09,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:19:09,474 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash 366493374, now seen corresponding path program 1 times [2021-01-07 05:19:09,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:09,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419054557] [2021-01-07 05:19:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:09,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419054557] [2021-01-07 05:19:09,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835984217] [2021-01-07 05:19:09,755 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 [2021-01-07 05:19:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:09,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 05:19:09,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:09,851 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:09,852 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:09,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:09,857 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:09,857 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:09,904 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_40|], 1=[|v_#valid_54|]} [2021-01-07 05:19:09,907 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:09,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:09,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:09,928 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:09,930 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 [2021-01-07 05:19:09,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:09,939 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:09,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:09,949 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:09,950 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:10,003 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:19:10,004 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,021 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 [2021-01-07 05:19:10,022 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,037 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2021-01-07 05:19:10,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:10,141 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 25 treesize of output 13 [2021-01-07 05:19:10,142 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,172 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:19:10,173 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 46 treesize of output 32 [2021-01-07 05:19:10,175 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,184 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,184 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:31 [2021-01-07 05:19:10,212 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 35 treesize of output 28 [2021-01-07 05:19:10,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,241 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,241 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 62 treesize of output 74 [2021-01-07 05:19:10,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:19:10,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:19:10,246 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,259 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. [2021-01-07 05:19:10,259 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:64 [2021-01-07 05:19:10,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:10,429 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,430 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2021-01-07 05:19:10,432 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:10,451 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-07 05:19:10,453 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:10,464 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:10,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:9 [2021-01-07 05:19:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:10,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:10,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-01-07 05:19:10,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578120474] [2021-01-07 05:19:10,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:19:10,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:19:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:19:10,476 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 23 states. [2021-01-07 05:19:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:12,547 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2021-01-07 05:19:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:19:12,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2021-01-07 05:19:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:12,549 INFO L225 Difference]: With dead ends: 236 [2021-01-07 05:19:12,549 INFO L226 Difference]: Without dead ends: 236 [2021-01-07 05:19:12,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:19:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-01-07 05:19:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 131. [2021-01-07 05:19:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-01-07 05:19:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2021-01-07 05:19:12,555 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 27 [2021-01-07 05:19:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:12,555 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2021-01-07 05:19:12,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:19:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2021-01-07 05:19:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:19:12,556 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:12,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:12,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 05:19:12,770 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash 562097958, now seen corresponding path program 1 times [2021-01-07 05:19:12,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:12,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661149602] [2021-01-07 05:19:12,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:12,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661149602] [2021-01-07 05:19:12,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:19:12,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:19:12,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164099825] [2021-01-07 05:19:12,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:19:12,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:19:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:19:12,898 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand 7 states. [2021-01-07 05:19:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:13,134 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2021-01-07 05:19:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:19:13,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2021-01-07 05:19:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:13,135 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:19:13,136 INFO L226 Difference]: Without dead ends: 136 [2021-01-07 05:19:13,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:19:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-01-07 05:19:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2021-01-07 05:19:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-07 05:19:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2021-01-07 05:19:13,141 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 28 [2021-01-07 05:19:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:13,141 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2021-01-07 05:19:13,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:19:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2021-01-07 05:19:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:19:13,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:13,142 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] [2021-01-07 05:19:13,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:19:13,143 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash -268143673, now seen corresponding path program 1 times [2021-01-07 05:19:13,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:13,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725145037] [2021-01-07 05:19:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:13,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725145037] [2021-01-07 05:19:13,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772069299] [2021-01-07 05:19:13,315 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 [2021-01-07 05:19:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:13,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-07 05:19:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:13,400 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:13,400 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:13,455 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 [2021-01-07 05:19:13,455 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,471 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:19:13,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:13,503 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,504 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 [2021-01-07 05:19:13,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:13,508 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,517 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2021-01-07 05:19:13,563 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_26|], 2=[|v_#memory_int_22|]} [2021-01-07 05:19:13,574 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 [2021-01-07 05:19:13,575 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:13,594 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 [2021-01-07 05:19:13,596 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,607 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,607 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2021-01-07 05:19:13,649 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 20 treesize of output 8 [2021-01-07 05:19:13,651 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,657 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2021-01-07 05:19:13,705 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 [2021-01-07 05:19:13,706 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,714 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,714 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:19:13,759 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:19:13,760 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 [2021-01-07 05:19:13,762 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:13,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2021-01-07 05:19:13,868 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 [2021-01-07 05:19:13,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:13,878 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:13,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-07 05:19:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:13,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:13,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2021-01-07 05:19:13,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432090481] [2021-01-07 05:19:13,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:19:13,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:19:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:19:13,889 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 21 states. [2021-01-07 05:19:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:14,987 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2021-01-07 05:19:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:19:14,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2021-01-07 05:19:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:14,989 INFO L225 Difference]: With dead ends: 198 [2021-01-07 05:19:14,989 INFO L226 Difference]: Without dead ends: 198 [2021-01-07 05:19:14,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:19:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-01-07 05:19:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 121. [2021-01-07 05:19:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2021-01-07 05:19:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2021-01-07 05:19:14,994 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 29 [2021-01-07 05:19:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:14,994 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2021-01-07 05:19:14,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:19:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2021-01-07 05:19:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:19:14,995 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:14,995 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] [2021-01-07 05:19:15,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:15,197 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash -268091118, now seen corresponding path program 1 times [2021-01-07 05:19:15,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:15,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963078808] [2021-01-07 05:19:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:15,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963078808] [2021-01-07 05:19:15,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232387513] [2021-01-07 05:19:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:15,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 29 conjunts are in the unsatisfiable core [2021-01-07 05:19:15,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:15,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:15,502 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,505 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,506 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:15,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:19:15,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:15,573 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,583 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-07 05:19:15,612 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 [2021-01-07 05:19:15,613 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2021-01-07 05:19:15,727 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:19:15,727 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 40 treesize of output 28 [2021-01-07 05:19:15,729 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:25 [2021-01-07 05:19:15,773 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,774 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 39 treesize of output 57 [2021-01-07 05:19:15,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:19:15,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:19:15,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,788 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. [2021-01-07 05:19:15,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2021-01-07 05:19:15,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,895 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 38 treesize of output 33 [2021-01-07 05:19:15,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:15,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:15,903 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:15,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-01-07 05:19:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:15,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:15,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-01-07 05:19:15,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620835872] [2021-01-07 05:19:15,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:19:15,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:19:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:19:15,967 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 24 states. [2021-01-07 05:19:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:17,150 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2021-01-07 05:19:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:19:17,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2021-01-07 05:19:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:17,151 INFO L225 Difference]: With dead ends: 197 [2021-01-07 05:19:17,152 INFO L226 Difference]: Without dead ends: 197 [2021-01-07 05:19:17,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:19:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-07 05:19:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2021-01-07 05:19:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 05:19:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2021-01-07 05:19:17,157 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 29 [2021-01-07 05:19:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:17,157 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2021-01-07 05:19:17,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:19:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2021-01-07 05:19:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:19:17,158 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:17,158 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] [2021-01-07 05:19:17,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 05:19:17,360 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash -268091117, now seen corresponding path program 1 times [2021-01-07 05:19:17,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:17,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024394626] [2021-01-07 05:19:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:17,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024394626] [2021-01-07 05:19:17,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403494681] [2021-01-07 05:19:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:17,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 05:19:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:17,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:17,685 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,692 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,692 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:17,749 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_41|], 1=[|v_#valid_60|]} [2021-01-07 05:19:17,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:17,753 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,793 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,793 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 [2021-01-07 05:19:17,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:17,798 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,809 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,809 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:17,851 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 [2021-01-07 05:19:17,852 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,869 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:19:17,870 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:17,883 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:17,883 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2021-01-07 05:19:18,007 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:19:18,008 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 46 treesize of output 32 [2021-01-07 05:19:18,010 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,027 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 25 treesize of output 13 [2021-01-07 05:19:18,028 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,036 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,037 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:31 [2021-01-07 05:19:18,086 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,086 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 72 treesize of output 78 [2021-01-07 05:19:18,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:19:18,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:19:18,091 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,107 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 35 treesize of output 28 [2021-01-07 05:19:18,109 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,123 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. [2021-01-07 05:19:18,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:64 [2021-01-07 05:19:18,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:18,357 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,357 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2021-01-07 05:19:18,359 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:18,381 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-01-07 05:19:18,382 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:18,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:18,394 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:9 [2021-01-07 05:19:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:18,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:18,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-01-07 05:19:18,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133439710] [2021-01-07 05:19:18,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:19:18,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:19:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:19:18,408 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 23 states. [2021-01-07 05:19:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:20,393 INFO L93 Difference]: Finished difference Result 205 states and 230 transitions. [2021-01-07 05:19:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:19:20,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2021-01-07 05:19:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:20,395 INFO L225 Difference]: With dead ends: 205 [2021-01-07 05:19:20,395 INFO L226 Difference]: Without dead ends: 205 [2021-01-07 05:19:20,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:19:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-07 05:19:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 123. [2021-01-07 05:19:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 05:19:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2021-01-07 05:19:20,401 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 29 [2021-01-07 05:19:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:20,402 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2021-01-07 05:19:20,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:19:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2021-01-07 05:19:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:19:20,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:20,403 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] [2021-01-07 05:19:20,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:20,618 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash -34817409, now seen corresponding path program 1 times [2021-01-07 05:19:20,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:20,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383728185] [2021-01-07 05:19:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:20,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383728185] [2021-01-07 05:19:20,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482801483] [2021-01-07 05:19:20,773 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 [2021-01-07 05:19:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:20,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-07 05:19:20,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:20,850 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:20,851 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:20,855 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,855 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:20,908 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 [2021-01-07 05:19:20,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,924 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:19:20,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:20,967 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:20,967 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 [2021-01-07 05:19:20,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:20,971 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:20,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:20,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2021-01-07 05:19:21,019 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_33|], 2=[|v_#memory_int_26|]} [2021-01-07 05:19:21,024 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 [2021-01-07 05:19:21,025 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:21,043 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 [2021-01-07 05:19:21,046 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,059 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2021-01-07 05:19:21,095 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 20 treesize of output 8 [2021-01-07 05:19:21,096 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2021-01-07 05:19:21,156 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 [2021-01-07 05:19:21,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,165 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:19:21,200 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:19:21,201 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 [2021-01-07 05:19:21,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,210 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:21,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2021-01-07 05:19:21,284 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 [2021-01-07 05:19:21,286 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:21,291 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:21,291 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-07 05:19:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:21,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:21,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2021-01-07 05:19:21,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658437477] [2021-01-07 05:19:21,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:19:21,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:19:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:19:21,300 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 21 states. [2021-01-07 05:19:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:22,574 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2021-01-07 05:19:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:19:22,574 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2021-01-07 05:19:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:22,575 INFO L225 Difference]: With dead ends: 220 [2021-01-07 05:19:22,575 INFO L226 Difference]: Without dead ends: 220 [2021-01-07 05:19:22,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:19:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-01-07 05:19:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 123. [2021-01-07 05:19:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 05:19:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2021-01-07 05:19:22,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 29 [2021-01-07 05:19:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:22,580 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-01-07 05:19:22,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:19:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2021-01-07 05:19:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:19:22,581 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:22,581 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:22,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:22,786 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash -569217421, now seen corresponding path program 2 times [2021-01-07 05:19:22,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:22,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411451299] [2021-01-07 05:19:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:23,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411451299] [2021-01-07 05:19:23,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183244371] [2021-01-07 05:19:23,011 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 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 [2021-01-07 05:19:23,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:19:23,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:19:23,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-07 05:19:23,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:23,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 [2021-01-07 05:19:23,092 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,095 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,095 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,096 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:23,143 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_64|]} [2021-01-07 05:19:23,146 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:23,147 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,164 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,164 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 [2021-01-07 05:19:23,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:23,167 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,175 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2021-01-07 05:19:23,214 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 [2021-01-07 05:19:23,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,230 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 [2021-01-07 05:19:23,231 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,244 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2021-01-07 05:19:23,348 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_29|], 2=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_35|]} [2021-01-07 05:19:23,352 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 [2021-01-07 05:19:23,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:23,377 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 23 treesize of output 11 [2021-01-07 05:19:23,380 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,414 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:19:23,414 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 40 treesize of output 28 [2021-01-07 05:19:23,417 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,430 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:37 [2021-01-07 05:19:23,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:23,481 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 55 treesize of output 19 [2021-01-07 05:19:23,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,500 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 73 treesize of output 59 [2021-01-07 05:19:23,504 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,535 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,536 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 75 treesize of output 93 [2021-01-07 05:19:23,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:19:23,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:19:23,541 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,554 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,555 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:77 [2021-01-07 05:19:23,675 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,675 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 74 treesize of output 61 [2021-01-07 05:19:23,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,690 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2021-01-07 05:19:23,692 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,702 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:16 [2021-01-07 05:19:23,757 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 [2021-01-07 05:19:23,758 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:23,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:23,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-01-07 05:19:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:23,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:23,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-01-07 05:19:23,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16201154] [2021-01-07 05:19:23,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:19:23,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:19:23,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:19:23,799 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 27 states. [2021-01-07 05:19:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:25,903 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2021-01-07 05:19:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:19:25,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2021-01-07 05:19:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:25,905 INFO L225 Difference]: With dead ends: 204 [2021-01-07 05:19:25,905 INFO L226 Difference]: Without dead ends: 204 [2021-01-07 05:19:25,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:19:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-01-07 05:19:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2021-01-07 05:19:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2021-01-07 05:19:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2021-01-07 05:19:25,910 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 31 [2021-01-07 05:19:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:25,910 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2021-01-07 05:19:25,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:19:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2021-01-07 05:19:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:19:25,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:25,911 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] [2021-01-07 05:19:26,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-07 05:19:26,127 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -89922179, now seen corresponding path program 1 times [2021-01-07 05:19:26,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:26,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853793101] [2021-01-07 05:19:26,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:26,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853793101] [2021-01-07 05:19:26,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152821376] [2021-01-07 05:19:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:26,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-07 05:19:26,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:26,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:26,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,477 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:26,558 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,559 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 [2021-01-07 05:19:26,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:26,561 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,570 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-01-07 05:19:26,614 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 [2021-01-07 05:19:26,615 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,632 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 [2021-01-07 05:19:26,633 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,647 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,647 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2021-01-07 05:19:26,757 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_29|]} [2021-01-07 05:19:26,761 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 [2021-01-07 05:19:26,762 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:26,791 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 31 treesize of output 15 [2021-01-07 05:19:26,793 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:26,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-07 05:19:26,816 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,830 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,830 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:43 [2021-01-07 05:19:26,881 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 119 treesize of output 93 [2021-01-07 05:19:26,883 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:26,909 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 55 treesize of output 19 [2021-01-07 05:19:26,911 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:26,940 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,940 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 66 treesize of output 68 [2021-01-07 05:19:26,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-07 05:19:26,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:19:26,944 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:26,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:26,960 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:75 [2021-01-07 05:19:27,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:27,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:27,190 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:27,190 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 46 [2021-01-07 05:19:27,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:27,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:27,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:27,215 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2021-01-07 05:19:27,217 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:27,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:27,232 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:27,233 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:20 [2021-01-07 05:19:27,316 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 [2021-01-07 05:19:27,317 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:27,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:27,327 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:27,327 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:10 [2021-01-07 05:19:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:27,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:27,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-01-07 05:19:27,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582855938] [2021-01-07 05:19:27,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:19:27,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:19:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:19:27,375 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 30 states. [2021-01-07 05:19:28,577 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2021-01-07 05:19:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:29,751 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2021-01-07 05:19:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:19:29,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2021-01-07 05:19:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:29,753 INFO L225 Difference]: With dead ends: 207 [2021-01-07 05:19:29,753 INFO L226 Difference]: Without dead ends: 207 [2021-01-07 05:19:29,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=292, Invalid=1778, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:19:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-01-07 05:19:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 129. [2021-01-07 05:19:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:19:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2021-01-07 05:19:29,758 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 33 [2021-01-07 05:19:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:29,758 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2021-01-07 05:19:29,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:19:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2021-01-07 05:19:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:19:29,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:29,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:29,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:29,973 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -89869624, now seen corresponding path program 2 times [2021-01-07 05:19:29,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:29,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661688163] [2021-01-07 05:19:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:30,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661688163] [2021-01-07 05:19:30,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591475521] [2021-01-07 05:19:30,252 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:30,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:19:30,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:19:30,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-07 05:19:30,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:30,344 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:30,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,349 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:30,416 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_43|], 1=[|v_#valid_68|]} [2021-01-07 05:19:30,419 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:30,423 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,440 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,441 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 [2021-01-07 05:19:30,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:30,445 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,454 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2021-01-07 05:19:30,497 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 [2021-01-07 05:19:30,497 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,521 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 [2021-01-07 05:19:30,522 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,537 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,537 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2021-01-07 05:19:30,666 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_32|]} [2021-01-07 05:19:30,673 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:19:30,674 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,727 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:19:30,728 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 40 treesize of output 28 [2021-01-07 05:19:30,729 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,750 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 23 treesize of output 11 [2021-01-07 05:19:30,751 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,765 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,765 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:37 [2021-01-07 05:19:30,854 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,855 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 122 treesize of output 124 [2021-01-07 05:19:30,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:19:30,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:19:30,861 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,884 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 104 treesize of output 82 [2021-01-07 05:19:30,886 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:30,907 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 55 treesize of output 19 [2021-01-07 05:19:30,909 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:30,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:30,923 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:77 [2021-01-07 05:19:31,049 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:31,049 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 74 treesize of output 61 [2021-01-07 05:19:31,051 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:31,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:31,066 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2021-01-07 05:19:31,068 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:31,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:31,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:31,077 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:16 [2021-01-07 05:19:31,139 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 [2021-01-07 05:19:31,140 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:31,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:31,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:31,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-01-07 05:19:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:31,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:31,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-01-07 05:19:31,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639444950] [2021-01-07 05:19:31,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:19:31,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:19:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:19:31,188 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2021-01-07 05:19:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:32,720 INFO L93 Difference]: Finished difference Result 181 states and 200 transitions. [2021-01-07 05:19:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:19:32,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2021-01-07 05:19:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:32,722 INFO L225 Difference]: With dead ends: 181 [2021-01-07 05:19:32,722 INFO L226 Difference]: Without dead ends: 181 [2021-01-07 05:19:32,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:19:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-01-07 05:19:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2021-01-07 05:19:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:19:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2021-01-07 05:19:32,728 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 33 [2021-01-07 05:19:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:32,728 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2021-01-07 05:19:32,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:19:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2021-01-07 05:19:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:19:32,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:32,729 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] [2021-01-07 05:19:32,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:32,938 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1604725579, now seen corresponding path program 1 times [2021-01-07 05:19:32,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:32,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848891210] [2021-01-07 05:19:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:33,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848891210] [2021-01-07 05:19:33,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98791143] [2021-01-07 05:19:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:33,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjunts are in the unsatisfiable core [2021-01-07 05:19:33,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:33,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:33,288 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,292 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,292 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:33,374 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,374 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 [2021-01-07 05:19:33,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:33,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-01-07 05:19:33,426 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 [2021-01-07 05:19:33,427 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,445 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 [2021-01-07 05:19:33,445 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,460 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2021-01-07 05:19:33,579 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_44|, |v_#memory_$Pointer$.offset_35|]} [2021-01-07 05:19:33,583 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 [2021-01-07 05:19:33,584 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:33,613 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 31 treesize of output 15 [2021-01-07 05:19:33,619 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:33,641 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-07 05:19:33,642 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,655 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,655 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:39 [2021-01-07 05:19:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:33,717 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 55 treesize of output 19 [2021-01-07 05:19:33,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,739 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 80 treesize of output 62 [2021-01-07 05:19:33,741 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:33,769 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,769 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 66 treesize of output 68 [2021-01-07 05:19:33,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-07 05:19:33,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:19:33,773 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,788 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,788 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:75 [2021-01-07 05:19:33,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:33,970 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,970 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 65 treesize of output 46 [2021-01-07 05:19:33,972 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:33,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:33,994 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2021-01-07 05:19:33,996 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:34,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:34,007 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:34,008 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:20 [2021-01-07 05:19:34,096 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 [2021-01-07 05:19:34,097 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:34,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:34,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:34,112 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:10 [2021-01-07 05:19:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:34,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:34,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2021-01-07 05:19:34,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236353280] [2021-01-07 05:19:34,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:19:34,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:19:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:19:34,157 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 29 states. [2021-01-07 05:19:35,422 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2021-01-07 05:19:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:36,763 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2021-01-07 05:19:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:19:36,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2021-01-07 05:19:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:36,765 INFO L225 Difference]: With dead ends: 213 [2021-01-07 05:19:36,765 INFO L226 Difference]: Without dead ends: 213 [2021-01-07 05:19:36,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:19:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-07 05:19:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 131. [2021-01-07 05:19:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-01-07 05:19:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2021-01-07 05:19:36,770 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 33 [2021-01-07 05:19:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:36,771 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2021-01-07 05:19:36,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:19:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2021-01-07 05:19:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:19:36,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:36,772 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] [2021-01-07 05:19:36,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-07 05:19:36,983 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1604673024, now seen corresponding path program 1 times [2021-01-07 05:19:36,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:36,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111972471] [2021-01-07 05:19:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:37,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111972471] [2021-01-07 05:19:37,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941529126] [2021-01-07 05:19:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:37,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-07 05:19:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:37,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:37,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,292 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,292 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:37,344 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_44|], 1=[|v_#valid_72|]} [2021-01-07 05:19:37,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:37,348 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,366 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,366 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 [2021-01-07 05:19:37,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:37,369 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,377 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2021-01-07 05:19:37,411 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 [2021-01-07 05:19:37,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,428 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 [2021-01-07 05:19:37,429 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,442 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,443 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2021-01-07 05:19:37,552 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_47|]} [2021-01-07 05:19:37,557 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 [2021-01-07 05:19:37,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:37,587 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 23 treesize of output 11 [2021-01-07 05:19:37,588 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,627 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:19:37,628 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 40 treesize of output 28 [2021-01-07 05:19:37,629 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,645 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,645 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:37 [2021-01-07 05:19:37,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:37,700 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 55 treesize of output 19 [2021-01-07 05:19:37,701 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,725 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 73 treesize of output 59 [2021-01-07 05:19:37,726 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,763 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,763 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 75 treesize of output 93 [2021-01-07 05:19:37,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:19:37,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:19:37,769 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,784 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:77 [2021-01-07 05:19:37,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:37,957 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 63 [2021-01-07 05:19:37,959 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:37,980 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2021-01-07 05:19:37,983 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:37,995 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:37,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:16 [2021-01-07 05:19:38,069 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 [2021-01-07 05:19:38,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:38,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:38,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:38,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-01-07 05:19:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:38,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:38,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2021-01-07 05:19:38,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871776126] [2021-01-07 05:19:38,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:19:38,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:19:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:19:38,119 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 28 states. [2021-01-07 05:19:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:39,965 INFO L93 Difference]: Finished difference Result 187 states and 205 transitions. [2021-01-07 05:19:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:19:39,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2021-01-07 05:19:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:39,967 INFO L225 Difference]: With dead ends: 187 [2021-01-07 05:19:39,967 INFO L226 Difference]: Without dead ends: 187 [2021-01-07 05:19:39,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1391, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:19:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-01-07 05:19:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2021-01-07 05:19:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:19:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2021-01-07 05:19:39,970 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 33 [2021-01-07 05:19:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:39,971 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2021-01-07 05:19:39,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:19:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2021-01-07 05:19:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:19:39,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:39,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:40,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:19:40,173 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash -613917144, now seen corresponding path program 2 times [2021-01-07 05:19:40,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:40,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077211191] [2021-01-07 05:19:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:40,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077211191] [2021-01-07 05:19:40,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047134398] [2021-01-07 05:19:40,400 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:40,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:19:40,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:19:40,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-07 05:19:40,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:40,496 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:40,497 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,501 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:40,553 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 [2021-01-07 05:19:40,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,568 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:19:40,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:19:40,613 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,614 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:19:40,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:40,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2021-01-07 05:19:40,668 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_49|], 2=[|v_#memory_int_40|]} [2021-01-07 05:19:40,672 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 [2021-01-07 05:19:40,673 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,710 INFO L625 ElimStorePlain]: treesize reduction 5, result has 92.2 percent of original size [2021-01-07 05:19:40,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:40,715 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 [2021-01-07 05:19:40,716 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,733 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:43 [2021-01-07 05:19:40,778 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-01-07 05:19:40,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:25 [2021-01-07 05:19:40,855 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 [2021-01-07 05:19:40,857 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,877 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2021-01-07 05:19:40,923 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,923 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 [2021-01-07 05:19:40,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:19:40,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:40,927 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:40,938 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,939 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2021-01-07 05:19:40,975 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_50|], 6=[|v_#memory_int_42|]} [2021-01-07 05:19:40,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:19:40,980 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:40,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:19:41,002 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:19:41,003 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,017 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,017 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2021-01-07 05:19:41,061 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2021-01-07 05:19:41,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,074 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:41,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2021-01-07 05:19:41,181 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 [2021-01-07 05:19:41,182 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:41,196 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2021-01-07 05:19:41,258 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:19:41,258 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2021-01-07 05:19:41,260 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,274 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. [2021-01-07 05:19:41,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:37 [2021-01-07 05:19:41,400 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 [2021-01-07 05:19:41,402 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:41,410 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:41,410 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2021-01-07 05:19:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:41,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:41,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-01-07 05:19:41,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156437866] [2021-01-07 05:19:41,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:19:41,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:19:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:19:41,426 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 30 states. [2021-01-07 05:19:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:19:47,427 INFO L93 Difference]: Finished difference Result 257 states and 279 transitions. [2021-01-07 05:19:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-07 05:19:47,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2021-01-07 05:19:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:19:47,429 INFO L225 Difference]: With dead ends: 257 [2021-01-07 05:19:47,429 INFO L226 Difference]: Without dead ends: 257 [2021-01-07 05:19:47,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=2458, Unknown=0, NotChecked=0, Total=2970 [2021-01-07 05:19:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-01-07 05:19:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 143. [2021-01-07 05:19:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-07 05:19:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2021-01-07 05:19:47,435 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 36 [2021-01-07 05:19:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:19:47,435 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2021-01-07 05:19:47,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:19:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2021-01-07 05:19:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:19:47,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:19:47,436 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:19:47,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 05:19:47,648 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:19:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:19:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 345872496, now seen corresponding path program 1 times [2021-01-07 05:19:47,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:19:47,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222604585] [2021-01-07 05:19:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:19:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:47,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222604585] [2021-01-07 05:19:47,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666425498] [2021-01-07 05:19:47,930 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:19:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:19:47,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-07 05:19:48,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:19:48,009 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:19:48,009 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,014 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,014 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:19:48,077 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:19:48,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:48,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,093 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-07 05:19:48,131 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 [2021-01-07 05:19:48,132 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,144 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2021-01-07 05:19:48,268 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:19:48,269 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 46 treesize of output 32 [2021-01-07 05:19:48,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,281 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2021-01-07 05:19:48,342 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2021-01-07 05:19:48,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:19:48,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:19:48,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,362 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:58 [2021-01-07 05:19:48,423 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,423 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 54 treesize of output 69 [2021-01-07 05:19:48,426 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,443 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,443 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:58 [2021-01-07 05:19:48,656 INFO L348 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2021-01-07 05:19:48,657 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 83 [2021-01-07 05:19:48,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:19:48,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:19:48,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:19:48,664 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,681 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. [2021-01-07 05:19:48,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:64 [2021-01-07 05:19:48,769 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,770 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 140 [2021-01-07 05:19:48,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:19:48,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:19:48,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:19:48,788 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:19:48,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:48,806 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:48,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:122, output treesize:106 [2021-01-07 05:19:49,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:19:49,023 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:49,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 83 [2021-01-07 05:19:49,026 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:19:49,027 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:19:49,033 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:49,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:19:49,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:19:49,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:121, output treesize:28 [2021-01-07 05:19:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:19:49,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:19:49,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2021-01-07 05:19:49,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870287269] [2021-01-07 05:19:49,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:19:49,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:19:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:19:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:19:49,168 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand 33 states. [2021-01-07 05:20:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:03,287 INFO L93 Difference]: Finished difference Result 276 states and 309 transitions. [2021-01-07 05:20:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-07 05:20:03,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2021-01-07 05:20:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:03,290 INFO L225 Difference]: With dead ends: 276 [2021-01-07 05:20:03,290 INFO L226 Difference]: Without dead ends: 276 [2021-01-07 05:20:03,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=622, Invalid=3159, Unknown=1, NotChecked=0, Total=3782 [2021-01-07 05:20:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-07 05:20:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 160. [2021-01-07 05:20:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2021-01-07 05:20:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2021-01-07 05:20:03,298 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 36 [2021-01-07 05:20:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:03,298 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2021-01-07 05:20:03,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:20:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2021-01-07 05:20:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:20:03,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:03,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:03,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:03,513 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 345872497, now seen corresponding path program 1 times [2021-01-07 05:20:03,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:03,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039320141] [2021-01-07 05:20:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:03,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039320141] [2021-01-07 05:20:03,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997143217] [2021-01-07 05:20:03,898 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:03,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-07 05:20:03,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:03,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:03,984 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:03,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:03,988 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:03,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:20:04,052 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,053 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:20:04,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:04,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,070 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2021-01-07 05:20:04,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:20:04,112 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,133 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 [2021-01-07 05:20:04,134 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,149 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,150 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2021-01-07 05:20:04,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:04,267 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 25 treesize of output 13 [2021-01-07 05:20:04,269 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,311 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:20:04,311 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 46 treesize of output 32 [2021-01-07 05:20:04,313 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,327 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,327 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:39 [2021-01-07 05:20:04,382 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,383 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 [2021-01-07 05:20:04,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:04,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:04,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,401 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,401 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2021-01-07 05:20:04,450 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 23 treesize of output 22 [2021-01-07 05:20:04,451 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,479 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 23 treesize of output 22 [2021-01-07 05:20:04,480 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,504 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,504 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:56 [2021-01-07 05:20:04,684 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_59|]} [2021-01-07 05:20:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:04,690 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 25 treesize of output 13 [2021-01-07 05:20:04,691 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,773 INFO L348 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2021-01-07 05:20:04,773 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 80 [2021-01-07 05:20:04,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:04,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:04,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:04,780 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,798 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. [2021-01-07 05:20:04,798 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:68 [2021-01-07 05:20:04,860 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|], 6=[|v_#memory_$Pointer$.base_60|]} [2021-01-07 05:20:04,865 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 47 treesize of output 34 [2021-01-07 05:20:04,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:04,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,943 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:04,944 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 146 [2021-01-07 05:20:04,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:20:04,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:04,955 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:20:04,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:20:04,958 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:20:05,017 INFO L625 ElimStorePlain]: treesize reduction 223, result has 34.8 percent of original size [2021-01-07 05:20:05,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:05,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:119 [2021-01-07 05:20:05,286 INFO L443 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2021-01-07 05:20:05,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:05,292 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 10 [2021-01-07 05:20:05,293 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:05,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:05,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:05,364 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:05,364 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 115 [2021-01-07 05:20:05,367 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:20:05,368 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:20:05,369 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:05,370 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:20:05,371 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:05,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:05,387 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:05,387 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:143, output treesize:9 [2021-01-07 05:20:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:05,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:05,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2021-01-07 05:20:05,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342822950] [2021-01-07 05:20:05,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 05:20:05,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 05:20:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:20:05,485 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand 34 states. [2021-01-07 05:20:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:12,641 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2021-01-07 05:20:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-07 05:20:12,642 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2021-01-07 05:20:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:12,644 INFO L225 Difference]: With dead ends: 312 [2021-01-07 05:20:12,644 INFO L226 Difference]: Without dead ends: 312 [2021-01-07 05:20:12,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=614, Invalid=3808, Unknown=0, NotChecked=0, Total=4422 [2021-01-07 05:20:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-07 05:20:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 159. [2021-01-07 05:20:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2021-01-07 05:20:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2021-01-07 05:20:12,650 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 36 [2021-01-07 05:20:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:12,650 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2021-01-07 05:20:12,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-07 05:20:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2021-01-07 05:20:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:20:12,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:12,651 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:12,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:20:12,867 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -958911192, now seen corresponding path program 3 times [2021-01-07 05:20:12,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:12,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472686712] [2021-01-07 05:20:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:13,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472686712] [2021-01-07 05:20:13,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323652168] [2021-01-07 05:20:13,150 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:13,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:20:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:20:13,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-07 05:20:13,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:13,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:13,236 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,241 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,241 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:20:13,315 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,316 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:20:13,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:13,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,333 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,333 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-07 05:20:13,373 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 [2021-01-07 05:20:13,374 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,388 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2021-01-07 05:20:13,515 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:20:13,516 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 40 treesize of output 28 [2021-01-07 05:20:13,517 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,529 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,529 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:25 [2021-01-07 05:20:13,591 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,592 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2021-01-07 05:20:13,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:13,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:13,597 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,611 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,611 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:50 [2021-01-07 05:20:13,676 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,677 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 46 treesize of output 61 [2021-01-07 05:20:13,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,697 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,698 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:56 [2021-01-07 05:20:13,939 INFO L348 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2021-01-07 05:20:13,939 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 77 [2021-01-07 05:20:13,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:13,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:13,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:20:13,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:20:13,946 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:13,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:13,962 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. [2021-01-07 05:20:13,962 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:56 [2021-01-07 05:20:14,051 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:14,052 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 130 [2021-01-07 05:20:14,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:20:14,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:14,057 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:20:14,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:20:14,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:20:14,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:14,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:14,061 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:20:14,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:14,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:20:14,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:20:14,072 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2021-01-07 05:20:14,143 INFO L625 ElimStorePlain]: treesize reduction 288, result has 24.2 percent of original size [2021-01-07 05:20:14,144 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:14,145 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:106, output treesize:92 [2021-01-07 05:20:14,301 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:14,302 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2021-01-07 05:20:14,305 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:20:14,306 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:14,308 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:14,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:14,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:14,320 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2021-01-07 05:20:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:14,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:14,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2021-01-07 05:20:14,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250372484] [2021-01-07 05:20:14,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:20:14,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:20:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:20:14,448 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 32 states. [2021-01-07 05:20:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,823 INFO L93 Difference]: Finished difference Result 295 states and 333 transitions. [2021-01-07 05:20:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:20:28,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2021-01-07 05:20:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,826 INFO L225 Difference]: With dead ends: 295 [2021-01-07 05:20:28,826 INFO L226 Difference]: Without dead ends: 295 [2021-01-07 05:20:28,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=542, Invalid=2214, Unknown=0, NotChecked=0, Total=2756 [2021-01-07 05:20:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-01-07 05:20:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-01-07 05:20:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:20:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2021-01-07 05:20:28,833 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 36 [2021-01-07 05:20:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,833 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2021-01-07 05:20:28,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:20:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2021-01-07 05:20:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:20:28,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,834 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:29,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:20:29,048 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash -958911191, now seen corresponding path program 2 times [2021-01-07 05:20:29,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:29,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142446823] [2021-01-07 05:20:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142446823] [2021-01-07 05:20:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787694453] [2021-01-07 05:20:29,501 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:29,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:20:29,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:20:29,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-07 05:20:29,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:29,597 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:29,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,603 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,603 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:20:29,676 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_86|]} [2021-01-07 05:20:29,681 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:29,681 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,714 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:20:29,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:29,719 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2021-01-07 05:20:29,806 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 [2021-01-07 05:20:29,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,834 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 [2021-01-07 05:20:29,835 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:29,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:29,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2021-01-07 05:20:29,993 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 23 treesize of output 11 [2021-01-07 05:20:29,994 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,019 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 23 treesize of output 11 [2021-01-07 05:20:30,020 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,035 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,035 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:37 [2021-01-07 05:20:30,044 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_46|], 3=[|v_#valid_87|]} [2021-01-07 05:20:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:30,049 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-01-07 05:20:30,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,088 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,088 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 [2021-01-07 05:20:30,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:30,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:30,098 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,113 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,113 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2021-01-07 05:20:30,172 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 21 treesize of output 20 [2021-01-07 05:20:30,174 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,215 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 21 treesize of output 20 [2021-01-07 05:20:30,216 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,241 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,241 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2021-01-07 05:20:30,450 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|], 6=[|v_#memory_$Pointer$.base_69|]} [2021-01-07 05:20:30,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:30,457 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 23 treesize of output 11 [2021-01-07 05:20:30,458 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,540 INFO L348 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2021-01-07 05:20:30,540 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 77 [2021-01-07 05:20:30,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:30,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:30,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:30,547 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,565 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. [2021-01-07 05:20:30,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:58 [2021-01-07 05:20:30,621 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.base_70|]} [2021-01-07 05:20:30,626 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 41 treesize of output 30 [2021-01-07 05:20:30,627 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,708 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:30,709 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 139 [2021-01-07 05:20:30,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:20:30,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:30,714 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:20:30,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:30,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:30,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:20:30,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:20:30,718 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:20:30,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:20:30,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:20:30,723 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:20:30,794 INFO L625 ElimStorePlain]: treesize reduction 225, result has 33.4 percent of original size [2021-01-07 05:20:30,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:30,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:141, output treesize:113 [2021-01-07 05:20:30,952 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2021-01-07 05:20:30,956 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 34 treesize of output 10 [2021-01-07 05:20:30,958 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:30,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:31,005 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:31,005 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2021-01-07 05:20:31,008 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:20:31,009 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:31,011 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:31,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:31,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:31,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:124, output treesize:18 [2021-01-07 05:20:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:31,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:31,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-01-07 05:20:31,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177302099] [2021-01-07 05:20:31,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 05:20:31,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 05:20:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2021-01-07 05:20:31,130 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 32 states. [2021-01-07 05:20:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:36,444 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2021-01-07 05:20:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:20:36,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2021-01-07 05:20:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:36,447 INFO L225 Difference]: With dead ends: 327 [2021-01-07 05:20:36,448 INFO L226 Difference]: Without dead ends: 327 [2021-01-07 05:20:36,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=448, Invalid=2414, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:20:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-01-07 05:20:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 168. [2021-01-07 05:20:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-07 05:20:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 194 transitions. [2021-01-07 05:20:36,456 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 194 transitions. Word has length 36 [2021-01-07 05:20:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:36,456 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 194 transitions. [2021-01-07 05:20:36,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-07 05:20:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2021-01-07 05:20:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:20:36,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:36,457 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:36,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:36,671 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1611486422, now seen corresponding path program 2 times [2021-01-07 05:20:36,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:36,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038465987] [2021-01-07 05:20:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:36,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038465987] [2021-01-07 05:20:36,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103278894] [2021-01-07 05:20:36,932 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:37,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:20:37,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:20:37,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:20:37,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:37,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:37,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:20:37,083 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 [2021-01-07 05:20:37,084 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,103 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:20:37,104 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:20:37,144 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,145 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 [2021-01-07 05:20:37,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:37,147 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2021-01-07 05:20:37,189 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_71|], 2=[|v_#memory_int_46|]} [2021-01-07 05:20:37,194 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 [2021-01-07 05:20:37,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:37,220 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 [2021-01-07 05:20:37,221 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,237 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,238 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2021-01-07 05:20:37,280 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 20 treesize of output 8 [2021-01-07 05:20:37,281 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,291 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,291 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2021-01-07 05:20:37,364 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 [2021-01-07 05:20:37,365 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,375 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,375 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-01-07 05:20:37,422 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,423 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:20:37,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:37,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:37,427 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,438 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,439 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2021-01-07 05:20:37,477 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_72|], 6=[|v_#memory_int_48|]} [2021-01-07 05:20:37,482 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:20:37,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:37,504 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 34 treesize of output 21 [2021-01-07 05:20:37,505 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,518 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,518 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2021-01-07 05:20:37,562 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-01-07 05:20:37,563 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:37,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2021-01-07 05:20:37,718 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2021-01-07 05:20:37,720 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,756 INFO L625 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2021-01-07 05:20:37,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:37,761 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:37,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:37 [2021-01-07 05:20:37,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:37,835 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:20:37,836 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 [2021-01-07 05:20:37,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,848 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:37,848 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2021-01-07 05:20:37,962 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 [2021-01-07 05:20:37,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:37,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:37,970 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-07 05:20:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:37,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:37,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-01-07 05:20:37,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814665023] [2021-01-07 05:20:37,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:20:37,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:20:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:20:37,981 INFO L87 Difference]: Start difference. First operand 168 states and 194 transitions. Second operand 30 states. [2021-01-07 05:20:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:39,860 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2021-01-07 05:20:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 05:20:39,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2021-01-07 05:20:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:39,862 INFO L225 Difference]: With dead ends: 238 [2021-01-07 05:20:39,863 INFO L226 Difference]: Without dead ends: 238 [2021-01-07 05:20:39,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:20:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-01-07 05:20:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 170. [2021-01-07 05:20:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2021-01-07 05:20:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2021-01-07 05:20:39,877 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 38 [2021-01-07 05:20:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:39,877 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2021-01-07 05:20:39,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:20:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2021-01-07 05:20:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:20:39,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:39,878 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:40,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:20:40,082 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:20:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1611433867, now seen corresponding path program 3 times [2021-01-07 05:20:40,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:40,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639435039] [2021-01-07 05:20:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:40,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639435039] [2021-01-07 05:20:40,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731431293] [2021-01-07 05:20:40,393 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:40,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:20:40,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:20:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2021-01-07 05:20:40,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:40,520 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:20:40,520 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:40,525 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:20:40,619 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:40,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:20:40,621 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,653 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-07 05:20:40,654 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2021-01-07 05:20:40,706 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:20:40,707 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:40,731 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:20:40,731 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:40,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,752 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:35 [2021-01-07 05:20:40,806 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 [2021-01-07 05:20:40,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:40,820 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,821 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2021-01-07 05:20:40,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:40,923 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 32 treesize of output 16 [2021-01-07 05:20:40,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,950 INFO L625 ElimStorePlain]: treesize reduction 5, result has 84.4 percent of original size [2021-01-07 05:20:40,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:40,951 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:27 [2021-01-07 05:20:41,067 INFO L348 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2021-01-07 05:20:41,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2021-01-07 05:20:41,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:41,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:41,073 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:41,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:40 [2021-01-07 05:20:41,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:41,187 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:41,188 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 1 case distinctions, treesize of input 21 treesize of output 36 [2021-01-07 05:20:41,190 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,247 INFO L625 ElimStorePlain]: treesize reduction 12, result has 81.5 percent of original size [2021-01-07 05:20:41,249 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:62 [2021-01-07 05:20:41,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-07 05:20:41,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:20:41,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:41,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:41,650 INFO L348 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2021-01-07 05:20:41,650 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 67 [2021-01-07 05:20:41,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:41,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:20:41,656 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,686 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:20:41,686 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 46 treesize of output 32 [2021-01-07 05:20:41,688 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,776 INFO L625 ElimStorePlain]: treesize reduction 8, result has 91.7 percent of original size [2021-01-07 05:20:41,778 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 2 xjuncts. [2021-01-07 05:20:41,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:88 [2021-01-07 05:20:41,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:41,867 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_77|], 6=[v_prenex_3]} [2021-01-07 05:20:41,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:41,896 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 47 treesize of output 65 [2021-01-07 05:20:41,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:20:41,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:20:41,899 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:41,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:41,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:41,985 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:41,986 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 120 [2021-01-07 05:20:41,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:20:41,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:41,991 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:20:41,991 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:20:41,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:20:41,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:20:41,996 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:20:42,107 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-01-07 05:20:42,107 INFO L625 ElimStorePlain]: treesize reduction 195, result has 42.1 percent of original size [2021-01-07 05:20:42,110 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-01-07 05:20:42,111 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:166, output treesize:142 [2021-01-07 05:20:42,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-07 05:20:42,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:42,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:42,399 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,400 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 35 [2021-01-07 05:20:42,401 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:42,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:42,459 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2021-01-07 05:20:42,462 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:20:42,466 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:42,473 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:42,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:42,509 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-01-07 05:20:42,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:150, output treesize:44 [2021-01-07 05:20:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:42,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:42,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-01-07 05:20:42,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875380805] [2021-01-07 05:20:42,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:20:42,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:20:42,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:20:42,652 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand 33 states. [2021-01-07 05:20:45,298 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2021-01-07 05:20:55,689 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2021-01-07 05:21:00,021 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2021-01-07 05:21:10,432 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2021-01-07 05:21:10,723 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-01-07 05:21:19,992 WARN L197 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-01-07 05:21:22,136 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2021-01-07 05:21:26,582 WARN L197 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2021-01-07 05:21:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:27,509 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2021-01-07 05:21:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:21:27,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2021-01-07 05:21:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:27,514 INFO L225 Difference]: With dead ends: 265 [2021-01-07 05:21:27,514 INFO L226 Difference]: Without dead ends: 265 [2021-01-07 05:21:27,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=592, Invalid=2479, Unknown=9, NotChecked=0, Total=3080 [2021-01-07 05:21:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-01-07 05:21:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 188. [2021-01-07 05:21:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 05:21:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2021-01-07 05:21:27,525 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 38 [2021-01-07 05:21:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:27,526 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2021-01-07 05:21:27,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:21:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2021-01-07 05:21:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:21:27,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:27,527 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:27,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:27,741 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1611433866, now seen corresponding path program 2 times [2021-01-07 05:21:27,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:27,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343815022] [2021-01-07 05:21:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:28,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343815022] [2021-01-07 05:21:28,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795650183] [2021-01-07 05:21:28,108 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:28,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:21:28,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:21:28,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-07 05:21:28,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:28,189 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:21:28,190 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:21:28,277 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,277 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:21:28,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:28,280 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,296 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2021-01-07 05:21:28,349 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 [2021-01-07 05:21:28,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,370 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 [2021-01-07 05:21:28,370 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,387 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2021-01-07 05:21:28,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:28,532 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 23 treesize of output 11 [2021-01-07 05:21:28,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,575 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:21:28,576 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 40 treesize of output 28 [2021-01-07 05:21:28,577 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,592 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,592 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:35 [2021-01-07 05:21:28,666 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,667 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 [2021-01-07 05:21:28,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:28,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:28,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,684 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2021-01-07 05:21:28,744 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 21 treesize of output 20 [2021-01-07 05:21:28,745 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:21:28,777 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:28,800 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:28,800 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:52 [2021-01-07 05:21:29,030 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_54|], 6=[|v_#memory_$Pointer$.base_81|]} [2021-01-07 05:21:29,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:29,035 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 23 treesize of output 11 [2021-01-07 05:21:29,036 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,120 INFO L348 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2021-01-07 05:21:29,120 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 74 [2021-01-07 05:21:29,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:21:29,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:21:29,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:21:29,126 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,144 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. [2021-01-07 05:21:29,145 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:58 [2021-01-07 05:21:29,208 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_82|]} [2021-01-07 05:21:29,212 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 41 treesize of output 30 [2021-01-07 05:21:29,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,294 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,294 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 136 [2021-01-07 05:21:29,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:21:29,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:21:29,302 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:21:29,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:21:29,304 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:21:29,368 INFO L625 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2021-01-07 05:21:29,371 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:29,371 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:131, output treesize:103 [2021-01-07 05:21:29,563 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2021-01-07 05:21:29,567 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 34 treesize of output 10 [2021-01-07 05:21:29,568 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,605 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,605 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2021-01-07 05:21:29,608 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:21:29,608 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:29,609 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:29,619 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:29,619 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:9 [2021-01-07 05:21:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:29,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:29,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-01-07 05:21:29,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262409938] [2021-01-07 05:21:29,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:21:29,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:21:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:21:29,705 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 33 states. [2021-01-07 05:21:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:34,290 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2021-01-07 05:21:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-07 05:21:34,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2021-01-07 05:21:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:34,293 INFO L225 Difference]: With dead ends: 305 [2021-01-07 05:21:34,293 INFO L226 Difference]: Without dead ends: 305 [2021-01-07 05:21:34,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=583, Invalid=3449, Unknown=0, NotChecked=0, Total=4032 [2021-01-07 05:21:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-01-07 05:21:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 188. [2021-01-07 05:21:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 05:21:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2021-01-07 05:21:34,300 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 38 [2021-01-07 05:21:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:34,300 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2021-01-07 05:21:34,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:21:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2021-01-07 05:21:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:21:34,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:34,301 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:34,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-07 05:21:34,516 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1623356274, now seen corresponding path program 1 times [2021-01-07 05:21:34,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:34,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142579124] [2021-01-07 05:21:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:34,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142579124] [2021-01-07 05:21:34,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387542977] [2021-01-07 05:21:34,781 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:34,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 43 conjunts are in the unsatisfiable core [2021-01-07 05:21:34,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:34,867 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:21:34,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:34,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:34,871 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:34,871 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:21:34,936 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 [2021-01-07 05:21:34,937 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:34,958 INFO L625 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2021-01-07 05:21:34,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:34,959 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-01-07 05:21:35,014 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:21:35,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:35,018 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,032 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2021-01-07 05:21:35,079 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_83|], 2=[|v_#memory_int_52|]} [2021-01-07 05:21:35,083 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 [2021-01-07 05:21:35,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:35,112 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 [2021-01-07 05:21:35,113 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:43 [2021-01-07 05:21:35,187 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-01-07 05:21:35,188 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,200 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,200 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:25 [2021-01-07 05:21:35,290 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 [2021-01-07 05:21:35,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,303 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2021-01-07 05:21:35,350 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,351 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 [2021-01-07 05:21:35,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:35,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:35,355 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,366 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,366 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2021-01-07 05:21:35,404 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_84|], 6=[|v_#memory_int_54|]} [2021-01-07 05:21:35,408 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:21:35,409 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:35,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:21:35,432 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,447 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,447 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2021-01-07 05:21:35,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2021-01-07 05:21:35,499 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,511 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:35,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2021-01-07 05:21:35,634 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 [2021-01-07 05:21:35,635 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,649 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:35,650 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2021-01-07 05:21:35,720 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:21:35,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2021-01-07 05:21:35,722 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,739 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. [2021-01-07 05:21:35,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:37 [2021-01-07 05:21:35,869 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 [2021-01-07 05:21:35,871 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:35,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:35,881 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2021-01-07 05:21:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:35,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:35,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-01-07 05:21:35,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095038135] [2021-01-07 05:21:35,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:21:35,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:21:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:21:35,895 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 30 states. [2021-01-07 05:21:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:45,106 INFO L93 Difference]: Finished difference Result 335 states and 372 transitions. [2021-01-07 05:21:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-07 05:21:45,107 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2021-01-07 05:21:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:45,109 INFO L225 Difference]: With dead ends: 335 [2021-01-07 05:21:45,109 INFO L226 Difference]: Without dead ends: 335 [2021-01-07 05:21:45,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=547, Invalid=2759, Unknown=0, NotChecked=0, Total=3306 [2021-01-07 05:21:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-01-07 05:21:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 190. [2021-01-07 05:21:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2021-01-07 05:21:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2021-01-07 05:21:45,115 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 38 [2021-01-07 05:21:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:45,115 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2021-01-07 05:21:45,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:21:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2021-01-07 05:21:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:21:45,116 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:45,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:45,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-07 05:21:45,330 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 196283846, now seen corresponding path program 1 times [2021-01-07 05:21:45,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:45,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337287888] [2021-01-07 05:21:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:45,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337287888] [2021-01-07 05:21:45,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592407598] [2021-01-07 05:21:45,542 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:45,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:21:45,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:45,629 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:21:45,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,634 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,634 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:21:45,700 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,700 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:21:45,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:45,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,711 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,711 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2021-01-07 05:21:45,739 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:21:45,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2021-01-07 05:21:45,888 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:21:45,889 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 45 treesize of output 31 [2021-01-07 05:21:45,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,900 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. [2021-01-07 05:21:45,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:24 [2021-01-07 05:21:45,945 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,946 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 46 treesize of output 64 [2021-01-07 05:21:45,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:21:45,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:21:45,949 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:45,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:45,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:45,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2021-01-07 05:21:46,129 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:46,130 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2021-01-07 05:21:46,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:21:46,132 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:21:46,133 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:46,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:21:46,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:46,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:46,150 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-07 05:21:46,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:11 [2021-01-07 05:21:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:21:46,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:46,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-01-07 05:21:46,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601455129] [2021-01-07 05:21:46,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:21:46,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:21:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:21:46,222 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand 25 states. [2021-01-07 05:21:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:59,773 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2021-01-07 05:21:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:21:59,773 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2021-01-07 05:21:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:59,774 INFO L225 Difference]: With dead ends: 230 [2021-01-07 05:21:59,774 INFO L226 Difference]: Without dead ends: 230 [2021-01-07 05:21:59,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=231, Invalid=1174, Unknown=1, NotChecked=0, Total=1406 [2021-01-07 05:21:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-01-07 05:21:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 197. [2021-01-07 05:21:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2021-01-07 05:21:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2021-01-07 05:21:59,779 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 39 [2021-01-07 05:21:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:59,780 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2021-01-07 05:21:59,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:21:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2021-01-07 05:21:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:21:59,781 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:59,781 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:59,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:59,996 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:21:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1498854142, now seen corresponding path program 1 times [2021-01-07 05:21:59,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:59,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178804223] [2021-01-07 05:21:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:22:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:22:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:00,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178804223] [2021-01-07 05:22:00,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94189095] [2021-01-07 05:22:00,222 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:22:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:22:00,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:22:00,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:22:00,301 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:22:00,302 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:22:00,377 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,377 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:22:00,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:00,380 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,389 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2021-01-07 05:22:00,423 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:22:00,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,437 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2021-01-07 05:22:00,576 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:22:00,576 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 45 treesize of output 31 [2021-01-07 05:22:00,578 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,590 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. [2021-01-07 05:22:00,590 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:24 [2021-01-07 05:22:00,643 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,644 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 46 treesize of output 64 [2021-01-07 05:22:00,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:22:00,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:00,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:00,660 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2021-01-07 05:22:00,815 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2021-01-07 05:22:00,817 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:00,818 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:00,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:00,821 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:22:00,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:00,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-07 05:22:00,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:11 [2021-01-07 05:22:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:22:00,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:22:00,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-01-07 05:22:00,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680631025] [2021-01-07 05:22:00,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:22:00,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:22:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:22:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:22:00,915 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand 25 states. [2021-01-07 05:22:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:22:16,750 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2021-01-07 05:22:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:22:16,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2021-01-07 05:22:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:22:16,752 INFO L225 Difference]: With dead ends: 234 [2021-01-07 05:22:16,752 INFO L226 Difference]: Without dead ends: 234 [2021-01-07 05:22:16,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=231, Invalid=1174, Unknown=1, NotChecked=0, Total=1406 [2021-01-07 05:22:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-01-07 05:22:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 193. [2021-01-07 05:22:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-07 05:22:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2021-01-07 05:22:16,757 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 39 [2021-01-07 05:22:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:22:16,758 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2021-01-07 05:22:16,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:22:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2021-01-07 05:22:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:22:16,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:22:16,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:22:16,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-07 05:22:16,973 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:22:16,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:22:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash -497174874, now seen corresponding path program 2 times [2021-01-07 05:22:16,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:22:16,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031089190] [2021-01-07 05:22:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:22:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:22:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:17,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031089190] [2021-01-07 05:22:17,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574150232] [2021-01-07 05:22:17,429 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:22:17,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:22:17,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:22:17,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 63 conjunts are in the unsatisfiable core [2021-01-07 05:22:17,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:22:17,514 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:22:17,515 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,520 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:22:17,608 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,609 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:22:17,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:17,612 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,628 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,628 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2021-01-07 05:22:17,687 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 [2021-01-07 05:22:17,688 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,714 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 [2021-01-07 05:22:17,715 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2021-01-07 05:22:17,927 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_57|], 2=[|v_#memory_$Pointer$.base_92|, |v_#memory_$Pointer$.offset_57|]} [2021-01-07 05:22:17,933 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 [2021-01-07 05:22:17,934 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:17,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:17,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:17,976 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 40 treesize of output 20 [2021-01-07 05:22:17,977 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,009 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-01-07 05:22:18,010 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,033 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:49 [2021-01-07 05:22:18,122 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,123 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 [2021-01-07 05:22:18,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:18,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:18,127 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,148 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2021-01-07 05:22:18,228 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:22:18,230 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,299 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2021-01-07 05:22:18,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:18,306 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 [2021-01-07 05:22:18,308 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,359 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,360 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 1 case distinctions, treesize of input 28 treesize of output 51 [2021-01-07 05:22:18,362 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,417 INFO L625 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2021-01-07 05:22:18,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,422 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:51 [2021-01-07 05:22:18,617 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|, |v_#memory_int_59|], 6=[|v_#memory_$Pointer$.base_94|]} [2021-01-07 05:22:18,642 INFO L348 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-01-07 05:22:18,642 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 102 treesize of output 78 [2021-01-07 05:22:18,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:18,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:18,646 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:18,708 INFO L625 ElimStorePlain]: treesize reduction 8, result has 92.5 percent of original size [2021-01-07 05:22:18,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:18,713 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 23 treesize of output 22 [2021-01-07 05:22:18,715 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:18,813 INFO L348 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2021-01-07 05:22:18,814 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 64 [2021-01-07 05:22:18,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:18,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:18,822 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,861 INFO L625 ElimStorePlain]: treesize reduction 8, result has 88.2 percent of original size [2021-01-07 05:22:18,862 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,862 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:131, output treesize:69 [2021-01-07 05:22:18,939 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_60|], 6=[|v_#memory_$Pointer$.base_95|, |v_#memory_int_60|]} [2021-01-07 05:22:18,960 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:18,960 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 234 treesize of output 206 [2021-01-07 05:22:18,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:18,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:18,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:19,049 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,050 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 172 [2021-01-07 05:22:19,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:19,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:19,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:19,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:19,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-07 05:22:19,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:19,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:22:19,059 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:22:19,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:19,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:22:19,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:19,063 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2021-01-07 05:22:19,211 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-01-07 05:22:19,212 INFO L625 ElimStorePlain]: treesize reduction 1444, result has 12.2 percent of original size [2021-01-07 05:22:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:19,220 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 98 treesize of output 43 [2021-01-07 05:22:19,224 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:19,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,253 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:19,253 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:237, output treesize:140 [2021-01-07 05:22:19,462 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2021-01-07 05:22:19,471 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,471 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 144 treesize of output 119 [2021-01-07 05:22:19,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:19,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:19,524 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 73 [2021-01-07 05:22:19,527 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:19,528 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:19,531 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:19,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,547 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:19,547 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:25 [2021-01-07 05:22:19,692 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 [2021-01-07 05:22:19,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:19,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:19,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:19,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2021-01-07 05:22:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:19,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:22:19,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2021-01-07 05:22:19,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333611143] [2021-01-07 05:22:19,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-01-07 05:22:19,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:22:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-01-07 05:22:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:22:19,719 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 36 states. [2021-01-07 05:22:22,160 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-01-07 05:22:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:22:23,768 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2021-01-07 05:22:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:22:23,769 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2021-01-07 05:22:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:22:23,771 INFO L225 Difference]: With dead ends: 277 [2021-01-07 05:22:23,771 INFO L226 Difference]: Without dead ends: 277 [2021-01-07 05:22:23,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=432, Invalid=2760, Unknown=0, NotChecked=0, Total=3192 [2021-01-07 05:22:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-07 05:22:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2021-01-07 05:22:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2021-01-07 05:22:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 234 transitions. [2021-01-07 05:22:23,776 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 234 transitions. Word has length 40 [2021-01-07 05:22:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:22:23,777 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 234 transitions. [2021-01-07 05:22:23,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2021-01-07 05:22:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 234 transitions. [2021-01-07 05:22:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:22:23,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:22:23,778 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:22:23,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:22:23,992 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:22:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:22:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 391065438, now seen corresponding path program 4 times [2021-01-07 05:22:23,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:22:23,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855246656] [2021-01-07 05:22:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:22:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:22:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:24,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855246656] [2021-01-07 05:22:24,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145455244] [2021-01-07 05:22:24,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:22:24,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:22:24,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:22:24,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 64 conjunts are in the unsatisfiable core [2021-01-07 05:22:24,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:22:24,611 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:22:24,612 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:24,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:22:24,715 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:24,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:22:24,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:24,719 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:24,731 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-07 05:22:24,777 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:22:24,778 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,816 INFO L625 ElimStorePlain]: treesize reduction 5, result has 90.2 percent of original size [2021-01-07 05:22:24,820 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 [2021-01-07 05:22:24,821 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:24,840 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:24,840 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:42 [2021-01-07 05:22:24,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:24,995 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 34 treesize of output 16 [2021-01-07 05:22:24,996 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,051 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:22:25,051 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 46 treesize of output 32 [2021-01-07 05:22:25,053 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,067 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,067 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:42 [2021-01-07 05:22:25,143 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,143 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2021-01-07 05:22:25,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:25,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:25,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,171 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:73 [2021-01-07 05:22:25,269 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,269 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 54 treesize of output 69 [2021-01-07 05:22:25,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,304 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 32 treesize of output 25 [2021-01-07 05:22:25,306 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,335 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,335 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:73 [2021-01-07 05:22:25,542 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_64|], 6=[|v_#memory_$Pointer$.base_99|]} [2021-01-07 05:22:25,569 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-07 05:22:25,569 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 119 treesize of output 93 [2021-01-07 05:22:25,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,573 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:25,628 INFO L625 ElimStorePlain]: treesize reduction 27, result has 80.6 percent of original size [2021-01-07 05:22:25,709 INFO L348 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2021-01-07 05:22:25,709 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 78 [2021-01-07 05:22:25,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:25,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:25,714 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:76 [2021-01-07 05:22:25,789 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_65|], 6=[|v_#memory_$Pointer$.base_100|]} [2021-01-07 05:22:25,813 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,813 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 181 treesize of output 163 [2021-01-07 05:22:25,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:25,819 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,907 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,907 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 179 [2021-01-07 05:22:25,911 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:25,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:25,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:25,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:25,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:25,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:25,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:22:25,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:25,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:25,923 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:25,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:25,948 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. [2021-01-07 05:22:25,949 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:207, output treesize:163 [2021-01-07 05:22:26,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-01-07 05:22:26,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:26,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:26,159 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. [2021-01-07 05:22:26,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:170, output treesize:163 [2021-01-07 05:22:26,183 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:26,184 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 146 treesize of output 117 [2021-01-07 05:22:26,186 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:26,188 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:26,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:26,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:26,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:118 [2021-01-07 05:22:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:26,660 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:26,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 118 [2021-01-07 05:22:26,664 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:22:26,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:26,665 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:26,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:26,667 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:26,669 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:26,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:26,691 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:26,692 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:127, output treesize:28 [2021-01-07 05:22:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:26,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:22:26,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2021-01-07 05:22:26,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438855419] [2021-01-07 05:22:26,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:22:26,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:22:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:22:26,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:22:26,874 INFO L87 Difference]: Start difference. First operand 205 states and 234 transitions. Second operand 39 states. [2021-01-07 05:22:42,508 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2021-01-07 05:22:47,961 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2021-01-07 05:22:48,345 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2021-01-07 05:22:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:22:50,512 INFO L93 Difference]: Finished difference Result 300 states and 335 transitions. [2021-01-07 05:22:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:22:50,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2021-01-07 05:22:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:22:50,514 INFO L225 Difference]: With dead ends: 300 [2021-01-07 05:22:50,514 INFO L226 Difference]: Without dead ends: 300 [2021-01-07 05:22:50,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=520, Invalid=3382, Unknown=4, NotChecked=0, Total=3906 [2021-01-07 05:22:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-07 05:22:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 208. [2021-01-07 05:22:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 05:22:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2021-01-07 05:22:50,522 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 40 [2021-01-07 05:22:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:22:50,522 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2021-01-07 05:22:50,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:22:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2021-01-07 05:22:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:22:50,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:22:50,523 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:22:50,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-07 05:22:50,726 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:22:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:22:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash 391065439, now seen corresponding path program 3 times [2021-01-07 05:22:50,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:22:50,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276231185] [2021-01-07 05:22:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:22:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:22:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:51,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276231185] [2021-01-07 05:22:51,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823936381] [2021-01-07 05:22:51,330 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:22:51,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:22:51,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:22:51,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjunts are in the unsatisfiable core [2021-01-07 05:22:51,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:22:51,433 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:22:51,433 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,438 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,438 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:22:51,513 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_47|], 3=[|v_#valid_111|]} [2021-01-07 05:22:51,516 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:22:51,517 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,553 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:22:51,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:51,561 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,574 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2021-01-07 05:22:51,641 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 [2021-01-07 05:22:51,642 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,665 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 [2021-01-07 05:22:51,666 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,685 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2021-01-07 05:22:51,745 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 [2021-01-07 05:22:51,746 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,761 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,761 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2021-01-07 05:22:51,883 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 49 treesize of output 25 [2021-01-07 05:22:51,884 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:51,899 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:33 [2021-01-07 05:22:51,950 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_48|], 3=[|v_#valid_112|]} [2021-01-07 05:22:51,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:51,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2021-01-07 05:22:51,957 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:51,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,002 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,003 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 20 treesize of output 30 [2021-01-07 05:22:52,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:52,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:52,007 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,028 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2021-01-07 05:22:52,103 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_67|], 2=[|v_#memory_$Pointer$.base_103|]} [2021-01-07 05:22:52,107 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:22:52,108 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:52,152 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,152 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 46 treesize of output 49 [2021-01-07 05:22:52,154 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,196 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2021-01-07 05:22:52,197 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,198 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:59 [2021-01-07 05:22:52,429 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_68|], 5=[|v_#memory_$Pointer$.base_104|]} [2021-01-07 05:22:52,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:52,434 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 15 [2021-01-07 05:22:52,435 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,518 INFO L348 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2021-01-07 05:22:52,518 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 70 [2021-01-07 05:22:52,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:52,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:52,523 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,556 INFO L625 ElimStorePlain]: treesize reduction 8, result has 86.7 percent of original size [2021-01-07 05:22:52,557 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,557 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:52 [2021-01-07 05:22:52,618 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 5=[|v_#memory_$Pointer$.base_105|]} [2021-01-07 05:22:52,622 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 41 treesize of output 32 [2021-01-07 05:22:52,624 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,694 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:52,694 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 128 [2021-01-07 05:22:52,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:22:52,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:52,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:52,709 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:52,751 INFO L625 ElimStorePlain]: treesize reduction 8, result has 92.5 percent of original size [2021-01-07 05:22:52,752 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. [2021-01-07 05:22:52,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:99 [2021-01-07 05:22:53,249 INFO L443 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2021-01-07 05:22:53,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:53,253 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 10 [2021-01-07 05:22:53,254 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:53,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:53,365 INFO L348 Elim1Store]: treesize reduction 14, result has 81.8 percent of original size [2021-01-07 05:22:53,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 100 [2021-01-07 05:22:53,369 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,370 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,371 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,372 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,373 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,375 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,375 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,376 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,377 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:22:53,379 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,380 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,381 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,382 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,383 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:22:53,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,385 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,386 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:53,388 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,389 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,390 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,394 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,397 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,398 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:53,400 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,401 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,401 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,406 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,408 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:53,410 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,411 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,413 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:53,413 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,414 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:22:53,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,416 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,417 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:53,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,420 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,421 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,424 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:53,427 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,428 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:53,430 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:53,431 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,432 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:22:53,436 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:53,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:53,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:53,442 INFO L547 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:53,479 INFO L625 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2021-01-07 05:22:53,482 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:53,482 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:136, output treesize:23 [2021-01-07 05:22:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:53,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:22:53,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2021-01-07 05:22:53,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413528449] [2021-01-07 05:22:53,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:22:53,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:22:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:22:53,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:22:53,647 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand 39 states. [2021-01-07 05:23:01,220 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56