/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/forester-heap/sll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 17:17:58,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 17:17:58,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 17:17:58,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 17:17:58,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 17:17:58,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 17:17:58,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 17:17:58,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 17:17:59,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 17:17:59,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 17:17:59,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 17:17:59,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 17:17:59,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 17:17:59,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 17:17:59,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 17:17:59,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 17:17:59,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 17:17:59,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 17:17:59,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 17:17:59,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 17:17:59,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 17:17:59,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 17:17:59,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 17:17:59,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 17:17:59,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 17:17:59,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 17:17:59,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 17:17:59,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 17:17:59,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 17:17:59,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 17:17:59,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 17:17:59,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 17:17:59,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 17:17:59,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 17:17:59,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 17:17:59,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 17:17:59,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 17:17:59,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 17:17:59,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 17:17:59,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 17:17:59,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 17:17:59,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-23 17:17:59,142 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 17:17:59,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 17:17:59,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 17:17:59,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 17:17:59,147 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 17:17:59,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 17:17:59,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 17:17:59,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 17:17:59,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 17:17:59,148 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 17:17:59,149 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 17:17:59,150 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-23 17:17:59,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 17:17:59,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 17:17:59,151 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 17:17:59,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 17:17:59,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 17:17:59,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 17:17:59,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:17:59,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 17:17:59,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 17:17:59,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 17:17:59,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 17:17:59,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 17:17:59,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 17:17:59,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 17:17:59,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 17:17:59,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 17:17:59,581 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 17:17:59,582 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 17:17:59,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-2.i [2020-12-23 17:17:59,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7116b0b64/6455c01791b84b09950c8dbfb5d73b44/FLAG493e0af26 [2020-12-23 17:18:00,446 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 17:18:00,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i [2020-12-23 17:18:00,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7116b0b64/6455c01791b84b09950c8dbfb5d73b44/FLAG493e0af26 [2020-12-23 17:18:00,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7116b0b64/6455c01791b84b09950c8dbfb5d73b44 [2020-12-23 17:18:00,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 17:18:00,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 17:18:00,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 17:18:00,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 17:18:00,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 17:18:00,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:18:00" (1/1) ... [2020-12-23 17:18:00,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb7c71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:00, skipping insertion in model container [2020-12-23 17:18:00,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:18:00" (1/1) ... [2020-12-23 17:18:00,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 17:18:00,815 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2020-12-23 17:18:01,190 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,209 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2020-12-23 17:18:01,211 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,213 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,214 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,218 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2020-12-23 17:18:01,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:18:01,240 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2020-12-23 17:18:01,279 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,281 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2020-12-23 17:18:01,282 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,283 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,285 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:18:01,287 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2020-12-23 17:18:01,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:18:01,359 INFO L208 MainTranslator]: Completed translation [2020-12-23 17:18:01,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01 WrapperNode [2020-12-23 17:18:01,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 17:18:01,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 17:18:01,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 17:18:01,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 17:18:01,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 17:18:01,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 17:18:01,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 17:18:01,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 17:18:01,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... [2020-12-23 17:18:01,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 17:18:01,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 17:18:01,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 17:18:01,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 17:18:01,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:18:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 17:18:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 17:18:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 17:18:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 17:18:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 17:18:02,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 17:18:02,197 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 17:18:02,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:18:02 BoogieIcfgContainer [2020-12-23 17:18:02,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 17:18:02,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 17:18:02,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 17:18:02,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 17:18:02,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 05:18:00" (1/3) ... [2020-12-23 17:18:02,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b9d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:18:02, skipping insertion in model container [2020-12-23 17:18:02,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:18:01" (2/3) ... [2020-12-23 17:18:02,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3b9d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:18:02, skipping insertion in model container [2020-12-23 17:18:02,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:18:02" (3/3) ... [2020-12-23 17:18:02,209 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2020-12-23 17:18:02,216 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 17:18:02,222 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2020-12-23 17:18:02,250 INFO L253 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2020-12-23 17:18:02,293 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 17:18:02,293 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 17:18:02,293 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 17:18:02,293 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 17:18:02,293 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 17:18:02,294 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 17:18:02,294 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 17:18:02,294 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 17:18:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2020-12-23 17:18:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:18:02,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:02,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:18:02,339 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-23 17:18:02,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:02,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926625308] [2020-12-23 17:18:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:02,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926625308] [2020-12-23 17:18:02,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:02,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:18:02,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316799505] [2020-12-23 17:18:02,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:18:02,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:18:02,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:18:02,615 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2020-12-23 17:18:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:02,775 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2020-12-23 17:18:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:18:02,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:18:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:02,787 INFO L225 Difference]: With dead ends: 135 [2020-12-23 17:18:02,788 INFO L226 Difference]: Without dead ends: 133 [2020-12-23 17:18:02,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:18:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-23 17:18:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2020-12-23 17:18:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-23 17:18:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2020-12-23 17:18:02,833 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 3 [2020-12-23 17:18:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:02,834 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2020-12-23 17:18:02,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:18:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2020-12-23 17:18:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:18:02,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:02,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:18:02,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 17:18:02,836 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-23 17:18:02,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:02,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519900993] [2020-12-23 17:18:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:02,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519900993] [2020-12-23 17:18:02,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:02,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:18:02,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961826777] [2020-12-23 17:18:02,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:18:02,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:18:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:18:02,922 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 3 states. [2020-12-23 17:18:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:03,015 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2020-12-23 17:18:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:18:03,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:18:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:03,017 INFO L225 Difference]: With dead ends: 139 [2020-12-23 17:18:03,018 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 17:18:03,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:18:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 17:18:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2020-12-23 17:18:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-12-23 17:18:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2020-12-23 17:18:03,032 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 3 [2020-12-23 17:18:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:03,032 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2020-12-23 17:18:03,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:18:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2020-12-23 17:18:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 17:18:03,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:03,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:03,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 17:18:03,034 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 59263630, now seen corresponding path program 1 times [2020-12-23 17:18:03,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:03,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085157598] [2020-12-23 17:18:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:03,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085157598] [2020-12-23 17:18:03,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:03,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:18:03,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099770913] [2020-12-23 17:18:03,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:18:03,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:18:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:18:03,107 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 4 states. [2020-12-23 17:18:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:03,284 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2020-12-23 17:18:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:18:03,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-23 17:18:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:03,286 INFO L225 Difference]: With dead ends: 117 [2020-12-23 17:18:03,286 INFO L226 Difference]: Without dead ends: 117 [2020-12-23 17:18:03,286 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 [2020-12-23 17:18:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-12-23 17:18:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2020-12-23 17:18:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-23 17:18:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2020-12-23 17:18:03,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 8 [2020-12-23 17:18:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:03,295 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2020-12-23 17:18:03,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:18:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2020-12-23 17:18:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 17:18:03,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:03,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:03,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 17:18:03,297 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash 59263631, now seen corresponding path program 1 times [2020-12-23 17:18:03,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:03,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423921741] [2020-12-23 17:18:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:03,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423921741] [2020-12-23 17:18:03,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:03,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:18:03,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381277877] [2020-12-23 17:18:03,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:18:03,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:03,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:18:03,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:18:03,409 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 4 states. [2020-12-23 17:18:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:03,604 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2020-12-23 17:18:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:18:03,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-23 17:18:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:03,606 INFO L225 Difference]: With dead ends: 180 [2020-12-23 17:18:03,606 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 17:18:03,606 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 [2020-12-23 17:18:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 17:18:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2020-12-23 17:18:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-23 17:18:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2020-12-23 17:18:03,616 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 8 [2020-12-23 17:18:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:03,616 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2020-12-23 17:18:03,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:18:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2020-12-23 17:18:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 17:18:03,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:03,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:03,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 17:18:03,618 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 292159341, now seen corresponding path program 1 times [2020-12-23 17:18:03,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:03,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583663244] [2020-12-23 17:18:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:03,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583663244] [2020-12-23 17:18:03,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:03,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:18:03,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226830957] [2020-12-23 17:18:03,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 17:18:03,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 17:18:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:18:03,679 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2020-12-23 17:18:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:03,984 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2020-12-23 17:18:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 17:18:03,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-23 17:18:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:03,986 INFO L225 Difference]: With dead ends: 196 [2020-12-23 17:18:03,987 INFO L226 Difference]: Without dead ends: 196 [2020-12-23 17:18:03,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:18:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-23 17:18:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 128. [2020-12-23 17:18:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-23 17:18:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2020-12-23 17:18:03,997 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 11 [2020-12-23 17:18:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:03,997 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2020-12-23 17:18:03,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 17:18:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2020-12-23 17:18:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 17:18:03,998 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:03,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:03,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 17:18:03,999 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 292159342, now seen corresponding path program 1 times [2020-12-23 17:18:04,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:04,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847802430] [2020-12-23 17:18:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:04,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847802430] [2020-12-23 17:18:04,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:04,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:18:04,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952694835] [2020-12-23 17:18:04,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 17:18:04,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:04,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 17:18:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:18:04,086 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 6 states. [2020-12-23 17:18:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:04,412 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2020-12-23 17:18:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:18:04,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-23 17:18:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:04,414 INFO L225 Difference]: With dead ends: 218 [2020-12-23 17:18:04,415 INFO L226 Difference]: Without dead ends: 218 [2020-12-23 17:18:04,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:18:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-12-23 17:18:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 114. [2020-12-23 17:18:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-23 17:18:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2020-12-23 17:18:04,422 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 11 [2020-12-23 17:18:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:04,423 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2020-12-23 17:18:04,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 17:18:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2020-12-23 17:18:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 17:18:04,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:04,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:04,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 17:18:04,424 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash 439328210, now seen corresponding path program 1 times [2020-12-23 17:18:04,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:04,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598514761] [2020-12-23 17:18:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:04,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598514761] [2020-12-23 17:18:04,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:04,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:18:04,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756459082] [2020-12-23 17:18:04,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:18:04,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:04,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:18:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:18:04,473 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 5 states. [2020-12-23 17:18:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:04,619 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2020-12-23 17:18:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:18:04,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-23 17:18:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:04,621 INFO L225 Difference]: With dead ends: 121 [2020-12-23 17:18:04,621 INFO L226 Difference]: Without dead ends: 121 [2020-12-23 17:18:04,621 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 [2020-12-23 17:18:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-23 17:18:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2020-12-23 17:18:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-23 17:18:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2020-12-23 17:18:04,626 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 12 [2020-12-23 17:18:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:04,627 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2020-12-23 17:18:04,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:18:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2020-12-23 17:18:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 17:18:04,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:04,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:04,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 17:18:04,628 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash 439328211, now seen corresponding path program 1 times [2020-12-23 17:18:04,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:04,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731635850] [2020-12-23 17:18:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:04,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731635850] [2020-12-23 17:18:04,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:04,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:18:04,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732519808] [2020-12-23 17:18:04,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:18:04,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:18:04,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:18:04,690 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 5 states. [2020-12-23 17:18:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:04,834 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2020-12-23 17:18:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:18:04,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-23 17:18:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:04,840 INFO L225 Difference]: With dead ends: 112 [2020-12-23 17:18:04,840 INFO L226 Difference]: Without dead ends: 112 [2020-12-23 17:18:04,841 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 [2020-12-23 17:18:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-23 17:18:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-23 17:18:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-23 17:18:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2020-12-23 17:18:04,854 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 12 [2020-12-23 17:18:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:04,855 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2020-12-23 17:18:04,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:18:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2020-12-23 17:18:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 17:18:04,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:04,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:04,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 17:18:04,858 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1592252621, now seen corresponding path program 1 times [2020-12-23 17:18:04,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:04,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943910152] [2020-12-23 17:18:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:04,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943910152] [2020-12-23 17:18:04,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:04,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 17:18:04,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285565896] [2020-12-23 17:18:04,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 17:18:04,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 17:18:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:18:04,957 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 6 states. [2020-12-23 17:18:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:05,164 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2020-12-23 17:18:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:18:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-23 17:18:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:05,165 INFO L225 Difference]: With dead ends: 212 [2020-12-23 17:18:05,166 INFO L226 Difference]: Without dead ends: 212 [2020-12-23 17:18:05,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:18:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-23 17:18:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 110. [2020-12-23 17:18:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-23 17:18:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2020-12-23 17:18:05,170 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 13 [2020-12-23 17:18:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:05,170 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2020-12-23 17:18:05,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 17:18:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2020-12-23 17:18:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:18:05,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:05,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:05,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 17:18:05,172 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1261387152, now seen corresponding path program 1 times [2020-12-23 17:18:05,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:05,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209158428] [2020-12-23 17:18:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:05,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209158428] [2020-12-23 17:18:05,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:05,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:18:05,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329408800] [2020-12-23 17:18:05,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:18:05,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:18:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:18:05,223 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 4 states. [2020-12-23 17:18:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:05,334 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2020-12-23 17:18:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:18:05,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 17:18:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:05,336 INFO L225 Difference]: With dead ends: 164 [2020-12-23 17:18:05,336 INFO L226 Difference]: Without dead ends: 164 [2020-12-23 17:18:05,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:18:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-23 17:18:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2020-12-23 17:18:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-23 17:18:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2020-12-23 17:18:05,340 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 15 [2020-12-23 17:18:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:05,341 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2020-12-23 17:18:05,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:18:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2020-12-23 17:18:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 17:18:05,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:05,342 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] [2020-12-23 17:18:05,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 17:18:05,342 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1274722949, now seen corresponding path program 1 times [2020-12-23 17:18:05,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:05,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814800660] [2020-12-23 17:18:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:05,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814800660] [2020-12-23 17:18:05,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:05,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:18:05,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119103767] [2020-12-23 17:18:05,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:18:05,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:18:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:18:05,387 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 5 states. [2020-12-23 17:18:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:05,487 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2020-12-23 17:18:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:18:05,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-23 17:18:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:05,489 INFO L225 Difference]: With dead ends: 106 [2020-12-23 17:18:05,489 INFO L226 Difference]: Without dead ends: 106 [2020-12-23 17:18:05,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:18:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-23 17:18:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-23 17:18:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-23 17:18:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2020-12-23 17:18:05,493 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 20 [2020-12-23 17:18:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:05,493 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2020-12-23 17:18:05,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:18:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2020-12-23 17:18:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 17:18:05,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:05,494 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] [2020-12-23 17:18:05,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 17:18:05,494 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1274755720, now seen corresponding path program 1 times [2020-12-23 17:18:05,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:05,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008396689] [2020-12-23 17:18:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:05,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008396689] [2020-12-23 17:18:05,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:05,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:18:05,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151451295] [2020-12-23 17:18:05,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:18:05,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:18:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:18:05,697 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 11 states. [2020-12-23 17:18:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:06,256 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2020-12-23 17:18:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 17:18:06,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-23 17:18:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:06,257 INFO L225 Difference]: With dead ends: 202 [2020-12-23 17:18:06,257 INFO L226 Difference]: Without dead ends: 202 [2020-12-23 17:18:06,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2020-12-23 17:18:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-23 17:18:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 118. [2020-12-23 17:18:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-23 17:18:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2020-12-23 17:18:06,262 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 20 [2020-12-23 17:18:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:06,263 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2020-12-23 17:18:06,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:18:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2020-12-23 17:18:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 17:18:06,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:06,264 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] [2020-12-23 17:18:06,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 17:18:06,264 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash -825413845, now seen corresponding path program 1 times [2020-12-23 17:18:06,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:06,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000388406] [2020-12-23 17:18:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:06,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000388406] [2020-12-23 17:18:06,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:06,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 17:18:06,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302091020] [2020-12-23 17:18:06,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:18:06,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:18:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:18:06,371 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 11 states. [2020-12-23 17:18:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:06,830 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2020-12-23 17:18:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 17:18:06,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-12-23 17:18:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:06,842 INFO L225 Difference]: With dead ends: 168 [2020-12-23 17:18:06,843 INFO L226 Difference]: Without dead ends: 168 [2020-12-23 17:18:06,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-12-23 17:18:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-23 17:18:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 124. [2020-12-23 17:18:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 17:18:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2020-12-23 17:18:06,849 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 23 [2020-12-23 17:18:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:06,849 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2020-12-23 17:18:06,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:18:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2020-12-23 17:18:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 17:18:06,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:06,853 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] [2020-12-23 17:18:06,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 17:18:06,855 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -825413844, now seen corresponding path program 1 times [2020-12-23 17:18:06,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:06,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589641721] [2020-12-23 17:18:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:07,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589641721] [2020-12-23 17:18:07,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:07,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 17:18:07,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073908729] [2020-12-23 17:18:07,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:18:07,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:18:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:18:07,055 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 11 states. [2020-12-23 17:18:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:07,633 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2020-12-23 17:18:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 17:18:07,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-12-23 17:18:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:07,635 INFO L225 Difference]: With dead ends: 200 [2020-12-23 17:18:07,635 INFO L226 Difference]: Without dead ends: 200 [2020-12-23 17:18:07,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-12-23 17:18:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-23 17:18:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2020-12-23 17:18:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 17:18:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2020-12-23 17:18:07,649 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 23 [2020-12-23 17:18:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:07,649 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2020-12-23 17:18:07,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:18:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2020-12-23 17:18:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 17:18:07,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:07,650 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] [2020-12-23 17:18:07,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 17:18:07,651 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1346248683, now seen corresponding path program 1 times [2020-12-23 17:18:07,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:07,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584404491] [2020-12-23 17:18:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:07,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584404491] [2020-12-23 17:18:07,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:18:07,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 17:18:07,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111537686] [2020-12-23 17:18:07,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 17:18:07,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 17:18:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-23 17:18:07,880 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2020-12-23 17:18:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:18:08,626 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2020-12-23 17:18:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 17:18:08,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 17:18:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:18:08,628 INFO L225 Difference]: With dead ends: 198 [2020-12-23 17:18:08,629 INFO L226 Difference]: Without dead ends: 198 [2020-12-23 17:18:08,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2020-12-23 17:18:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-12-23 17:18:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 125. [2020-12-23 17:18:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 17:18:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2020-12-23 17:18:08,639 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 25 [2020-12-23 17:18:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:18:08,642 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2020-12-23 17:18:08,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 17:18:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2020-12-23 17:18:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 17:18:08,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:18:08,645 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:18:08,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 17:18:08,646 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:18:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:18:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1122224389, now seen corresponding path program 1 times [2020-12-23 17:18:08,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:18:08,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097689411] [2020-12-23 17:18:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:18:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:09,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097689411] [2020-12-23 17:18:09,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044410448] [2020-12-23 17:18:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:18:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:18:09,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 17:18:09,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:18:09,223 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:18:09,227 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,236 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,236 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-23 17:18:09,364 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,364 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:18:09,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:09,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:09,399 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,408 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,408 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2020-12-23 17:18:09,431 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_23|]} [2020-12-23 17:18:09,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:18:09,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:18:09,458 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 25 treesize of output 13 [2020-12-23 17:18:09,461 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,490 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:34 [2020-12-23 17:18:09,555 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 17:18:09,556 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,567 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2020-12-23 17:18:09,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 23 treesize of output 22 [2020-12-23 17:18:09,645 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,656 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2020-12-23 17:18:09,705 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 0 case distinctions, treesize of input 32 treesize of output 25 [2020-12-23 17:18:09,708 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,719 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,719 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:31 [2020-12-23 17:18:09,765 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,766 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 [2020-12-23 17:18:09,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:09,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:09,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,794 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2020-12-23 17:18:09,854 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_22|], 6=[|v_#memory_int_26|]} [2020-12-23 17:18:09,861 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 11 treesize of output 7 [2020-12-23 17:18:09,862 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:18:09,880 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 25 [2020-12-23 17:18:09,887 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,900 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,904 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:34 [2020-12-23 17:18:09,965 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 16 treesize of output 8 [2020-12-23 17:18:09,968 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:09,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:09,989 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:18:09,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2020-12-23 17:18:10,097 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:10,098 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 32 treesize of output 68 [2020-12-23 17:18:10,101 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:10,143 INFO L625 ElimStorePlain]: treesize reduction 18, result has 72.3 percent of original size [2020-12-23 17:18:10,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:10,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:18:10,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:10,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:18:10,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:18:10,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:18:10,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:43 [2020-12-23 17:18:10,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:10,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:18:10,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:10,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:18:10,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:18:50,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:18:50,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:18:50,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:18:50,427 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 24 treesize of output 10 [2020-12-23 17:18:50,429 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:18:50,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:18:50,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:18:50,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2020-12-23 17:18:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:18:50,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:18:50,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2020-12-23 17:18:50,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613241348] [2020-12-23 17:18:50,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-23 17:18:50,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:18:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-23 17:18:50,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=646, Unknown=20, NotChecked=0, Total=812 [2020-12-23 17:18:50,447 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 29 states. [2020-12-23 17:18:57,617 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-23 17:19:01,727 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-12-23 17:19:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:02,166 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2020-12-23 17:19:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 17:19:02,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2020-12-23 17:19:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:02,168 INFO L225 Difference]: With dead ends: 249 [2020-12-23 17:19:02,168 INFO L226 Difference]: Without dead ends: 249 [2020-12-23 17:19:02,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=357, Invalid=1515, Unknown=20, NotChecked=0, Total=1892 [2020-12-23 17:19:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-23 17:19:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2020-12-23 17:19:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-23 17:19:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2020-12-23 17:19:02,174 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 28 [2020-12-23 17:19:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:02,174 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2020-12-23 17:19:02,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-23 17:19:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2020-12-23 17:19:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:19:02,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:02,176 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, 1, 1, 1] [2020-12-23 17:19:02,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 17:19:02,393 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:02,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1389894406, now seen corresponding path program 1 times [2020-12-23 17:19:02,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:02,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323692767] [2020-12-23 17:19:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:02,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323692767] [2020-12-23 17:19:02,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:19:02,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:19:02,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183726621] [2020-12-23 17:19:02,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:19:02,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:19:02,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:19:02,454 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 5 states. [2020-12-23 17:19:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:02,562 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-12-23 17:19:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:19:02,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-12-23 17:19:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:02,564 INFO L225 Difference]: With dead ends: 143 [2020-12-23 17:19:02,564 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 17:19:02,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:19:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 17:19:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 17:19:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 17:19:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2020-12-23 17:19:02,568 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 31 [2020-12-23 17:19:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:02,568 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2020-12-23 17:19:02,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:19:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2020-12-23 17:19:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:19:02,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:02,569 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:02,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 17:19:02,570 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1133577768, now seen corresponding path program 1 times [2020-12-23 17:19:02,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:02,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382500287] [2020-12-23 17:19:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:02,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382500287] [2020-12-23 17:19:02,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557294979] [2020-12-23 17:19:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:02,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 17:19:02,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:02,868 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:02,869 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:02,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:02,877 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:02,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-12-23 17:19:02,926 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:02,927 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:02,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:02,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:02,943 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:02,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:02,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:02,957 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2020-12-23 17:19:02,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:19:02,998 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,008 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2020-12-23 17:19:03,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:03,079 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 36 treesize of output 16 [2020-12-23 17:19:03,080 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2020-12-23 17:19:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:03,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 36 treesize of output 16 [2020-12-23 17:19:03,109 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,119 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2020-12-23 17:19:03,177 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-12-23 17:19:03,177 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 26 treesize of output 89 [2020-12-23 17:19:03,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:03,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:03,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:03,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:03,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:03,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:03,191 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,218 INFO L625 ElimStorePlain]: treesize reduction 8, result has 84.9 percent of original size [2020-12-23 17:19:03,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:45 [2020-12-23 17:19:03,281 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,281 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 36 treesize of output 51 [2020-12-23 17:19:03,284 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,326 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2020-12-23 17:19:03,328 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:57 [2020-12-23 17:19:03,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 1] term [2020-12-23 17:19:03,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-23 17:19:03,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:03,453 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_27|], 6=[v_prenex_1]} [2020-12-23 17:19:03,472 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,473 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 49 treesize of output 69 [2020-12-23 17:19:03,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 17:19:03,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:03,477 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,528 INFO L625 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size [2020-12-23 17:19:03,569 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,570 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 94 treesize of output 134 [2020-12-23 17:19:03,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:03,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:03,577 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:19:03,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:03,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:19:03,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:19:03,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,584 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:19:03,585 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:19:03,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:03,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:03,596 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:19:03,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:03,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:03,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:03,609 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2020-12-23 17:19:03,678 INFO L625 ElimStorePlain]: treesize reduction 591, result has 12.7 percent of original size [2020-12-23 17:19:03,680 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:19:03,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:168, output treesize:86 [2020-12-23 17:19:03,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:03,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:03,843 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 25 treesize of output 13 [2020-12-23 17:19:03,844 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:03,847 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:19:03,850 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:03,851 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 58 treesize of output 33 [2020-12-23 17:19:03,855 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:03,894 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.0 percent of original size [2020-12-23 17:19:03,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 17:19:03,902 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:40 [2020-12-23 17:19:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:03,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:04,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2020-12-23 17:19:04,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432686942] [2020-12-23 17:19:04,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 17:19:04,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 17:19:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2020-12-23 17:19:04,002 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 28 states. [2020-12-23 17:19:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:06,441 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2020-12-23 17:19:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 17:19:06,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2020-12-23 17:19:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:06,443 INFO L225 Difference]: With dead ends: 216 [2020-12-23 17:19:06,443 INFO L226 Difference]: Without dead ends: 216 [2020-12-23 17:19:06,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=1967, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 17:19:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-23 17:19:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 149. [2020-12-23 17:19:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 17:19:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2020-12-23 17:19:06,449 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 31 [2020-12-23 17:19:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:06,449 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2020-12-23 17:19:06,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 17:19:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2020-12-23 17:19:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:19:06,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:06,450 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:06,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 17:19:06,664 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1133577767, now seen corresponding path program 1 times [2020-12-23 17:19:06,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:06,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293626889] [2020-12-23 17:19:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:06,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293626889] [2020-12-23 17:19:06,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207754429] [2020-12-23 17:19:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:06,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2020-12-23 17:19:06,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:06,996 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:06,997 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,001 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:19:07,078 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,078 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:19:07,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:07,082 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,091 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:19:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:07,134 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,159 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-12-23 17:19:07,163 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:07,164 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,178 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,179 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:32 [2020-12-23 17:19:07,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:07,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:07,292 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,329 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:19:07,329 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 44 treesize of output 30 [2020-12-23 17:19:07,331 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,343 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,344 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:39 [2020-12-23 17:19:07,398 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:07,399 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:07,419 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,432 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2020-12-23 17:19:07,445 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_48|], 3=[|v_#valid_66|]} [2020-12-23 17:19:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:07,454 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 14 treesize of output 16 [2020-12-23 17:19:07,455 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,483 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,483 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:19:07,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:07,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:07,487 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,501 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2020-12-23 17:19:07,550 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:07,552 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,575 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:07,577 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,597 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:57 [2020-12-23 17:19:07,703 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_26|], 6=[|v_#memory_$Pointer$.base_32|]} [2020-12-23 17:19:07,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,721 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 186 treesize of output 182 [2020-12-23 17:19:07,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:07,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:07,782 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 132 treesize of output 164 [2020-12-23 17:19:07,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:19:07,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:07,790 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:19:07,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:19:07,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:19:07,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:07,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:07,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:07,798 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:19:07,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:07,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:07,806 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2020-12-23 17:19:07,881 INFO L625 ElimStorePlain]: treesize reduction 732, result has 10.6 percent of original size [2020-12-23 17:19:07,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:07,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:197, output treesize:87 [2020-12-23 17:19:08,003 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-23 17:19:08,006 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 83 treesize of output 59 [2020-12-23 17:19:08,007 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:08,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:08,032 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:08,032 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 68 treesize of output 43 [2020-12-23 17:19:08,037 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:08,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:08,052 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:08,053 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:20 [2020-12-23 17:19:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:08,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:08,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2020-12-23 17:19:08,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967790660] [2020-12-23 17:19:08,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-23 17:19:08,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-23 17:19:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2020-12-23 17:19:08,166 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 29 states. [2020-12-23 17:19:10,238 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2020-12-23 17:19:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:11,725 INFO L93 Difference]: Finished difference Result 299 states and 307 transitions. [2020-12-23 17:19:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 17:19:11,726 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2020-12-23 17:19:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:11,729 INFO L225 Difference]: With dead ends: 299 [2020-12-23 17:19:11,729 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 17:19:11,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=400, Invalid=2252, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 17:19:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 17:19:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 149. [2020-12-23 17:19:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 17:19:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2020-12-23 17:19:11,736 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 31 [2020-12-23 17:19:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:11,736 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2020-12-23 17:19:11,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-23 17:19:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2020-12-23 17:19:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:19:11,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:11,737 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:11,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:11,952 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash -157323754, now seen corresponding path program 1 times [2020-12-23 17:19:11,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:11,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261504231] [2020-12-23 17:19:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:12,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261504231] [2020-12-23 17:19:12,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960191273] [2020-12-23 17:19:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:12,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-23 17:19:12,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:12,306 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:12,306 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-12-23 17:19:12,360 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:12,361 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,377 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:12,378 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,391 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2020-12-23 17:19:12,426 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:19:12,428 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-12-23 17:19:12,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:12,513 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 29 treesize of output 13 [2020-12-23 17:19:12,514 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,524 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-12-23 17:19:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:12,542 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 29 treesize of output 13 [2020-12-23 17:19:12,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,552 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-12-23 17:19:12,615 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-12-23 17:19:12,615 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 26 treesize of output 89 [2020-12-23 17:19:12,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:12,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:12,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:12,632 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,664 INFO L625 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-12-23 17:19:12,665 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:12,665 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2020-12-23 17:19:12,733 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,733 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 29 treesize of output 48 [2020-12-23 17:19:12,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,738 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:12,789 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2020-12-23 17:19:12,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:12,793 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:57 [2020-12-23 17:19:12,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:12,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:12,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:12,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:12,963 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_5], 6=[|v_#memory_$Pointer$.base_37|]} [2020-12-23 17:19:12,981 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:12,982 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 57 treesize of output 73 [2020-12-23 17:19:12,984 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:19:12,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:12,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:13,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:13,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:13,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 131 [2020-12-23 17:19:13,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:13,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:19:13,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:13,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:13,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:13,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:13,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 1] term [2020-12-23 17:19:13,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:13,062 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:13,136 INFO L625 ElimStorePlain]: treesize reduction 54, result has 69.1 percent of original size [2020-12-23 17:19:13,139 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 17:19:13,139 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:149, output treesize:116 [2020-12-23 17:19:13,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:13,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:13,446 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 25 treesize of output 13 [2020-12-23 17:19:13,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:13,453 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 25 treesize of output 13 [2020-12-23 17:19:13,456 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:13,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:13,480 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 2 xjuncts. [2020-12-23 17:19:13,481 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:81, output treesize:45 [2020-12-23 17:19:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:13,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:13,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2020-12-23 17:19:13,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437552793] [2020-12-23 17:19:13,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 17:19:13,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 17:19:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2020-12-23 17:19:13,595 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 30 states. [2020-12-23 17:19:14,949 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2020-12-23 17:19:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:16,642 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2020-12-23 17:19:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-23 17:19:16,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2020-12-23 17:19:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:16,644 INFO L225 Difference]: With dead ends: 223 [2020-12-23 17:19:16,644 INFO L226 Difference]: Without dead ends: 223 [2020-12-23 17:19:16,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=606, Invalid=2474, Unknown=0, NotChecked=0, Total=3080 [2020-12-23 17:19:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-12-23 17:19:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2020-12-23 17:19:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-23 17:19:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-12-23 17:19:16,650 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 31 [2020-12-23 17:19:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:16,650 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-12-23 17:19:16,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 17:19:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-12-23 17:19:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:19:16,651 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:16,651 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:16,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:16,860 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -157323753, now seen corresponding path program 1 times [2020-12-23 17:19:16,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:16,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026112112] [2020-12-23 17:19:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:17,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026112112] [2020-12-23 17:19:17,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828246316] [2020-12-23 17:19:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:17,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 52 conjunts are in the unsatisfiable core [2020-12-23 17:19:17,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:17,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:17,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,255 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:19:17,323 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:19:17,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:17,326 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,335 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:19:17,376 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:17,377 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,403 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-12-23 17:19:17,406 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:17,407 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,420 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,420 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:32 [2020-12-23 17:19:17,580 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:19:17,581 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 44 treesize of output 30 [2020-12-23 17:19:17,582 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:17,609 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,623 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,623 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:39 [2020-12-23 17:19:17,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:17,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,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 [2020-12-23 17:19:17,716 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2020-12-23 17:19:17,733 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_49|], 3=[|v_#valid_71|]} [2020-12-23 17:19:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:17,738 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 14 treesize of output 16 [2020-12-23 17:19:17,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,767 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,767 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:19:17,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:17,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:17,771 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2020-12-23 17:19:17,843 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:17,844 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,869 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:17,870 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:17,892 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:17,892 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:57 [2020-12-23 17:19:18,025 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|], 6=[|v_#memory_$Pointer$.base_42|]} [2020-12-23 17:19:18,043 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 182 [2020-12-23 17:19:18,047 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:19:18,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:18,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:18,051 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-23 17:19:18,100 INFO L625 ElimStorePlain]: treesize reduction 295, result has 32.5 percent of original size [2020-12-23 17:19:18,145 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:18,145 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 132 treesize of output 164 [2020-12-23 17:19:18,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:18,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:19:18,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:18,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:19:18,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:18,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:18,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:19:18,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:18,157 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:19:18,158 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:19:18,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:18,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:19:18,161 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:19:18,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:18,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:18,166 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2020-12-23 17:19:18,227 INFO L625 ElimStorePlain]: treesize reduction 660, result has 11.6 percent of original size [2020-12-23 17:19:18,233 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:18,234 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:197, output treesize:87 [2020-12-23 17:19:18,370 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-23 17:19:18,373 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 83 treesize of output 59 [2020-12-23 17:19:18,374 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:18,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:18,398 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:18,398 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 68 treesize of output 43 [2020-12-23 17:19:18,404 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:18,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:18,420 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:18,421 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:20 [2020-12-23 17:19:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:18,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:18,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2020-12-23 17:19:18,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347046378] [2020-12-23 17:19:18,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-23 17:19:18,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-23 17:19:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2020-12-23 17:19:18,554 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 31 states. [2020-12-23 17:19:20,271 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2020-12-23 17:19:20,919 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2020-12-23 17:19:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:22,502 INFO L93 Difference]: Finished difference Result 308 states and 317 transitions. [2020-12-23 17:19:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 17:19:22,503 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2020-12-23 17:19:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:22,505 INFO L225 Difference]: With dead ends: 308 [2020-12-23 17:19:22,505 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 17:19:22,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=444, Invalid=2526, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 17:19:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 17:19:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 152. [2020-12-23 17:19:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-12-23 17:19:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2020-12-23 17:19:22,510 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 31 [2020-12-23 17:19:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:22,511 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2020-12-23 17:19:22,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-23 17:19:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2020-12-23 17:19:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 17:19:22,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:22,511 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, 1, 1, 1, 1] [2020-12-23 17:19:22,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 17:19:22,725 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash 138437156, now seen corresponding path program 1 times [2020-12-23 17:19:22,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:22,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005271052] [2020-12-23 17:19:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:22,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005271052] [2020-12-23 17:19:22,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:19:22,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:19:22,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186362953] [2020-12-23 17:19:22,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:19:22,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:19:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:19:22,770 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 4 states. [2020-12-23 17:19:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:22,877 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2020-12-23 17:19:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:19:22,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-23 17:19:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:22,881 INFO L225 Difference]: With dead ends: 171 [2020-12-23 17:19:22,881 INFO L226 Difference]: Without dead ends: 171 [2020-12-23 17:19:22,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:19:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-23 17:19:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2020-12-23 17:19:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-12-23 17:19:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2020-12-23 17:19:22,888 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 32 [2020-12-23 17:19:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:22,889 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2020-12-23 17:19:22,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:19:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2020-12-23 17:19:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:19:22,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:22,890 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, 1, 1, 1, 1, 1] [2020-12-23 17:19:22,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 17:19:22,891 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash -46172180, now seen corresponding path program 1 times [2020-12-23 17:19:22,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147527563] [2020-12-23 17:19:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:23,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147527563] [2020-12-23 17:19:23,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:19:23,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 17:19:23,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122458837] [2020-12-23 17:19:23,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:19:23,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:19:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:19:23,021 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 11 states. [2020-12-23 17:19:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:23,452 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2020-12-23 17:19:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:19:23,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2020-12-23 17:19:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:23,454 INFO L225 Difference]: With dead ends: 223 [2020-12-23 17:19:23,454 INFO L226 Difference]: Without dead ends: 223 [2020-12-23 17:19:23,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:19:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-12-23 17:19:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 163. [2020-12-23 17:19:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 17:19:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2020-12-23 17:19:23,459 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 33 [2020-12-23 17:19:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:23,459 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2020-12-23 17:19:23,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:19:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2020-12-23 17:19:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:19:23,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:23,460 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:23,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 17:19:23,460 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1553462104, now seen corresponding path program 1 times [2020-12-23 17:19:23,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:23,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888896686] [2020-12-23 17:19:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:23,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888896686] [2020-12-23 17:19:23,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92378724] [2020-12-23 17:19:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:23,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 17:19:23,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:23,889 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:19:23,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:23,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:23,894 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:23,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 17:19:23,964 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:23,965 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:19:23,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:23,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:23,969 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:23,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:23,975 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:23,976 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 17:19:24,014 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_43|], 2=[|v_#memory_int_29|]} [2020-12-23 17:19:24,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:24,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:24,037 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 25 treesize of output 13 [2020-12-23 17:19:24,038 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2020-12-23 17:19:24,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 17:19:24,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,100 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,100 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:19 [2020-12-23 17:19:24,162 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 [2020-12-23 17:19:24,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-23 17:19:24,216 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 0 case distinctions, treesize of input 32 treesize of output 25 [2020-12-23 17:19:24,218 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,226 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:28 [2020-12-23 17:19:24,275 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,276 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 [2020-12-23 17:19:24,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,280 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,290 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2020-12-23 17:19:24,324 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_44|], 6=[|v_#memory_int_32|]} [2020-12-23 17:19:24,328 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 11 treesize of output 7 [2020-12-23 17:19:24,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:24,342 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 25 [2020-12-23 17:19:24,343 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2020-12-23 17:19:24,388 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 16 treesize of output 8 [2020-12-23 17:19:24,391 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,400 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:24,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2020-12-23 17:19:24,480 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,480 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 32 treesize of output 68 [2020-12-23 17:19:24,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,516 INFO L625 ElimStorePlain]: treesize reduction 18, result has 71.0 percent of original size [2020-12-23 17:19:24,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:24,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:24,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:24,528 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:24,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:40 [2020-12-23 17:19:24,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:24,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:24,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:24,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:24,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:24,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:24,679 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 28 treesize of output 10 [2020-12-23 17:19:24,681 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:24,684 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:24,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-12-23 17:19:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:24,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:24,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2020-12-23 17:19:24,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048320658] [2020-12-23 17:19:24,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 17:19:24,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 17:19:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2020-12-23 17:19:24,696 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 30 states. [2020-12-23 17:19:33,902 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-23 17:19:36,401 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-23 17:19:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:36,548 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2020-12-23 17:19:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 17:19:36,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2020-12-23 17:19:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:36,550 INFO L225 Difference]: With dead ends: 255 [2020-12-23 17:19:36,550 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 17:19:36,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 17:19:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 17:19:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 157. [2020-12-23 17:19:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 17:19:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2020-12-23 17:19:36,556 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 33 [2020-12-23 17:19:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:36,556 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2020-12-23 17:19:36,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 17:19:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2020-12-23 17:19:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 17:19:36,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:36,557 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, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:36,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:36,767 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1431337331, now seen corresponding path program 1 times [2020-12-23 17:19:36,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:36,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800462419] [2020-12-23 17:19:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:36,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800462419] [2020-12-23 17:19:36,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:19:36,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 17:19:36,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411032985] [2020-12-23 17:19:36,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 17:19:36,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 17:19:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:19:36,899 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 11 states. [2020-12-23 17:19:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:37,360 INFO L93 Difference]: Finished difference Result 216 states and 223 transitions. [2020-12-23 17:19:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:19:37,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-12-23 17:19:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:37,362 INFO L225 Difference]: With dead ends: 216 [2020-12-23 17:19:37,362 INFO L226 Difference]: Without dead ends: 216 [2020-12-23 17:19:37,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:19:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-23 17:19:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 158. [2020-12-23 17:19:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 17:19:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-12-23 17:19:37,367 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 34 [2020-12-23 17:19:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:37,367 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-12-23 17:19:37,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 17:19:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-12-23 17:19:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 17:19:37,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:37,368 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, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:37,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 17:19:37,368 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash -105872267, now seen corresponding path program 1 times [2020-12-23 17:19:37,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:37,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099814710] [2020-12-23 17:19:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:37,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099814710] [2020-12-23 17:19:37,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169565930] [2020-12-23 17:19:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:37,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 17:19:37,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:37,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:37,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,632 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,632 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:19:37,690 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,691 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:19:37,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:37,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,704 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:19:37,736 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:37,737 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,748 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,749 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:19:37,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,840 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 49 treesize of output 69 [2020-12-23 17:19:37,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 17:19:37,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:37,843 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:37,850 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:37,850 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:26 [2020-12-23 17:19:38,081 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 25 treesize of output 13 [2020-12-23 17:19:38,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:38,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:38,092 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:38,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2020-12-23 17:19:38,162 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17 [2020-12-23 17:19:38,163 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:38,175 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-23 17:19:38,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:38,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-12-23 17:19:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:38,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:38,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2020-12-23 17:19:38,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912685322] [2020-12-23 17:19:38,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-23 17:19:38,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-23 17:19:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2020-12-23 17:19:38,217 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 29 states. [2020-12-23 17:19:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:39,226 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2020-12-23 17:19:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 17:19:39,227 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2020-12-23 17:19:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:39,229 INFO L225 Difference]: With dead ends: 219 [2020-12-23 17:19:39,229 INFO L226 Difference]: Without dead ends: 219 [2020-12-23 17:19:39,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 17:19:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-23 17:19:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 164. [2020-12-23 17:19:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:19:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2020-12-23 17:19:39,235 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 34 [2020-12-23 17:19:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:39,235 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2020-12-23 17:19:39,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-23 17:19:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2020-12-23 17:19:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 17:19:39,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:39,236 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, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:39,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 17:19:39,452 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:39,453 INFO L82 PathProgramCache]: Analyzing trace with hash -105872266, now seen corresponding path program 1 times [2020-12-23 17:19:39,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:39,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935103642] [2020-12-23 17:19:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:39,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935103642] [2020-12-23 17:19:39,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426437842] [2020-12-23 17:19:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:39,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-23 17:19:39,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:39,787 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 23 treesize of output 15 [2020-12-23 17:19:39,788 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:39,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:39,801 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 28 treesize of output 16 [2020-12-23 17:19:39,802 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:39,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:39,809 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:39,810 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:13 [2020-12-23 17:19:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:39,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:39,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-12-23 17:19:39,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662498575] [2020-12-23 17:19:39,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 17:19:39,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 17:19:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-12-23 17:19:39,819 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 15 states. [2020-12-23 17:19:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:40,548 INFO L93 Difference]: Finished difference Result 235 states and 243 transitions. [2020-12-23 17:19:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:19:40,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2020-12-23 17:19:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:40,551 INFO L225 Difference]: With dead ends: 235 [2020-12-23 17:19:40,551 INFO L226 Difference]: Without dead ends: 235 [2020-12-23 17:19:40,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2020-12-23 17:19:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-23 17:19:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 180. [2020-12-23 17:19:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 17:19:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2020-12-23 17:19:40,557 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 34 [2020-12-23 17:19:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:40,557 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2020-12-23 17:19:40,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 17:19:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2020-12-23 17:19:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:19:40,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:40,558 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:40,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 17:19:40,772 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1421784050, now seen corresponding path program 1 times [2020-12-23 17:19:40,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:40,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350278663] [2020-12-23 17:19:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:40,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350278663] [2020-12-23 17:19:40,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:19:40,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:19:40,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673972164] [2020-12-23 17:19:40,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:19:40,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:19:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:19:40,845 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 8 states. [2020-12-23 17:19:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:41,183 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2020-12-23 17:19:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:19:41,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-12-23 17:19:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:41,185 INFO L225 Difference]: With dead ends: 207 [2020-12-23 17:19:41,185 INFO L226 Difference]: Without dead ends: 207 [2020-12-23 17:19:41,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:19:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-23 17:19:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 187. [2020-12-23 17:19:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 17:19:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2020-12-23 17:19:41,190 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 35 [2020-12-23 17:19:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:41,190 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2020-12-23 17:19:41,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:19:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2020-12-23 17:19:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:19:41,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:41,191 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] [2020-12-23 17:19:41,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 17:19:41,191 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1634985222, now seen corresponding path program 1 times [2020-12-23 17:19:41,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:41,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783592898] [2020-12-23 17:19:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:41,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783592898] [2020-12-23 17:19:41,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262869546] [2020-12-23 17:19:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:41,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 53 conjunts are in the unsatisfiable core [2020-12-23 17:19:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:41,791 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:19:41,792 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:41,795 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:19:41,855 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:41,856 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:19:41,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:41,863 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:41,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:19:41,917 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:41,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,951 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-12-23 17:19:41,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:41,957 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:41,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:41,978 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:32 [2020-12-23 17:19:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:42,108 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:42,109 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,145 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:19:42,145 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 44 treesize of output 30 [2020-12-23 17:19:42,146 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,158 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:32 [2020-12-23 17:19:42,192 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 2=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_49|]} [2020-12-23 17:19:42,197 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:19:42,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:42,223 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:19:42,224 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,269 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:19:42,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 44 treesize of output 30 [2020-12-23 17:19:42,270 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,283 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:41 [2020-12-23 17:19:42,336 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,337 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:19:42,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:42,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:42,340 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2020-12-23 17:19:42,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:42,400 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 25 treesize of output 13 [2020-12-23 17:19:42,400 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:42,424 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,445 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:19:42,446 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,463 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,463 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:76, output treesize:47 [2020-12-23 17:19:42,546 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|, |v_#memory_$Pointer$.offset_37|], 6=[|v_#memory_$Pointer$.base_51|]} [2020-12-23 17:19:42,553 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 55 treesize of output 42 [2020-12-23 17:19:42,554 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,593 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,593 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 185 treesize of output 185 [2020-12-23 17:19:42,595 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:19:42,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:42,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:42,598 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-12-23 17:19:42,646 INFO L625 ElimStorePlain]: treesize reduction 293, result has 32.5 percent of original size [2020-12-23 17:19:42,697 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,698 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 138 treesize of output 170 [2020-12-23 17:19:42,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:19:42,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:19:42,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:19:42,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:19:42,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:19:42,708 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-23 17:19:42,750 INFO L625 ElimStorePlain]: treesize reduction 199, result has 30.2 percent of original size [2020-12-23 17:19:42,751 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. [2020-12-23 17:19:42,751 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:86 [2020-12-23 17:19:42,913 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-23 17:19:42,916 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 82 treesize of output 62 [2020-12-23 17:19:42,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:42,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,940 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,940 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 49 [2020-12-23 17:19:42,943 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:42,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:42,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:42,956 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:103, output treesize:23 [2020-12-23 17:19:43,055 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 28 treesize of output 10 [2020-12-23 17:19:43,057 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:43,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:43,061 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:43,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-12-23 17:19:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:43,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:43,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2020-12-23 17:19:43,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219366990] [2020-12-23 17:19:43,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-23 17:19:43,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:43,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-23 17:19:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 17:19:43,102 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 36 states. [2020-12-23 17:19:44,459 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2020-12-23 17:19:45,011 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2020-12-23 17:19:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:46,404 INFO L93 Difference]: Finished difference Result 252 states and 266 transitions. [2020-12-23 17:19:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-23 17:19:46,405 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2020-12-23 17:19:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:46,406 INFO L225 Difference]: With dead ends: 252 [2020-12-23 17:19:46,407 INFO L226 Difference]: Without dead ends: 252 [2020-12-23 17:19:46,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=396, Invalid=2466, Unknown=0, NotChecked=0, Total=2862 [2020-12-23 17:19:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-12-23 17:19:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 187. [2020-12-23 17:19:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 17:19:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2020-12-23 17:19:46,413 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 35 [2020-12-23 17:19:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:46,414 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2020-12-23 17:19:46,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-23 17:19:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2020-12-23 17:19:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 17:19:46,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:46,414 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:46,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 17:19:46,629 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1335971287, now seen corresponding path program 1 times [2020-12-23 17:19:46,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:46,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691807773] [2020-12-23 17:19:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:46,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691807773] [2020-12-23 17:19:46,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406862765] [2020-12-23 17:19:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:46,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 17:19:46,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:46,892 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:46,892 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:19:46,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:46,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:46,896 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:46,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,903 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-12-23 17:19:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:46,933 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:46,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:46,949 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:46,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2020-12-23 17:19:46,993 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 17:19:46,994 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:46,999 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:46,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2020-12-23 17:19:47,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 27 treesize of output 11 [2020-12-23 17:19:47,028 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:47,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:47,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:47,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2020-12-23 17:19:47,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:19:47,134 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:47,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:47,140 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:47,140 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-12-23 17:19:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:47,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:47,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2020-12-23 17:19:47,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925553165] [2020-12-23 17:19:47,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-23 17:19:47,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-23 17:19:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2020-12-23 17:19:47,198 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 26 states. [2020-12-23 17:19:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:19:48,551 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2020-12-23 17:19:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 17:19:48,554 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2020-12-23 17:19:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:19:48,555 INFO L225 Difference]: With dead ends: 229 [2020-12-23 17:19:48,555 INFO L226 Difference]: Without dead ends: 229 [2020-12-23 17:19:48,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=439, Invalid=1631, Unknown=0, NotChecked=0, Total=2070 [2020-12-23 17:19:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-23 17:19:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2020-12-23 17:19:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-12-23 17:19:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2020-12-23 17:19:48,561 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 36 [2020-12-23 17:19:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:19:48,561 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2020-12-23 17:19:48,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-23 17:19:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2020-12-23 17:19:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 17:19:48,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:19:48,562 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:19:48,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:48,777 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:19:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:19:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash 104796270, now seen corresponding path program 2 times [2020-12-23 17:19:48,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:19:48,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392352274] [2020-12-23 17:19:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:19:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:19:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 17:19:49,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392352274] [2020-12-23 17:19:49,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020547435] [2020-12-23 17:19:49,200 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:19:49,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:19:49,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:19:49,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 55 conjunts are in the unsatisfiable core [2020-12-23 17:19:49,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:19:49,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 [2020-12-23 17:19:49,348 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:19:49,358 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:19:49,358 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-23 17:19:49,419 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,419 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:19:49,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:49,422 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2020-12-23 17:19:49,474 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_53|], 2=[|v_#memory_int_38|]} [2020-12-23 17:19:49,477 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:49,478 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:49,498 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 25 treesize of output 13 [2020-12-23 17:19:49,499 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,513 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,513 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2020-12-23 17:19:49,556 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 17:19:49,557 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2020-12-23 17:19:49,639 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 [2020-12-23 17:19:49,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,652 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2020-12-23 17:19:49,716 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,716 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2020-12-23 17:19:49,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,755 INFO L625 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2020-12-23 17:19:49,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,756 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2020-12-23 17:19:49,811 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_54|], 6=[|v_#memory_int_40|]} [2020-12-23 17:19:49,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:49,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,848 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:19:49,849 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:49,878 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 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 17:19:49,879 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,901 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,901 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:52 [2020-12-23 17:19:49,977 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 17 treesize of output 9 [2020-12-23 17:19:49,978 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:49,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:49,999 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 15 treesize of output 7 [2020-12-23 17:19:50,001 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,017 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. [2020-12-23 17:19:50,017 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:44 [2020-12-23 17:19:50,190 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,191 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 102 [2020-12-23 17:19:50,193 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,249 INFO L625 ElimStorePlain]: treesize reduction 52, result has 50.5 percent of original size [2020-12-23 17:19:50,250 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:50,251 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2020-12-23 17:19:50,395 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,395 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 137 [2020-12-23 17:19:50,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,463 INFO L625 ElimStorePlain]: treesize reduction 36, result has 65.7 percent of original size [2020-12-23 17:19:50,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,467 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:19:50,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:65 [2020-12-23 17:19:50,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:19:50,575 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,576 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:19:50,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:50,580 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,586 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:19:50,596 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,597 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2020-12-23 17:19:50,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:50,600 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,626 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:50,626 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2020-12-23 17:19:50,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:19:50,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:19:50,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:50,631 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,760 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-12-23 17:19:50,761 INFO L625 ElimStorePlain]: treesize reduction 3, result has 97.7 percent of original size [2020-12-23 17:19:50,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-12-23 17:19:50,764 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:158, output treesize:128 [2020-12-23 17:19:50,904 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:19:50,910 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:19:50,916 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:19:50,940 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_55|], 20=[|v_#memory_int_43|]} [2020-12-23 17:19:50,947 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 11 treesize of output 7 [2020-12-23 17:19:50,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,954 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 11 treesize of output 7 [2020-12-23 17:19:50,955 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:50,961 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 11 treesize of output 7 [2020-12-23 17:19:50,961 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,061 INFO L625 ElimStorePlain]: treesize reduction 82, result has 59.6 percent of original size [2020-12-23 17:19:51,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:51,070 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 25 [2020-12-23 17:19:51,071 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:51,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:19:51,080 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:19:51,084 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:51,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2020-12-23 17:19:51,086 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,157 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.8 percent of original size [2020-12-23 17:19:51,160 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-23 17:19:51,160 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:215, output treesize:93 [2020-12-23 17:19:51,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:51,281 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 24 treesize of output 12 [2020-12-23 17:19:51,282 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,286 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 24 treesize of output 12 [2020-12-23 17:19:51,287 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:51,315 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 2 xjuncts. [2020-12-23 17:19:51,315 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2020-12-23 17:19:51,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:51,433 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 32 treesize of output 34 [2020-12-23 17:19:51,434 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,442 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:19:51,446 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:51,446 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 32 treesize of output 42 [2020-12-23 17:19:51,447 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:51,510 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-23 17:19:51,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-12-23 17:19:51,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:97, output treesize:89 [2020-12-23 17:19:51,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-23 17:19:51,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:19:52,005 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:19:52,009 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:52,009 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2020-12-23 17:19:52,011 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:19:52,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:19:52,020 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:19:52,021 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:3 [2020-12-23 17:19:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:19:52,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:19:52,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 37 [2020-12-23 17:19:52,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53253739] [2020-12-23 17:19:52,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-23 17:19:52,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:19:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-23 17:19:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 17:19:52,046 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand 37 states. [2020-12-23 17:19:56,262 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2020-12-23 17:19:58,535 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2020-12-23 17:20:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:00,945 INFO L93 Difference]: Finished difference Result 266 states and 275 transitions. [2020-12-23 17:20:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-23 17:20:00,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2020-12-23 17:20:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:00,947 INFO L225 Difference]: With dead ends: 266 [2020-12-23 17:20:00,947 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 17:20:00,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=762, Invalid=4207, Unknown=1, NotChecked=0, Total=4970 [2020-12-23 17:20:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 17:20:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 174. [2020-12-23 17:20:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-23 17:20:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2020-12-23 17:20:00,954 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 36 [2020-12-23 17:20:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:00,954 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2020-12-23 17:20:00,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-23 17:20:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2020-12-23 17:20:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:20:00,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:00,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:01,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-23 17:20:01,156 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:01,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:01,157 INFO L82 PathProgramCache]: Analyzing trace with hash 599090897, now seen corresponding path program 1 times [2020-12-23 17:20:01,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:01,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794597052] [2020-12-23 17:20:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:01,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794597052] [2020-12-23 17:20:01,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:20:01,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:20:01,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871064041] [2020-12-23 17:20:01,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:20:01,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:20:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:20:01,281 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 12 states. [2020-12-23 17:20:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:01,763 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2020-12-23 17:20:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:20:01,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2020-12-23 17:20:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:01,765 INFO L225 Difference]: With dead ends: 185 [2020-12-23 17:20:01,765 INFO L226 Difference]: Without dead ends: 185 [2020-12-23 17:20:01,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-12-23 17:20:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-23 17:20:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-12-23 17:20:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-12-23 17:20:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2020-12-23 17:20:01,770 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 38 [2020-12-23 17:20:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:01,771 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2020-12-23 17:20:01,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:20:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2020-12-23 17:20:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:20:01,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:01,772 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] [2020-12-23 17:20:01,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 17:20:01,772 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash -326810762, now seen corresponding path program 1 times [2020-12-23 17:20:01,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:01,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660103119] [2020-12-23 17:20:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:01,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660103119] [2020-12-23 17:20:01,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651889171] [2020-12-23 17:20:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:20:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:01,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 17:20:01,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:02,024 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:20:02,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:02,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:02,028 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,036 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-12-23 17:20:02,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:02,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:02,077 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,087 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,088 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-12-23 17:20:02,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 17:20:02,118 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2020-12-23 17:20:02,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:20:02,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,158 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2020-12-23 17:20:02,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:02,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:02,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:02,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-12-23 17:20:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:02,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:02,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2020-12-23 17:20:02,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937292258] [2020-12-23 17:20:02,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 17:20:02,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 17:20:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2020-12-23 17:20:02,276 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 23 states. [2020-12-23 17:20:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:03,319 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2020-12-23 17:20:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 17:20:03,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2020-12-23 17:20:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:03,321 INFO L225 Difference]: With dead ends: 201 [2020-12-23 17:20:03,322 INFO L226 Difference]: Without dead ends: 201 [2020-12-23 17:20:03,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 17:20:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-23 17:20:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2020-12-23 17:20:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 17:20:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2020-12-23 17:20:03,327 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 38 [2020-12-23 17:20:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:03,328 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2020-12-23 17:20:03,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 17:20:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2020-12-23 17:20:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:20:03,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:03,328 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:03,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:20:03,544 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash 407118201, now seen corresponding path program 1 times [2020-12-23 17:20:03,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:03,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904340638] [2020-12-23 17:20:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:03,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904340638] [2020-12-23 17:20:03,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858397468] [2020-12-23 17:20:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:20:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:03,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-23 17:20:03,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:03,941 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:03,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:03,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:03,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:03,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:04,027 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,028 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:20:04,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:04,031 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,051 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-12-23 17:20:04,101 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:04,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,120 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:04,121 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2020-12-23 17:20:04,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:04,286 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 14 [2020-12-23 17:20:04,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:04,313 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 44 treesize of output 20 [2020-12-23 17:20:04,314 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,325 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:04,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:04,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 34 treesize of output 14 [2020-12-23 17:20:04,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:04,400 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 44 treesize of output 20 [2020-12-23 17:20:04,401 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,414 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,415 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:04,480 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,481 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 [2020-12-23 17:20:04,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:04,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:04,485 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,505 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,505 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:64 [2020-12-23 17:20:04,587 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,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 1 case distinctions, treesize of input 44 treesize of output 55 [2020-12-23 17:20:04,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,618 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 26 treesize of output 21 [2020-12-23 17:20:04,619 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:60 [2020-12-23 17:20:04,756 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|], 6=[|v_#memory_$Pointer$.base_61|]} [2020-12-23 17:20:04,760 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 51 treesize of output 11 [2020-12-23 17:20:04,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,826 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:04,827 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 102 treesize of output 138 [2020-12-23 17:20:04,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:20:04,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:04,831 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:04,832 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:04,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:04,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:04,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:04,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:04,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:04,847 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2020-12-23 17:20:04,919 INFO L625 ElimStorePlain]: treesize reduction 558, result has 11.7 percent of original size [2020-12-23 17:20:04,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:04,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:74 [2020-12-23 17:20:05,058 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:05,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:05,094 INFO L625 ElimStorePlain]: treesize reduction 8, result has 90.0 percent of original size [2020-12-23 17:20:05,096 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:05,096 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:72 [2020-12-23 17:20:05,255 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:05,259 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:05,259 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 62 treesize of output 33 [2020-12-23 17:20:05,261 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:05,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:05,275 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:05,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:28 [2020-12-23 17:20:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:05,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:05,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 34 [2020-12-23 17:20:05,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642519927] [2020-12-23 17:20:05,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 17:20:05,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 17:20:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 17:20:05,411 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 35 states. [2020-12-23 17:20:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:07,786 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2020-12-23 17:20:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 17:20:07,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2020-12-23 17:20:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:07,788 INFO L225 Difference]: With dead ends: 226 [2020-12-23 17:20:07,788 INFO L226 Difference]: Without dead ends: 226 [2020-12-23 17:20:07,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=378, Invalid=2172, Unknown=0, NotChecked=0, Total=2550 [2020-12-23 17:20:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-12-23 17:20:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2020-12-23 17:20:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 17:20:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2020-12-23 17:20:07,793 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 38 [2020-12-23 17:20:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:07,794 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2020-12-23 17:20:07,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 17:20:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2020-12-23 17:20:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:20:07,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:07,795 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:08,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-23 17:20:08,009 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 407118202, now seen corresponding path program 1 times [2020-12-23 17:20:08,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:08,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330989047] [2020-12-23 17:20:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:08,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330989047] [2020-12-23 17:20:08,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921452580] [2020-12-23 17:20:08,393 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 [2020-12-23 17:20:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:08,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 63 conjunts are in the unsatisfiable core [2020-12-23 17:20:08,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:08,470 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:08,470 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,474 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,474 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:08,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,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 [2020-12-23 17:20:08,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:08,555 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,568 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-12-23 17:20:08,622 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:08,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,652 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-12-23 17:20:08,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:08,657 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,672 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2020-12-23 17:20:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:08,832 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 44 treesize of output 20 [2020-12-23 17:20:08,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,853 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 14 [2020-12-23 17:20:08,854 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,867 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:08,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:08,914 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 44 treesize of output 20 [2020-12-23 17:20:08,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,933 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 14 [2020-12-23 17:20:08,934 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:08,946 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:08,947 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:08,985 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_50|], 3=[|v_#valid_91|]} [2020-12-23 17:20:08,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:08,990 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,023 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,023 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 [2020-12-23 17:20:09,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:09,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:09,026 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,043 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2020-12-23 17:20:09,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:09,103 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 26 treesize of output 21 [2020-12-23 17:20:09,104 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,144 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,144 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 35 treesize of output 50 [2020-12-23 17:20:09,146 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,166 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,166 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:57 [2020-12-23 17:20:09,352 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,353 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 158 treesize of output 166 [2020-12-23 17:20:09,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 17:20:09,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:09,365 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:20:09,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:09,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:09,370 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-23 17:20:09,442 INFO L625 ElimStorePlain]: treesize reduction 263, result has 33.1 percent of original size [2020-12-23 17:20:09,447 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 73 treesize of output 28 [2020-12-23 17:20:09,448 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,468 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:173, output treesize:84 [2020-12-23 17:20:09,836 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:09,848 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-12-23 17:20:09,848 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 104 treesize of output 62 [2020-12-23 17:20:09,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:09,853 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:09,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,875 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,877 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2020-12-23 17:20:09,878 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:09,891 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:09,891 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:14 [2020-12-23 17:20:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:10,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:10,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 34 [2020-12-23 17:20:10,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705904441] [2020-12-23 17:20:10,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 17:20:10,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 17:20:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 17:20:10,012 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand 35 states. [2020-12-23 17:20:11,314 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2020-12-23 17:20:11,919 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2020-12-23 17:20:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:13,490 INFO L93 Difference]: Finished difference Result 240 states and 250 transitions. [2020-12-23 17:20:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 17:20:13,491 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2020-12-23 17:20:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:13,494 INFO L225 Difference]: With dead ends: 240 [2020-12-23 17:20:13,494 INFO L226 Difference]: Without dead ends: 240 [2020-12-23 17:20:13,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=308, Invalid=2344, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 17:20:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-12-23 17:20:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 181. [2020-12-23 17:20:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-23 17:20:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2020-12-23 17:20:13,499 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 38 [2020-12-23 17:20:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:13,499 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2020-12-23 17:20:13,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 17:20:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2020-12-23 17:20:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:20:13,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:13,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:13,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:20:13,715 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1391948883, now seen corresponding path program 1 times [2020-12-23 17:20:13,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:13,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007147167] [2020-12-23 17:20:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:14,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007147167] [2020-12-23 17:20:14,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:20:14,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 17:20:14,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997599360] [2020-12-23 17:20:14,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 17:20:14,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:14,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 17:20:14,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-12-23 17:20:14,089 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 14 states. [2020-12-23 17:20:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:14,662 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2020-12-23 17:20:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 17:20:14,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2020-12-23 17:20:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:14,664 INFO L225 Difference]: With dead ends: 185 [2020-12-23 17:20:14,664 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 17:20:14,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:20:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 17:20:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2020-12-23 17:20:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-12-23 17:20:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2020-12-23 17:20:14,669 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 39 [2020-12-23 17:20:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:14,669 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2020-12-23 17:20:14,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 17:20:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2020-12-23 17:20:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:20:14,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:14,670 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:14,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 17:20:14,670 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1541198813, now seen corresponding path program 1 times [2020-12-23 17:20:14,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:14,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403251942] [2020-12-23 17:20:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:14,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403251942] [2020-12-23 17:20:14,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132344715] [2020-12-23 17:20:14,805 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 [2020-12-23 17:20:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:14,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-23 17:20:14,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:14,875 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:14,876 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:14,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:14,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:14,928 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:20:14,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:14,930 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:14,938 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,938 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-12-23 17:20:14,967 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:14,967 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:14,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:14,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2020-12-23 17:20:15,057 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:15,057 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 67 [2020-12-23 17:20:15,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 17:20:15,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:15,061 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:15,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:15,068 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:15,068 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:19 [2020-12-23 17:20:15,230 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 23 treesize of output 11 [2020-12-23 17:20:15,231 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:20:15,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:15,252 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:15,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2020-12-23 17:20:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:15,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:15,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2020-12-23 17:20:15,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24289910] [2020-12-23 17:20:15,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-23 17:20:15,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-23 17:20:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2020-12-23 17:20:15,278 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand 22 states. [2020-12-23 17:20:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:16,524 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2020-12-23 17:20:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 17:20:16,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-12-23 17:20:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:16,526 INFO L225 Difference]: With dead ends: 189 [2020-12-23 17:20:16,526 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 17:20:16,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 17:20:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 17:20:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2020-12-23 17:20:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 17:20:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2020-12-23 17:20:16,531 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 39 [2020-12-23 17:20:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:16,531 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2020-12-23 17:20:16,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-23 17:20:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2020-12-23 17:20:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:20:16,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:16,532 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:16,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-23 17:20:16,748 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -451527741, now seen corresponding path program 2 times [2020-12-23 17:20:16,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:16,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230932781] [2020-12-23 17:20:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:17,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230932781] [2020-12-23 17:20:17,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462462533] [2020-12-23 17:20:17,066 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 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 [2020-12-23 17:20:17,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:20:17,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:20:17,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 59 conjunts are in the unsatisfiable core [2020-12-23 17:20:17,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:17,281 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:17,282 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:17,296 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,307 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,307 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-12-23 17:20:17,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:17,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2020-12-23 17:20:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:17,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 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:20:17,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,432 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2020-12-23 17:20:17,446 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:17,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,456 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2020-12-23 17:20:17,499 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_54|], 2=[|v_#memory_$Pointer$.base_71|]} [2020-12-23 17:20:17,502 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:17,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,530 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,531 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2020-12-23 17:20:17,533 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,568 INFO L625 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2020-12-23 17:20:17,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,569 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2020-12-23 17:20:17,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-12-23 17:20:17,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:17,628 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 23 treesize of output 7 [2020-12-23 17:20:17,628 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,652 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:17,653 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,673 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:17,673 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2020-12-23 17:20:17,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:17,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:17,807 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 29 treesize of output 13 [2020-12-23 17:20:17,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:17,817 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,817 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2020-12-23 17:20:17,819 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,858 INFO L625 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2020-12-23 17:20:17,859 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:17,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:51 [2020-12-23 17:20:17,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:17,887 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 29 treesize of output 13 [2020-12-23 17:20:17,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:17,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,895 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2020-12-23 17:20:17,897 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:17,928 INFO L625 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2020-12-23 17:20:17,929 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:17,929 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:51 [2020-12-23 17:20:17,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:17,967 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:17,967 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 3 case distinctions, treesize of input 21 treesize of output 78 [2020-12-23 17:20:17,969 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:18,002 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:18,003 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 3 case distinctions, treesize of input 29 treesize of output 118 [2020-12-23 17:20:18,005 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:18,093 INFO L625 ElimStorePlain]: treesize reduction 104, result has 39.2 percent of original size [2020-12-23 17:20:18,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:18,094 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:67 [2020-12-23 17:20:18,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-23 17:20:18,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,178 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_55|, v_prenex_13], 11=[|v_#memory_$Pointer$.base_74|]} [2020-12-23 17:20:18,184 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:18,185 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:18,271 INFO L625 ElimStorePlain]: treesize reduction 6, result has 94.4 percent of original size [2020-12-23 17:20:18,277 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:18,278 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:18,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:18,356 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:18,357 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 34 treesize of output 75 [2020-12-23 17:20:18,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:18,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:18,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,416 INFO L547 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:18,432 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:18,432 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 21 treesize of output 36 [2020-12-23 17:20:18,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,435 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:18,554 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-12-23 17:20:18,555 INFO L625 ElimStorePlain]: treesize reduction 36, result has 76.0 percent of original size [2020-12-23 17:20:18,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 17:20:18,569 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:108 [2020-12-23 17:20:18,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-23 17:20:18,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:18,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:18,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:18,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:18,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:18,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:18,750 INFO L443 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.offset|], 3=[v_prenex_15]} [2020-12-23 17:20:18,756 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:18,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:18,762 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:18,763 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,100 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2020-12-23 17:20:19,101 INFO L625 ElimStorePlain]: treesize reduction 124, result has 68.2 percent of original size [2020-12-23 17:20:19,106 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 23 treesize of output 7 [2020-12-23 17:20:19,106 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:19,112 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:19,118 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,122 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:19,123 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:19,128 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,222 INFO L625 ElimStorePlain]: treesize reduction 94, result has 53.7 percent of original size [2020-12-23 17:20:19,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2020-12-23 17:20:19,224 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:412, output treesize:109 [2020-12-23 17:20:19,322 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 1=[|v_#memory_$Pointer$.base_75|]} [2020-12-23 17:20:19,325 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:19,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:19,358 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:19,359 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 33 [2020-12-23 17:20:19,360 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:19,379 INFO L625 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2020-12-23 17:20:19,380 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. [2020-12-23 17:20:19,380 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:34 [2020-12-23 17:20:19,526 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:19,527 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2020-12-23 17:20:19,528 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-23 17:20:19,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:19,541 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. [2020-12-23 17:20:19,541 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2020-12-23 17:20:19,628 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:19,639 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-12-23 17:20:19,639 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 3 case distinctions, treesize of input 26 treesize of output 25 [2020-12-23 17:20:19,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:19,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:19,642 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:19,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:19,655 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. [2020-12-23 17:20:19,655 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2020-12-23 17:20:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:19,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:19,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2020-12-23 17:20:19,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368038382] [2020-12-23 17:20:19,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-23 17:20:19,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-23 17:20:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 17:20:19,689 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 37 states. [2020-12-23 17:20:21,908 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2020-12-23 17:20:22,965 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 45 [2020-12-23 17:20:23,217 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2020-12-23 17:20:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:24,997 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2020-12-23 17:20:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-12-23 17:20:24,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2020-12-23 17:20:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:25,000 INFO L225 Difference]: With dead ends: 267 [2020-12-23 17:20:25,000 INFO L226 Difference]: Without dead ends: 267 [2020-12-23 17:20:25,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=997, Invalid=5165, Unknown=0, NotChecked=0, Total=6162 [2020-12-23 17:20:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-12-23 17:20:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 182. [2020-12-23 17:20:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-23 17:20:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2020-12-23 17:20:25,006 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 39 [2020-12-23 17:20:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:25,006 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2020-12-23 17:20:25,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-23 17:20:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2020-12-23 17:20:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:20:25,007 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:25,007 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:25,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-23 17:20:25,222 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -451527740, now seen corresponding path program 2 times [2020-12-23 17:20:25,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:25,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001364207] [2020-12-23 17:20:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:25,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001364207] [2020-12-23 17:20:25,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513559720] [2020-12-23 17:20:25,680 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 [2020-12-23 17:20:25,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:20:25,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:20:25,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 73 conjunts are in the unsatisfiable core [2020-12-23 17:20:25,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:25,860 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:25,861 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:25,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:25,870 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:25,871 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-12-23 17:20:25,922 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:25,923 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:25,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:25,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:25,936 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:25,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:25,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:25,949 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2020-12-23 17:20:26,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:26,084 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 36 treesize of output 16 [2020-12-23 17:20:26,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,115 INFO L625 ElimStorePlain]: treesize reduction 7, result has 88.3 percent of original size [2020-12-23 17:20:26,138 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:26,138 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 34 treesize of output 24 [2020-12-23 17:20:26,139 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,162 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2020-12-23 17:20:26,162 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:30 [2020-12-23 17:20:26,218 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:26,219 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 16 treesize of output 44 [2020-12-23 17:20:26,220 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,254 INFO L625 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2020-12-23 17:20:26,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,255 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2020-12-23 17:20:26,339 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:26,339 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 26 treesize of output 45 [2020-12-23 17:20:26,340 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,385 INFO L625 ElimStorePlain]: treesize reduction 27, result has 66.3 percent of original size [2020-12-23 17:20:26,406 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:26,407 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 28 treesize of output 47 [2020-12-23 17:20:26,408 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,457 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2020-12-23 17:20:26,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:50 [2020-12-23 17:20:26,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 1] term [2020-12-23 17:20:26,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:26,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:26,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:26,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:26,742 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:26,763 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:26,764 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 24 [2020-12-23 17:20:26,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,827 INFO L348 Elim1Store]: treesize reduction 56, result has 51.3 percent of original size [2020-12-23 17:20:26,827 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 68 [2020-12-23 17:20:26,829 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,915 INFO L625 ElimStorePlain]: treesize reduction 23, result has 85.2 percent of original size [2020-12-23 17:20:26,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:26,929 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 36 treesize of output 16 [2020-12-23 17:20:26,930 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:26,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:26,944 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:26,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 50 [2020-12-23 17:20:26,946 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:26,998 INFO L625 ElimStorePlain]: treesize reduction 20, result has 81.1 percent of original size [2020-12-23 17:20:26,999 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:26,999 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:185, output treesize:86 [2020-12-23 17:20:27,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:27,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:27,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:27,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:27,079 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 36 treesize of output 16 [2020-12-23 17:20:27,080 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,147 INFO L348 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2020-12-23 17:20:27,147 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 77 [2020-12-23 17:20:27,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:27,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:27,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:27,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:27,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:27,154 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:27,155 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:27,269 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2020-12-23 17:20:27,269 INFO L625 ElimStorePlain]: treesize reduction 35, result has 77.8 percent of original size [2020-12-23 17:20:27,275 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:27,299 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:27,300 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 24 [2020-12-23 17:20:27,301 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,372 INFO L348 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2020-12-23 17:20:27,372 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 56 [2020-12-23 17:20:27,374 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,457 INFO L625 ElimStorePlain]: treesize reduction 20, result has 79.4 percent of original size [2020-12-23 17:20:27,458 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:27,459 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:185, output treesize:82 [2020-12-23 17:20:27,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:27,561 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:27,561 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 3 case distinctions, treesize of input 21 treesize of output 78 [2020-12-23 17:20:27,563 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,602 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:27,603 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 3 case distinctions, treesize of input 29 treesize of output 118 [2020-12-23 17:20:27,605 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,723 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2020-12-23 17:20:27,724 INFO L625 ElimStorePlain]: treesize reduction 107, result has 53.3 percent of original size [2020-12-23 17:20:27,725 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:27,725 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:127, output treesize:122 [2020-12-23 17:20:27,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2020-12-23 17:20:27,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:27,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:27,840 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_61|, v_prenex_16], 11=[|v_#memory_$Pointer$.base_81|]} [2020-12-23 17:20:27,862 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:27,862 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 17:20:27,864 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:27,988 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-23 17:20:27,989 INFO L625 ElimStorePlain]: treesize reduction 30, result has 83.5 percent of original size [2020-12-23 17:20:28,045 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,046 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 111 [2020-12-23 17:20:28,050 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,177 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2020-12-23 17:20:28,178 INFO L625 ElimStorePlain]: treesize reduction 52, result has 72.9 percent of original size [2020-12-23 17:20:28,226 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,226 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 56 treesize of output 97 [2020-12-23 17:20:28,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:28,229 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:28,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:28,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:28,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:28,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:28,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:28,236 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:28,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:28,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:28,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:28,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:28,239 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:28,255 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,256 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 28 treesize of output 39 [2020-12-23 17:20:28,258 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,378 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-23 17:20:28,379 INFO L625 ElimStorePlain]: treesize reduction 60, result has 67.2 percent of original size [2020-12-23 17:20:28,380 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:28,381 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:126 [2020-12-23 17:20:28,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 2, 1] term [2020-12-23 17:20:28,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:28,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-12-23 17:20:28,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:28,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:28,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:28,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-12-23 17:20:28,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:28,677 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|, v_prenex_19], 2=[v_prenex_18, v_prenex_17], 6=[|v_#memory_$Pointer$.base_82|], 12=[|v_#memory_$Pointer$.offset_62|]} [2020-12-23 17:20:28,686 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2020-12-23 17:20:28,687 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,754 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 17 treesize of output 13 [2020-12-23 17:20:28,755 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:28,822 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 37 treesize of output 13 [2020-12-23 17:20:28,823 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,893 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,893 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 48 treesize of output 68 [2020-12-23 17:20:28,897 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:28,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,980 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:28,980 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 216 [2020-12-23 17:20:28,984 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:28,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:28,985 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,986 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,987 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,990 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,991 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,992 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,994 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,996 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,997 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:28,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:28,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,000 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,001 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,002 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,004 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,006 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,008 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,010 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,014 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,017 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,019 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,022 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,035 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,037 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,040 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,043 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,045 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,048 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,051 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,054 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,061 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,064 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,066 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,071 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,073 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,075 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,078 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,080 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,081 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,089 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,092 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,097 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,100 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,104 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,105 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,106 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,108 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,111 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,112 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,115 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,118 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,120 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,122 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,124 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,126 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,127 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,129 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,131 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,142 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,144 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,147 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,152 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,154 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,161 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,164 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,169 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,170 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,172 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,175 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,181 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,184 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,186 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,191 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,194 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,196 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,198 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,203 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:20:29,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,205 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,207 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,209 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,210 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:20:29,211 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:29,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:29,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:29,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,218 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,221 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,225 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:29,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:29,229 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:29,231 INFO L547 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:29,331 INFO L625 ElimStorePlain]: treesize reduction 144, result has 47.6 percent of original size [2020-12-23 17:20:29,415 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,415 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 187 [2020-12-23 17:20:29,422 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:29,491 INFO L625 ElimStorePlain]: treesize reduction 28, result has 74.5 percent of original size [2020-12-23 17:20:29,493 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-23 17:20:29,493 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:280, output treesize:84 [2020-12-23 17:20:29,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,725 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:29,729 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,729 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2020-12-23 17:20:29,731 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:20:29,742 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,742 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2020-12-23 17:20:29,743 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-12-23 17:20:29,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,782 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:29,783 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:70 [2020-12-23 17:20:29,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:29,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:29,890 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:29,894 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,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 41 treesize of output 32 [2020-12-23 17:20:29,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:29,897 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:29,901 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-23 17:20:29,902 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:29,945 INFO L625 ElimStorePlain]: treesize reduction 8, result has 88.9 percent of original size [2020-12-23 17:20:29,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:20:29,950 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:29,955 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:29,958 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,959 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-12-23 17:20:29,960 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:29,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:29,988 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 2 xjuncts. [2020-12-23 17:20:29,988 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:29 [2020-12-23 17:20:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:30,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:30,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2020-12-23 17:20:30,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542892208] [2020-12-23 17:20:30,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-23 17:20:30,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-23 17:20:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 17:20:30,118 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 40 states. [2020-12-23 17:20:31,758 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2020-12-23 17:20:32,764 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-12-23 17:20:33,067 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2020-12-23 17:20:33,353 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 17:20:33,617 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2020-12-23 17:20:33,897 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2020-12-23 17:20:34,712 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2020-12-23 17:20:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:36,232 INFO L93 Difference]: Finished difference Result 346 states and 357 transitions. [2020-12-23 17:20:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-12-23 17:20:36,233 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2020-12-23 17:20:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:36,235 INFO L225 Difference]: With dead ends: 346 [2020-12-23 17:20:36,235 INFO L226 Difference]: Without dead ends: 346 [2020-12-23 17:20:36,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=854, Invalid=5152, Unknown=0, NotChecked=0, Total=6006 [2020-12-23 17:20:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-12-23 17:20:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 189. [2020-12-23 17:20:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-23 17:20:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2020-12-23 17:20:36,241 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 39 [2020-12-23 17:20:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:36,242 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2020-12-23 17:20:36,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-23 17:20:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2020-12-23 17:20:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 17:20:36,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:36,243 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:36,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-23 17:20:36,457 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash -575279667, now seen corresponding path program 1 times [2020-12-23 17:20:36,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:36,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786593650] [2020-12-23 17:20:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:36,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786593650] [2020-12-23 17:20:36,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10927628] [2020-12-23 17:20:36,825 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 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 [2020-12-23 17:20:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:36,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 17:20:36,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:37,131 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 25 treesize of output 17 [2020-12-23 17:20:37,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:37,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:37,144 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 21 treesize of output 13 [2020-12-23 17:20:37,144 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:37,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:37,154 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:37,154 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:9 [2020-12-23 17:20:37,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 17:20:37,204 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:37,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:37,206 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:37,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-23 17:20:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:37,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:37,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2020-12-23 17:20:37,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222866335] [2020-12-23 17:20:37,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 17:20:37,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:37,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 17:20:37,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2020-12-23 17:20:37,235 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 28 states. [2020-12-23 17:20:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:39,072 INFO L93 Difference]: Finished difference Result 204 states and 211 transitions. [2020-12-23 17:20:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 17:20:39,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2020-12-23 17:20:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:39,074 INFO L225 Difference]: With dead ends: 204 [2020-12-23 17:20:39,074 INFO L226 Difference]: Without dead ends: 204 [2020-12-23 17:20:39,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 17:20:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-23 17:20:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2020-12-23 17:20:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-23 17:20:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2020-12-23 17:20:39,081 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 40 [2020-12-23 17:20:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:39,081 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2020-12-23 17:20:39,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 17:20:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2020-12-23 17:20:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 17:20:39,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:39,082 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:39,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-23 17:20:39,296 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash 398571193, now seen corresponding path program 1 times [2020-12-23 17:20:39,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:39,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433742738] [2020-12-23 17:20:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:39,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433742738] [2020-12-23 17:20:39,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089750415] [2020-12-23 17:20:39,754 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 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 [2020-12-23 17:20:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:39,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2020-12-23 17:20:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:39,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:39,838 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:39,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:39,842 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:39,842 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:39,917 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:39,918 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:20:39,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:39,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:39,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:39,935 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:39,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-12-23 17:20:39,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:39,983 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,008 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:40,009 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,022 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2020-12-23 17:20:40,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:40,169 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 14 [2020-12-23 17:20:40,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:40,191 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 44 treesize of output 20 [2020-12-23 17:20:40,192 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,205 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:40,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:40,256 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 44 treesize of output 20 [2020-12-23 17:20:40,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,278 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 14 [2020-12-23 17:20:40,279 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,293 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:35 [2020-12-23 17:20:40,346 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,347 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 [2020-12-23 17:20:40,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:40,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:40,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2020-12-23 17:20:40,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,440 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 35 treesize of output 50 [2020-12-23 17:20:40,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,463 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 26 treesize of output 21 [2020-12-23 17:20:40,464 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,482 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,482 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:41 [2020-12-23 17:20:40,599 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 6=[|v_#memory_$Pointer$.base_87|, |v_#memory_$Pointer$.offset_67|]} [2020-12-23 17:20:40,603 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 37 treesize of output 25 [2020-12-23 17:20:40,604 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,669 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,670 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 179 [2020-12-23 17:20:40,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 17:20:40,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:40,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:40,678 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,696 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 73 [2020-12-23 17:20:40,697 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:40,709 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:40,709 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:202, output treesize:72 [2020-12-23 17:20:41,035 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:41,050 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-12-23 17:20:41,050 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 92 treesize of output 54 [2020-12-23 17:20:41,053 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:41,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:41,075 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:41,075 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2020-12-23 17:20:41,076 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:41,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:41,096 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:41,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:9 [2020-12-23 17:20:41,185 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 17:20:41,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:41,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:41,188 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:41,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-23 17:20:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:41,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:41,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2020-12-23 17:20:41,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581810532] [2020-12-23 17:20:41,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-23 17:20:41,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-23 17:20:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 17:20:41,210 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 37 states. [2020-12-23 17:20:42,933 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 51 [2020-12-23 17:20:43,521 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2020-12-23 17:20:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:45,266 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2020-12-23 17:20:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 17:20:45,267 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2020-12-23 17:20:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:45,269 INFO L225 Difference]: With dead ends: 251 [2020-12-23 17:20:45,269 INFO L226 Difference]: Without dead ends: 251 [2020-12-23 17:20:45,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=387, Invalid=2919, Unknown=0, NotChecked=0, Total=3306 [2020-12-23 17:20:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-23 17:20:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2020-12-23 17:20:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-23 17:20:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2020-12-23 17:20:45,274 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 40 [2020-12-23 17:20:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:45,274 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2020-12-23 17:20:45,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-23 17:20:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2020-12-23 17:20:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 17:20:45,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:45,275 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:45,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:20:45,491 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 671664820, now seen corresponding path program 2 times [2020-12-23 17:20:45,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:45,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540453427] [2020-12-23 17:20:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 17:20:45,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540453427] [2020-12-23 17:20:45,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:20:45,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:20:45,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070591530] [2020-12-23 17:20:45,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:20:45,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:20:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:20:45,574 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 8 states. [2020-12-23 17:20:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:45,786 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2020-12-23 17:20:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:20:45,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-23 17:20:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:45,787 INFO L225 Difference]: With dead ends: 195 [2020-12-23 17:20:45,787 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 17:20:45,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:20:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 17:20:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2020-12-23 17:20:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:20:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2020-12-23 17:20:45,790 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 41 [2020-12-23 17:20:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:45,791 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2020-12-23 17:20:45,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:20:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2020-12-23 17:20:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 17:20:45,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:45,791 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:45,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 17:20:45,792 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1269151193, now seen corresponding path program 2 times [2020-12-23 17:20:45,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:45,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978229201] [2020-12-23 17:20:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:46,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978229201] [2020-12-23 17:20:46,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656984419] [2020-12-23 17:20:46,580 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 [2020-12-23 17:20:46,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:20:46,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:20:46,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 71 conjunts are in the unsatisfiable core [2020-12-23 17:20:46,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:46,718 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:46,719 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:46,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,723 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:46,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:46,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:20:46,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:46,746 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:46,755 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,755 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:20:46,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:46,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,833 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-12-23 17:20:46,837 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:46,837 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:46,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:46,853 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:32 [2020-12-23 17:20:47,015 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 2=[|v_#memory_$Pointer$.offset_69|, |v_#memory_$Pointer$.base_89|]} [2020-12-23 17:20:47,019 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:20:47,020 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:47,052 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:20:47,053 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,097 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:47,098 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 44 treesize of output 30 [2020-12-23 17:20:47,106 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,119 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,120 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:41 [2020-12-23 17:20:47,221 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,221 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 17:20:47,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:47,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:47,226 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,247 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:54 [2020-12-23 17:20:47,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:47,334 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 25 treesize of output 13 [2020-12-23 17:20:47,335 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,370 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:20:47,371 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:20:47,405 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,433 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:91, output treesize:66 [2020-12-23 17:20:47,674 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_71|, |v_#memory_int_50|], 6=[|v_#memory_$Pointer$.base_91|]} [2020-12-23 17:20:47,700 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:47,701 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 105 treesize of output 83 [2020-12-23 17:20:47,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:47,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:47,710 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:47,782 INFO L625 ElimStorePlain]: treesize reduction 10, result has 92.9 percent of original size [2020-12-23 17:20:47,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:47,788 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 26 [2020-12-23 17:20:47,789 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,889 INFO L348 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2020-12-23 17:20:47,889 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 102 treesize of output 84 [2020-12-23 17:20:47,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:47,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:47,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:47,894 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:47,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:47,921 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:162, output treesize:84 [2020-12-23 17:20:48,018 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_int_51|, |v_#memory_$Pointer$.base_92|]} [2020-12-23 17:20:48,023 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 52 treesize of output 32 [2020-12-23 17:20:48,024 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2020-12-23 17:20:48,066 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,131 INFO L348 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2020-12-23 17:20:48,132 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 81 [2020-12-23 17:20:48,134 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,156 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,156 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:84 [2020-12-23 17:20:48,264 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,265 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2020-12-23 17:20:48,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:48,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:48,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:48,271 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,292 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,293 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:81 [2020-12-23 17:20:48,374 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_73|], 6=[|v_#memory_int_52|, |v_#memory_$Pointer$.base_93|]} [2020-12-23 17:20:48,379 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2020-12-23 17:20:48,380 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:48,422 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2020-12-23 17:20:48,424 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,481 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,481 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2020-12-23 17:20:48,484 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,512 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,513 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:93 [2020-12-23 17:20:48,693 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_74|], 6=[|v_#memory_int_53|], 12=[|v_#memory_$Pointer$.base_94|]} [2020-12-23 17:20:48,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,722 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 330 treesize of output 306 [2020-12-23 17:20:48,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:48,724 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,759 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,764 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2020-12-23 17:20:48,765 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:48,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,898 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:48,899 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 263 [2020-12-23 17:20:48,905 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:48,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:48,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:48,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:48,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:48,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:48,913 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:48,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:48,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 17:20:48,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:48,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:20:48,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:48,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:48,922 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:48,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:48,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:48,924 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:48,926 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-12-23 17:20:48,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:20:48,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 17:20:48,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 17:20:48,928 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-23 17:20:48,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:48,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:48,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:48,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:20:48,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:48,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:48,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:48,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:48,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:48,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 13, 5, 11, 3, 10, 3, 1] term [2020-12-23 17:20:48,934 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:20:48,940 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-23 17:20:49,055 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-23 17:20:49,055 INFO L625 ElimStorePlain]: treesize reduction 2227, result has 7.7 percent of original size [2020-12-23 17:20:49,057 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:49,057 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:341, output treesize:187 [2020-12-23 17:20:49,291 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2020-12-23 17:20:49,293 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:49,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 143 [2020-12-23 17:20:49,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:49,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:49,328 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:49,363 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:49,363 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 155 treesize of output 124 [2020-12-23 17:20:49,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:20:49,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:49,370 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,370 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,371 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,372 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,373 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:20:49,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:49,375 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,376 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,377 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,377 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,378 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:49,380 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,380 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,381 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,382 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:49,383 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,384 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,386 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,387 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,390 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,390 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,391 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,392 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:49,393 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,394 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,396 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,397 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:49,400 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,400 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,401 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,401 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,402 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:20:49,403 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,403 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,404 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,404 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:49,405 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,406 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,407 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,408 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,409 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:20:49,410 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,417 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,417 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:20:49,418 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,421 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:20:49,422 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:20:49,426 INFO L547 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:49,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:49,451 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 1 xjuncts. [2020-12-23 17:20:49,452 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:40 [2020-12-23 17:20:49,630 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 37 treesize of output 13 [2020-12-23 17:20:49,631 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:49,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:49,638 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:49,638 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-12-23 17:20:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:49,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:20:49,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2020-12-23 17:20:49,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132934834] [2020-12-23 17:20:49,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-12-23 17:20:49,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:20:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-12-23 17:20:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 17:20:49,672 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 42 states. [2020-12-23 17:20:52,081 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-12-23 17:20:52,406 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2020-12-23 17:20:54,451 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2020-12-23 17:20:55,079 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 86 [2020-12-23 17:20:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:20:57,239 INFO L93 Difference]: Finished difference Result 249 states and 256 transitions. [2020-12-23 17:20:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 17:20:57,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2020-12-23 17:20:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:20:57,241 INFO L225 Difference]: With dead ends: 249 [2020-12-23 17:20:57,241 INFO L226 Difference]: Without dead ends: 249 [2020-12-23 17:20:57,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=496, Invalid=3926, Unknown=0, NotChecked=0, Total=4422 [2020-12-23 17:20:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-23 17:20:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2020-12-23 17:20:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-12-23 17:20:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2020-12-23 17:20:57,246 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 43 [2020-12-23 17:20:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:20:57,247 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2020-12-23 17:20:57,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-12-23 17:20:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2020-12-23 17:20:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 17:20:57,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:20:57,247 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:20:57,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2020-12-23 17:20:57,462 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:20:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:20:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1658321108, now seen corresponding path program 2 times [2020-12-23 17:20:57,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:20:57,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839194424] [2020-12-23 17:20:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:20:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:20:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:20:57,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839194424] [2020-12-23 17:20:57,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391006010] [2020-12-23 17:20:57,969 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 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 [2020-12-23 17:20:58,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:20:58,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:20:58,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 81 conjunts are in the unsatisfiable core [2020-12-23 17:20:58,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:20:58,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:58,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,078 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:20:58,164 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,164 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 [2020-12-23 17:20:58,166 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,193 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-12-23 17:20:58,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2020-12-23 17:20:58,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:58,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:20:58,272 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,286 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2020-12-23 17:20:58,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:58,477 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 36 treesize of output 16 [2020-12-23 17:20:58,478 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,519 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:58,519 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 34 treesize of output 24 [2020-12-23 17:20:58,520 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,545 INFO L625 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2020-12-23 17:20:58,545 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,545 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:31 [2020-12-23 17:20:58,599 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_54|], 3=[|v_#valid_105|]} [2020-12-23 17:20:58,603 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:20:58,604 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,656 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,656 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 3 case distinctions, treesize of input 21 treesize of output 78 [2020-12-23 17:20:58,658 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,710 INFO L625 ElimStorePlain]: treesize reduction 40, result has 56.5 percent of original size [2020-12-23 17:20:58,711 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:52 [2020-12-23 17:20:58,799 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:20:58,809 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,809 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 28 treesize of output 39 [2020-12-23 17:20:58,811 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,855 INFO L625 ElimStorePlain]: treesize reduction 12, result has 84.8 percent of original size [2020-12-23 17:20:58,877 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:58,878 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 26 treesize of output 45 [2020-12-23 17:20:58,879 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,934 INFO L625 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2020-12-23 17:20:58,935 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:20:58,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:60 [2020-12-23 17:20:59,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-12-23 17:20:59,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:20:59,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:59,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:59,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:59,344 INFO L348 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2020-12-23 17:20:59,344 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 78 [2020-12-23 17:20:59,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:59,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:59,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,351 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:59,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:59,359 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 45 treesize of output 21 [2020-12-23 17:20:59,360 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:59,486 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-12-23 17:20:59,487 INFO L625 ElimStorePlain]: treesize reduction 28, result has 83.9 percent of original size [2020-12-23 17:20:59,564 INFO L348 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2020-12-23 17:20:59,565 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 52 [2020-12-23 17:20:59,566 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:59,595 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:20:59,595 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 24 [2020-12-23 17:20:59,596 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:59,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:20:59,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:20:59,650 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:209, output treesize:125 [2020-12-23 17:20:59,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:20:59,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:20:59,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:20:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:20:59,765 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 45 treesize of output 21 [2020-12-23 17:20:59,766 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:20:59,826 INFO L348 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2020-12-23 17:20:59,826 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 78 [2020-12-23 17:20:59,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:59,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:20:59,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:20:59,832 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:20:59,962 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-12-23 17:20:59,962 INFO L625 ElimStorePlain]: treesize reduction 28, result has 83.9 percent of original size [2020-12-23 17:21:00,029 INFO L348 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2020-12-23 17:21:00,030 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 52 [2020-12-23 17:21:00,032 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,061 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:21:00,061 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 24 [2020-12-23 17:21:00,062 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:00,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:21:00,118 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:209, output treesize:125 [2020-12-23 17:21:00,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:00,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:00,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:21:00,209 INFO L443 ElimStorePlain]: Different costs {3=[|v_#length_55|], 15=[|v_#valid_106|]} [2020-12-23 17:21:00,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:00,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2020-12-23 17:21:00,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:00,227 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2020-12-23 17:21:00,228 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:00,432 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-12-23 17:21:00,433 INFO L348 Elim1Store]: treesize reduction 48, result has 74.7 percent of original size [2020-12-23 17:21:00,433 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 159 [2020-12-23 17:21:00,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:00,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:21:00,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:00,439 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,514 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-12-23 17:21:00,515 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 26 treesize of output 89 [2020-12-23 17:21:00,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:21:00,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:00,519 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:00,603 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:21:00,603 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:173, output treesize:195 [2020-12-23 17:21:00,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:00,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:00,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:21:00,794 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:00,817 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:00,817 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 17:21:00,820 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:00,875 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:00,875 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 3 case distinctions, treesize of input 41 treesize of output 107 [2020-12-23 17:21:00,878 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:01,224 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-12-23 17:21:01,225 INFO L625 ElimStorePlain]: treesize reduction 70, result has 76.7 percent of original size [2020-12-23 17:21:01,245 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:01,246 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2020-12-23 17:21:01,247 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:01,282 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:01,283 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 102 [2020-12-23 17:21:01,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:21:01,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:21:01,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:01,293 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:21:01,537 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2020-12-23 17:21:01,538 INFO L625 ElimStorePlain]: treesize reduction 44, result has 80.9 percent of original size [2020-12-23 17:21:01,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:21:01,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:01,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:01,551 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-12-23 17:21:01,551 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:245, output treesize:202 [2020-12-23 17:21:01,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:21:01,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:01,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:01,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:21:01,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:21:01,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:01,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 2, 1] term [2020-12-23 17:21:01,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:21:01,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:01,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 1] term [2020-12-23 17:21:01,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:21:02,274 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2020-12-23 17:21:02,281 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:02,283 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:02,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 1] term [2020-12-23 17:21:02,285 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 17:21:02,300 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_54|, v_prenex_25, v_prenex_21], 2=[|v_#memory_$Pointer$.base_101|, |v_#memory_$Pointer$.offset_81|], 6=[v_prenex_24, v_prenex_22], 11=[v_prenex_27, v_prenex_26]} [2020-12-23 17:21:02,318 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 21 treesize of output 13 [2020-12-23 17:21:02,319 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:02,588 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-12-23 17:21:02,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:02,605 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 37 treesize of output 21 [2020-12-23 17:21:02,610 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:02,870 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-12-23 17:21:02,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:02,884 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 29 treesize of output 17 [2020-12-23 17:21:02,885 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:03,100 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-23 17:21:03,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:03,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 75 [2020-12-23 17:21:03,113 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:03,305 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2020-12-23 17:21:03,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:03,315 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 46 treesize of output 14 [2020-12-23 17:21:03,317 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:03,487 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-12-23 17:21:03,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:03,501 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 73 treesize of output 28 [2020-12-23 17:21:03,502 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:03,660 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-12-23 17:21:03,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:03,712 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:03,712 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 170 treesize of output 170 [2020-12-23 17:21:03,717 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:21:03,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:21:03,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:21:03,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:21:03,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:21:03,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 17:21:03,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:21:03,721 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-12-23 17:21:03,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-23 17:21:03,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:03,724 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2020-12-23 17:21:04,073 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2020-12-23 17:21:04,074 INFO L625 ElimStorePlain]: treesize reduction 307, result has 64.5 percent of original size [2020-12-23 17:21:04,165 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:04,166 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 321 treesize of output 265 [2020-12-23 17:21:04,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2020-12-23 17:21:04,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-23 17:21:04,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:21:04,173 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:21:04,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:04,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:04,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:04,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:21:04,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:21:04,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:21:04,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2020-12-23 17:21:04,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 19 disjuncts [2020-12-23 17:21:04,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2020-12-23 17:21:04,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2020-12-23 17:21:04,182 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:04,529 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2020-12-23 17:21:04,530 INFO L625 ElimStorePlain]: treesize reduction 641, result has 43.9 percent of original size [2020-12-23 17:21:04,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:04,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:04,546 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 46 [2020-12-23 17:21:04,547 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:04,681 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-23 17:21:04,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:04,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 9 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-12-23 17:21:04,685 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:741, output treesize:447 [2020-12-23 17:21:04,981 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-23 17:21:04,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 14, 1] term [2020-12-23 17:21:04,990 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:05,265 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-23 17:21:05,357 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:05,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:05,365 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:21:05,369 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:21:05,387 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:05,388 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:05,390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:21:05,390 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:05,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:05,397 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:05,400 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:05,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, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 17:21:05,402 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:05,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:05,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:05,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:05,412 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:05,413 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 16 [2020-12-23 17:21:05,414 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:05,546 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 17:21:05,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:05,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2020-12-23 17:21:05,556 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:498, output treesize:404 [2020-12-23 17:21:06,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:06,046 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:21:06,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 17:21:06,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:06,086 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 17 [2020-12-23 17:21:06,088 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:06,096 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,099 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,100 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 17 [2020-12-23 17:21:06,101 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,108 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,109 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 17 [2020-12-23 17:21:06,109 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,345 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 101 [2020-12-23 17:21:06,346 INFO L625 ElimStorePlain]: treesize reduction 6, result has 98.2 percent of original size [2020-12-23 17:21:06,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:06,361 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 7 [2020-12-23 17:21:06,363 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,371 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,371 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,373 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2020-12-23 17:21:06,374 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:21:06,383 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 treesize of output 7 [2020-12-23 17:21:06,384 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:21:06,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:06,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-12-23 17:21:06,468 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:452, output treesize:239 [2020-12-23 17:21:06,791 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:21:06,806 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:06,806 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 62 treesize of output 52 [2020-12-23 17:21:06,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:21:06,809 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:21:06,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:21:06,825 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:21:06,825 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:28 [2020-12-23 17:21:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:21:07,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:21:07,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2020-12-23 17:21:07,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494034232] [2020-12-23 17:21:07,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-12-23 17:21:07,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:21:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-12-23 17:21:07,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1818, Unknown=0, NotChecked=0, Total=1980 [2020-12-23 17:21:07,070 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 45 states. [2020-12-23 17:21:14,802 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2020-12-23 17:21:35,866 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2020-12-23 17:21:40,237 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 79 [2020-12-23 17:21:42,831 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 94