/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-data/cart.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:32:09,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:32:09,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:32:09,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:32:09,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:32:09,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:32:09,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:32:09,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:32:09,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:32:09,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:32:09,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:32:09,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:32:09,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:32:09,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:32:09,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:32:09,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:32:09,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:32:09,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:32:09,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:32:09,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:32:09,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:32:09,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:32:09,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:32:09,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:32:09,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:32:09,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:32:09,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:32:09,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:32:09,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:32:09,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:32:09,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:32:09,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:32:09,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:32:09,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:32:09,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:32:09,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:32:09,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:32:09,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:32:09,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:32:09,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:32:09,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:32:09,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:32:10,055 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:32:10,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:32:10,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:32:10,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:32:10,059 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:32:10,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:32:10,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:32:10,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:32:10,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:32:10,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:32:10,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:32:10,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:32:10,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:32:10,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:32:10,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:32:10,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:32:10,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:32:10,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:32:10,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:32:10,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:32:10,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:32:10,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:32:10,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:32:10,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:32:10,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:32:10,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:32:10,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:32:10,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:32:10,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:32:10,510 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:32:10,511 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:32:10,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2021-01-06 16:32:10,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99df8ccd8/2dff3c39ad3c4264b2180bb1747863b2/FLAGf4be45e74 [2021-01-06 16:32:11,300 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:32:11,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2021-01-06 16:32:11,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99df8ccd8/2dff3c39ad3c4264b2180bb1747863b2/FLAGf4be45e74 [2021-01-06 16:32:11,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99df8ccd8/2dff3c39ad3c4264b2180bb1747863b2 [2021-01-06 16:32:11,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:32:11,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:32:11,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:32:11,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:32:11,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:32:11,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:32:11" (1/1) ... [2021-01-06 16:32:11,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f82c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:11, skipping insertion in model container [2021-01-06 16:32:11,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:32:11" (1/1) ... [2021-01-06 16:32:11,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:32:11,709 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~i~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~i~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~i~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~i~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:32:12,028 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/heap-data/cart.i[23713,23726] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:32:12,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:32:12,058 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~i~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~i~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~i~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~i~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:32:12,170 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/heap-data/cart.i[23713,23726] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:32:12,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:32:12,270 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:32:12,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12 WrapperNode [2021-01-06 16:32:12,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:32:12,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:32:12,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:32:12,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:32:12,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:32:12,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:32:12,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:32:12,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:32:12,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... [2021-01-06 16:32:12,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:32:12,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:32:12,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:32:12,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:32:12,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:32:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:32:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:32:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:32:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:32:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:32:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:32:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:32:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:32:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:32:13,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:32:13,088 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 16:32:13,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:32:13 BoogieIcfgContainer [2021-01-06 16:32:13,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:32:13,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:32:13,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:32:13,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:32:13,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:32:11" (1/3) ... [2021-01-06 16:32:13,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e833ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:32:13, skipping insertion in model container [2021-01-06 16:32:13,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:32:12" (2/3) ... [2021-01-06 16:32:13,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e833ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:32:13, skipping insertion in model container [2021-01-06 16:32:13,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:32:13" (3/3) ... [2021-01-06 16:32:13,100 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2021-01-06 16:32:13,109 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:32:13,115 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:32:13,136 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:32:13,168 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:32:13,168 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:32:13,168 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:32:13,168 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:32:13,168 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:32:13,168 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:32:13,169 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:32:13,169 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:32:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2021-01-06 16:32:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:32:13,194 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:13,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:13,196 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2021-01-06 16:32:13,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:13,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337653359] [2021-01-06 16:32:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:13,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337653359] [2021-01-06 16:32:13,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:32:13,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:32:13,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469796486] [2021-01-06 16:32:13,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:32:13,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:32:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:32:13,416 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2021-01-06 16:32:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:13,435 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2021-01-06 16:32:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:32:13,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-06 16:32:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:13,463 INFO L225 Difference]: With dead ends: 34 [2021-01-06 16:32:13,463 INFO L226 Difference]: Without dead ends: 17 [2021-01-06 16:32:13,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:32:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-01-06 16:32:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-01-06 16:32:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-01-06 16:32:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2021-01-06 16:32:13,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2021-01-06 16:32:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:13,514 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-01-06 16:32:13,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:32:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-01-06 16:32:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 16:32:13,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:13,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:13,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:32:13,518 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2021-01-06 16:32:13,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:13,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904578667] [2021-01-06 16:32:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:13,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904578667] [2021-01-06 16:32:13,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:32:13,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:32:13,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952243520] [2021-01-06 16:32:13,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:32:13,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:32:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:32:13,710 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2021-01-06 16:32:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:13,815 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2021-01-06 16:32:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:32:13,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-06 16:32:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:13,817 INFO L225 Difference]: With dead ends: 36 [2021-01-06 16:32:13,817 INFO L226 Difference]: Without dead ends: 21 [2021-01-06 16:32:13,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:32:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-01-06 16:32:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-01-06 16:32:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 16:32:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-01-06 16:32:13,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2021-01-06 16:32:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:13,825 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-01-06 16:32:13,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:32:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-01-06 16:32:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:32:13,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:13,826 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:13,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:32:13,827 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2021-01-06 16:32:13,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:13,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859231098] [2021-01-06 16:32:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:13,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859231098] [2021-01-06 16:32:13,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:32:13,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:32:13,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166968211] [2021-01-06 16:32:13,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:32:13,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:32:13,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:32:13,936 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2021-01-06 16:32:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:14,025 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2021-01-06 16:32:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:32:14,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-06 16:32:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:14,032 INFO L225 Difference]: With dead ends: 36 [2021-01-06 16:32:14,033 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 16:32:14,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:32:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 16:32:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-01-06 16:32:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 16:32:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-01-06 16:32:14,052 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2021-01-06 16:32:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:14,054 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-01-06 16:32:14,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:32:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-01-06 16:32:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 16:32:14,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:14,056 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:14,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:32:14,057 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2021-01-06 16:32:14,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:14,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620609713] [2021-01-06 16:32:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 16:32:14,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620609713] [2021-01-06 16:32:14,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:32:14,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:32:14,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206344396] [2021-01-06 16:32:14,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:32:14,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:32:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:32:14,146 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2021-01-06 16:32:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:14,163 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-01-06 16:32:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:32:14,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-06 16:32:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:14,165 INFO L225 Difference]: With dead ends: 37 [2021-01-06 16:32:14,165 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 16:32:14,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:32:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 16:32:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-01-06 16:32:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 16:32:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-01-06 16:32:14,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2021-01-06 16:32:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:14,179 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-01-06 16:32:14,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:32:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-01-06 16:32:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 16:32:14,183 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:14,183 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:14,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:32:14,184 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2021-01-06 16:32:14,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:14,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995264403] [2021-01-06 16:32:14,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:14,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995264403] [2021-01-06 16:32:14,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94873296] [2021-01-06 16:32:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:14,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-06 16:32:14,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:14,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:14,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2021-01-06 16:32:14,850 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 19 treesize of output 18 [2021-01-06 16:32:14,853 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:14,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:14,861 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:14,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:14,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:14,880 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2021-01-06 16:32:14,949 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:14,950 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 1 case distinctions, treesize of input 26 treesize of output 10 [2021-01-06 16:32:14,953 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:14,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:14,956 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:14,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2021-01-06 16:32:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:14,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:14,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-01-06 16:32:14,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196883467] [2021-01-06 16:32:14,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 16:32:14,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:14,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 16:32:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 16:32:14,964 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2021-01-06 16:32:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:15,327 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-01-06 16:32:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:32:15,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2021-01-06 16:32:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:15,329 INFO L225 Difference]: With dead ends: 48 [2021-01-06 16:32:15,329 INFO L226 Difference]: Without dead ends: 46 [2021-01-06 16:32:15,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:32:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-06 16:32:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2021-01-06 16:32:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-06 16:32:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-01-06 16:32:15,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2021-01-06 16:32:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:15,338 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-01-06 16:32:15,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 16:32:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-01-06 16:32:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:32:15,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:15,340 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:15,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:15,555 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2021-01-06 16:32:15,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:15,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518687506] [2021-01-06 16:32:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:15,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518687506] [2021-01-06 16:32:15,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041091214] [2021-01-06 16:32:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:15,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-06 16:32:15,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:15,878 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 19 treesize of output 1 [2021-01-06 16:32:15,879 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:15,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:15,896 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 19 treesize of output 1 [2021-01-06 16:32:15,897 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:15,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:15,907 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:15,908 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2021-01-06 16:32:15,994 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:32:15,997 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:16,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:16,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:32:16,018 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:16,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:16,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:16,026 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2021-01-06 16:32:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 16:32:16,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:16,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-01-06 16:32:16,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888804185] [2021-01-06 16:32:16,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 16:32:16,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 16:32:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 16:32:16,041 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2021-01-06 16:32:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:16,369 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-01-06 16:32:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:32:16,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-01-06 16:32:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:16,370 INFO L225 Difference]: With dead ends: 82 [2021-01-06 16:32:16,371 INFO L226 Difference]: Without dead ends: 46 [2021-01-06 16:32:16,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:32:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-06 16:32:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2021-01-06 16:32:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 16:32:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-01-06 16:32:16,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2021-01-06 16:32:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:16,379 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-01-06 16:32:16,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 16:32:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-01-06 16:32:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 16:32:16,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:16,380 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:16,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:16,595 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 2 times [2021-01-06 16:32:16,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:16,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792713448] [2021-01-06 16:32:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:16,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792713448] [2021-01-06 16:32:16,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848857226] [2021-01-06 16:32:16,957 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:17,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:32:17,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:17,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 51 conjunts are in the unsatisfiable core [2021-01-06 16:32:17,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:17,146 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 16:32:17,147 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,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 [2021-01-06 16:32:17,164 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,179 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,179 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-01-06 16:32:17,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:17,358 INFO L443 ElimStorePlain]: Different costs {1=[|v_#memory_int_12|], 2=[|v_#memory_$Pointer$.offset_15|, |v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_14|]} [2021-01-06 16:32:17,369 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 0 case distinctions, treesize of input 39 treesize of output 32 [2021-01-06 16:32:17,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,393 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 27 treesize of output 22 [2021-01-06 16:32:17,396 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,403 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,478 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:32:17,480 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,526 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 28 treesize of output 12 [2021-01-06 16:32:17,528 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:32:17,562 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,592 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:32:17,598 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:17,625 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 28 treesize of output 12 [2021-01-06 16:32:17,628 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,643 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:17,648 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:147, output treesize:37 [2021-01-06 16:32:17,722 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_15|], 2=[|v_#memory_$Pointer$.base_17|], 3=[|v_#memory_int_13|]} [2021-01-06 16:32:17,730 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:17,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,756 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:17,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,780 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,780 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 59 treesize of output 58 [2021-01-06 16:32:17,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:17,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:17,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:17,792 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_15], 2=[v_arrayElimCell_14]} [2021-01-06 16:32:17,937 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_15|], 2=[|v_#memory_$Pointer$.base_17|], 3=[|v_#memory_int_13|]} [2021-01-06 16:32:17,944 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:17,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,971 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:17,987 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:17,996 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 59 treesize of output 58 [2021-01-06 16:32:17,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:18,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:18,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:18,006 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17], 2=[v_arrayElimCell_16]} [2021-01-06 16:32:18,052 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_15|], 2=[|v_#memory_$Pointer$.base_17|], 3=[|v_#memory_int_13|]} [2021-01-06 16:32:18,058 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:18,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,083 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:18,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,107 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,108 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 59 treesize of output 58 [2021-01-06 16:32:18,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:18,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:18,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:18,120 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_19], 2=[v_arrayElimCell_18]} [2021-01-06 16:32:18,292 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_15|], 2=[|v_#memory_$Pointer$.base_17|], 3=[|v_#memory_int_13|]} [2021-01-06 16:32:18,297 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:18,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,322 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:18,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,345 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,345 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 59 treesize of output 58 [2021-01-06 16:32:18,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:18,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:18,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:18,354 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_21], 2=[v_arrayElimCell_20]} [2021-01-06 16:32:18,486 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_17|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_15|], 3=[|v_#memory_int_13|]} [2021-01-06 16:32:18,491 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 148 treesize of output 98 [2021-01-06 16:32:18,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:18,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,517 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:18,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,540 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:18,540 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 97 treesize of output 90 [2021-01-06 16:32:18,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:18,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:18,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:18,550 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_24], 1=[v_arrayElimCell_23]} [2021-01-06 16:32:18,568 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0.base Int) (|v_#memory_int_13| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_17| (Array Int (Array Int Int))) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (ULTIMATE.start_main_~order~0 Int) (|v_#memory_$Pointer$.base_15| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_17| ULTIMATE.start_main_~i~0.base) 0))) (let ((.cse0 (select (store |v_#memory_int_13| .cse3 (let ((.cse5 (store (select |v_#memory_int_13| .cse3) 12 ULTIMATE.start_main_~order~0))) (store .cse5 8 (select .cse5 8)))) ULTIMATE.start_main_~i~0.base)) (.cse2 (select |#memory_$Pointer$.base| .cse3)) (.cse4 (select |v_#memory_$Pointer$.base_15| .cse3))) (and (<= (select .cse0 8) |c_ULTIMATE.start_main_#t~mem14|) (let ((.cse1 (select |v_#memory_int_13| ULTIMATE.start_main_~i~0.base))) (<= (select .cse1 12) (select .cse1 8))) (= (select .cse2 0) 0) (<= |c_ULTIMATE.start_main_#t~mem13| (select .cse0 12)) (not (= 0 .cse3)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_15| .cse3 (store .cse4 8 (select .cse2 8)))) (= (store |v_#memory_$Pointer$.base_17| .cse3 (store (select |v_#memory_$Pointer$.base_17| .cse3) 12 (select .cse4 12))) |v_#memory_$Pointer$.base_15|))))) is different from true [2021-01-06 16:32:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:18,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:18,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-01-06 16:32:18,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912496873] [2021-01-06 16:32:18,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 16:32:18,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 16:32:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=268, Unknown=30, NotChecked=34, Total=380 [2021-01-06 16:32:18,597 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 20 states. [2021-01-06 16:32:30,164 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2021-01-06 16:32:30,590 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2021-01-06 16:32:35,431 WARN L197 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 132 DAG size of output: 101 [2021-01-06 16:32:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:36,203 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-01-06 16:32:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:32:36,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2021-01-06 16:32:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:36,205 INFO L225 Difference]: With dead ends: 57 [2021-01-06 16:32:36,205 INFO L226 Difference]: Without dead ends: 55 [2021-01-06 16:32:36,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=199, Invalid=669, Unknown=66, NotChecked=58, Total=992 [2021-01-06 16:32:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-06 16:32:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2021-01-06 16:32:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 16:32:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2021-01-06 16:32:36,215 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 28 [2021-01-06 16:32:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:36,216 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-01-06 16:32:36,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 16:32:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2021-01-06 16:32:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:32:36,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:36,217 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:36,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:36,419 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2021-01-06 16:32:36,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:36,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669352213] [2021-01-06 16:32:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:36,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669352213] [2021-01-06 16:32:36,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200621107] [2021-01-06 16:32:36,825 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:36,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:32:36,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:36,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-06 16:32:36,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:36,982 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 [2021-01-06 16:32:36,983 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:36,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:36,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 16:32:36,998 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,009 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,009 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-01-06 16:32:37,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,121 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 28 treesize of output 12 [2021-01-06 16:32:37,123 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,156 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:37,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-01-06 16:32:37,192 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,224 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-01-06 16:32:37,226 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,246 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,246 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:33 [2021-01-06 16:32:37,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:37,387 INFO L443 ElimStorePlain]: Different costs {1=[|v_#memory_int_14|], 2=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.offset_18|]} [2021-01-06 16:32:37,397 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 75 treesize of output 56 [2021-01-06 16:32:37,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,419 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 47 treesize of output 38 [2021-01-06 16:32:37,421 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,428 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,492 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:37,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:37,548 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 142 [2021-01-06 16:32:37,550 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,615 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,616 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 160 [2021-01-06 16:32:37,620 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,677 INFO L625 ElimStorePlain]: treesize reduction 40, result has 69.2 percent of original size [2021-01-06 16:32:37,685 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 35 treesize of output 11 [2021-01-06 16:32:37,686 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,709 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,709 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:264, output treesize:49 [2021-01-06 16:32:37,893 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2021-01-06 16:32:37,898 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:32:37,899 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,920 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,921 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 46 treesize of output 33 [2021-01-06 16:32:37,923 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,935 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,935 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:19 [2021-01-06 16:32:37,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-06 16:32:37,985 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:37,993 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:37,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:3 [2021-01-06 16:32:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:38,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:38,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-01-06 16:32:38,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982131823] [2021-01-06 16:32:38,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 16:32:38,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 16:32:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-01-06 16:32:38,004 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 20 states. [2021-01-06 16:32:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:39,158 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2021-01-06 16:32:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:32:39,159 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2021-01-06 16:32:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:39,160 INFO L225 Difference]: With dead ends: 60 [2021-01-06 16:32:39,160 INFO L226 Difference]: Without dead ends: 58 [2021-01-06 16:32:39,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-01-06 16:32:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-06 16:32:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2021-01-06 16:32:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-01-06 16:32:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-01-06 16:32:39,171 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 31 [2021-01-06 16:32:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:39,171 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-01-06 16:32:39,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 16:32:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-01-06 16:32:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 16:32:39,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:39,172 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:39,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:39,374 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 3 times [2021-01-06 16:32:39,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:39,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379949105] [2021-01-06 16:32:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:39,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379949105] [2021-01-06 16:32:39,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817043772] [2021-01-06 16:32:39,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:40,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 16:32:40,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:40,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 62 conjunts are in the unsatisfiable core [2021-01-06 16:32:40,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:40,972 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 [2021-01-06 16:32:40,976 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:40,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:40,993 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 [2021-01-06 16:32:40,994 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,003 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,004 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-01-06 16:32:41,054 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,110 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:41,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:41,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:41,177 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,178 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 1 case distinctions, treesize of input 29 treesize of output 52 [2021-01-06 16:32:41,180 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,276 INFO L625 ElimStorePlain]: treesize reduction 16, result has 85.7 percent of original size [2021-01-06 16:32:41,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:32:41,291 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:32:41,331 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,375 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,376 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 19 treesize of output 34 [2021-01-06 16:32:41,381 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,433 INFO L625 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2021-01-06 16:32:41,446 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,446 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:120, output treesize:49 [2021-01-06 16:32:41,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:41,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:32:41,555 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_26|], 1=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_27|]} [2021-01-06 16:32:41,561 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,565 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,731 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-01-06 16:32:41,732 INFO L625 ElimStorePlain]: treesize reduction 7, result has 96.4 percent of original size [2021-01-06 16:32:41,737 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,742 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:41,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,834 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 45 treesize of output 29 [2021-01-06 16:32:41,836 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,860 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:41,861 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 1 case distinctions, treesize of input 49 treesize of output 47 [2021-01-06 16:32:41,864 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:41,980 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-01-06 16:32:41,981 INFO L625 ElimStorePlain]: treesize reduction 8, result has 94.7 percent of original size [2021-01-06 16:32:42,008 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-01-06 16:32:42,009 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:42,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:42,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-01-06 16:32:42,026 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:42,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 16:32:42,080 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:221, output treesize:94 [2021-01-06 16:32:42,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:42,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:42,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 1] term [2021-01-06 16:32:42,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:32:42,186 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_31|, v_prenex_5, v_prenex_2, v_prenex_3, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_27|, |#memory_$Pointer$.offset|], 5=[v_prenex_4, v_prenex_1, |v_#memory_$Pointer$.offset_28|]} [2021-01-06 16:32:42,215 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,216 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 213 treesize of output 197 [2021-01-06 16:32:42,223 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:42,435 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-01-06 16:32:42,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,444 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:42,578 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-01-06 16:32:42,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,584 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:42,701 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-06 16:32:42,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,707 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:42,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,810 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:42,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:42,899 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 35 treesize of output 11 [2021-01-06 16:32:42,900 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:42,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:42,965 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:43,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:43,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 87 [2021-01-06 16:32:43,026 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_50], 3=[v_arrayElimCell_51]} [2021-01-06 16:32:43,032 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 [2021-01-06 16:32:43,034 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,052 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2021-01-06 16:32:43,054 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,065 INFO L547 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,112 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,113 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 1 case distinctions, treesize of input 61 treesize of output 58 [2021-01-06 16:32:43,115 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,181 INFO L625 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2021-01-06 16:32:43,186 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 48 treesize of output 36 [2021-01-06 16:32:43,201 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,201 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 144 [2021-01-06 16:32:43,209 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,215 INFO L547 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,241 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,245 INFO L547 ElimStorePlain]: Start of recursive call 1: 10 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 16:32:43,245 INFO L244 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:438, output treesize:57 [2021-01-06 16:32:43,381 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 81 treesize of output 51 [2021-01-06 16:32:43,383 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,419 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:43,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,436 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 18 treesize of output 14 [2021-01-06 16:32:43,442 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2021-01-06 16:32:43,444 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,446 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:43,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:43,452 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:8 [2021-01-06 16:32:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:43,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:43,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-01-06 16:32:43,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961997332] [2021-01-06 16:32:43,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 16:32:43,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 16:32:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-01-06 16:32:43,497 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 15 states. [2021-01-06 16:32:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:44,256 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2021-01-06 16:32:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:32:44,257 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2021-01-06 16:32:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:44,258 INFO L225 Difference]: With dead ends: 94 [2021-01-06 16:32:44,258 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 16:32:44,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-01-06 16:32:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 16:32:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-06 16:32:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-06 16:32:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2021-01-06 16:32:44,268 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 32 [2021-01-06 16:32:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:44,269 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-01-06 16:32:44,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 16:32:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2021-01-06 16:32:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 16:32:44,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:44,270 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:44,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:44,485 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1909608239, now seen corresponding path program 4 times [2021-01-06 16:32:44,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:44,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329844771] [2021-01-06 16:32:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:32:44,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329844771] [2021-01-06 16:32:44,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422741307] [2021-01-06 16:32:44,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:45,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 16:32:45,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:45,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 74 conjunts are in the unsatisfiable core [2021-01-06 16:32:45,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:45,125 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2021-01-06 16:32:45,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,142 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 [2021-01-06 16:32:45,143 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,156 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2021-01-06 16:32:45,203 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_39|], 2=[|v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.base_34|]} [2021-01-06 16:32:45,214 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-01-06 16:32:45,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,270 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:45,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,310 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:45,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,363 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,364 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 52 [2021-01-06 16:32:45,365 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,425 INFO L625 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2021-01-06 16:32:45,429 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:45,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,456 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 16 treesize of output 17 [2021-01-06 16:32:45,457 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,484 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,485 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:113, output treesize:30 [2021-01-06 16:32:45,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:45,662 INFO L443 ElimStorePlain]: Different costs {1=[|v_#memory_int_15|], 2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.base_36|], 6=[|v_#memory_$Pointer$.offset_35|]} [2021-01-06 16:32:45,669 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 0 case distinctions, treesize of input 39 treesize of output 32 [2021-01-06 16:32:45,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,687 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 27 treesize of output 22 [2021-01-06 16:32:45,688 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,694 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,695 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,747 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:45,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,800 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 39 treesize of output 19 [2021-01-06 16:32:45,802 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,868 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 39 treesize of output 19 [2021-01-06 16:32:45,869 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:45,919 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,920 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2021-01-06 16:32:45,922 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:45,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:45,955 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:158, output treesize:59 [2021-01-06 16:32:46,032 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:46,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,039 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 263 treesize of output 193 [2021-01-06 16:32:46,041 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,111 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,163 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 130 [2021-01-06 16:32:46,207 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,267 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,268 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 73 treesize of output 130 [2021-01-06 16:32:46,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:46,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:46,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,285 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_71], 1=[v_arrayElimCell_72]} [2021-01-06 16:32:46,437 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:46,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 193 [2021-01-06 16:32:46,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,517 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,572 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 130 [2021-01-06 16:32:46,620 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,677 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,678 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 73 treesize of output 130 [2021-01-06 16:32:46,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:46,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:46,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:46,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,703 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_75], 1=[v_arrayElimCell_76]} [2021-01-06 16:32:46,729 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:46,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,736 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 263 treesize of output 193 [2021-01-06 16:32:46,738 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,807 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,854 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:46,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,922 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 164 treesize of output 130 [2021-01-06 16:32:46,923 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:46,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,978 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:46,979 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 73 treesize of output 130 [2021-01-06 16:32:46,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:46,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:46,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:46,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:46,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:46,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:46,994 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_79], 1=[v_arrayElimCell_80]} [2021-01-06 16:32:47,020 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:47,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32: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 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 193 [2021-01-06 16:32:47,029 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:47,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,099 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,150 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:47,195 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 130 [2021-01-06 16:32:47,197 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:47,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,261 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,261 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 73 treesize of output 130 [2021-01-06 16:32:47,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:47,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:47,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:47,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:47,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:47,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:47,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:47,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:47,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:47,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:47,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:47,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:47,276 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_83], 1=[v_arrayElimCell_84]} [2021-01-06 16:32:47,323 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_38|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:47,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:47,331 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 640 treesize of output 478 [2021-01-06 16:32:47,334 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:47,587 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 16:32:47,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,597 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,722 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 16:32:47,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,730 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,829 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,891 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:47,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:47,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:47,948 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 525 treesize of output 431 [2021-01-06 16:32:47,950 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:47,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:48,014 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:48,015 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 363 treesize of output 315 [2021-01-06 16:32:48,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:48,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:48,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:32:48,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:48,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:48,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:48,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:48,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:48,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:48,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:48,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:48,044 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_87], 1=[v_arrayElimCell_88]} [2021-01-06 16:32:51,051 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-01-06 16:32:51,078 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_38|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:51,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:51,087 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 640 treesize of output 478 [2021-01-06 16:32:51,090 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:51,315 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 16:32:51,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,323 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:51,436 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 16:32:51,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,443 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:51,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,539 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:51,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,602 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:51,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:51,647 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 525 treesize of output 431 [2021-01-06 16:32:51,649 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:51,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,710 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:51,711 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 363 treesize of output 315 [2021-01-06 16:32:51,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:32:51,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:51,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:51,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:51,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:32:51,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:51,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:51,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:51,747 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_91], 1=[v_arrayElimCell_92]} [2021-01-06 16:32:51,790 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_38|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:32:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:51,806 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 640 treesize of output 478 [2021-01-06 16:32:51,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,089 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-01-06 16:32:52,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,097 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:52,276 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-01-06 16:32:52,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,287 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:52,403 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-06 16:32:52,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,411 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:52,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,491 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:32:52,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,565 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 525 treesize of output 431 [2021-01-06 16:32:52,567 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,614 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 0 case distinctions, treesize of input 363 treesize of output 246 [2021-01-06 16:32:52,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,630 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 35 treesize of output 35 [2021-01-06 16:32:52,632 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,669 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 193 [2021-01-06 16:32:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:32:52,686 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 121 treesize of output 103 [2021-01-06 16:32:52,688 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,701 INFO L547 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,716 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:32:52,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,788 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:52,789 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 211 [2021-01-06 16:32:52,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:32:52,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:32:52,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:32:52,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:32:52,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:32:52,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:32:52,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:32:52,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:32:52,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:32:52,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:32:52,826 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_104, v_arrayElimCell_103], 2=[v_arrayElimCell_102]} [2021-01-06 16:33:00,051 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-06 16:33:00,078 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_38|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_36|]} [2021-01-06 16:33:00,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,085 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 640 treesize of output 478 [2021-01-06 16:33:00,087 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,243 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-01-06 16:33:00,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,253 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:00,370 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-01-06 16:33:00,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,377 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:00,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,464 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:00,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,524 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:00,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,572 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 525 treesize of output 431 [2021-01-06 16:33:00,574 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,612 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 0 case distinctions, treesize of input 363 treesize of output 246 [2021-01-06 16:33:00,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,629 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 35 treesize of output 35 [2021-01-06 16:33:00,632 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 193 [2021-01-06 16:33:00,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:00,682 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 121 treesize of output 103 [2021-01-06 16:33:00,684 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,696 INFO L547 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,708 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:33:00,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,761 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:00,761 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 211 [2021-01-06 16:33:00,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:33:00,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:33:00,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:33:00,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:33:00,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:33:00,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:33:00,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:33:00,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:33:00,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:33:00,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:33:00,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:33:00,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:00,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:33:00,790 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_116, v_arrayElimCell_114], 2=[v_arrayElimCell_115]} [2021-01-06 16:33:03,304 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_33|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_38|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.base_37|], 3=[|v_#memory_int_16|], 5=[|v_#memory_$Pointer$.offset_36|], 6=[|v_#memory_$Pointer$.base_42|]} [2021-01-06 16:33:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:03,312 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 923 treesize of output 697 [2021-01-06 16:33:03,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:03,510 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 16:33:03,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,519 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:03,657 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 16:33:03,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,664 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:03,781 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 16:33:03,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,789 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:03,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,863 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:33:03,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:03,926 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 880 treesize of output 722 [2021-01-06 16:33:03,928 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:03,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:33:03,974 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 26 treesize of output 10 [2021-01-06 16:33:03,977 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 16:33:03,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:04,004 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:33:04,004 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 1 case distinctions, treesize of input 138 treesize of output 104 [2021-01-06 16:33:04,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:04,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:33:04,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:33:04,015 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_122], 3=[v_arrayElimCell_121]} [2021-01-06 16:33:04,104 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_$Pointer$.base_42| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_41| (Array Int (Array Int Int))) (|v_#memory_int_16| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_38| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_37| (Array Int (Array Int Int))) (ULTIMATE.start_main_~i~0.base Int) (|v_#memory_$Pointer$.offset_33| (Array Int (Array Int Int))) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int))) (ULTIMATE.start_main_~order~0 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_main_~order~0_5 Int)) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_41| ULTIMATE.start_main_~i~0.base) 0))) (let ((.cse10 (select |#memory_$Pointer$.offset| .cse5)) (.cse15 (select (select |v_#memory_$Pointer$.offset_36| ULTIMATE.start_main_~i~0.base) 0))) (let ((.cse8 (select |v_#memory_$Pointer$.base_42| .cse5)) (.cse14 (select .cse10 .cse15))) (let ((.cse11 (+ .cse14 8)) (.cse3 (+ .cse14 12)) (.cse7 (+ .cse15 8)) (.cse16 (+ .cse15 12)) (.cse2 (select .cse8 .cse15))) (let ((.cse4 (select |v_#memory_$Pointer$.base_38| .cse2)) (.cse12 (select |#memory_$Pointer$.base| .cse2)) (.cse6 (select |v_#memory_$Pointer$.base_37| .cse5)) (.cse1 (select (let ((.cse17 (store |v_#memory_int_16| .cse5 (let ((.cse19 (store (select |v_#memory_int_16| .cse5) .cse16 v_ULTIMATE.start_main_~order~0_5))) (store .cse19 .cse7 (select .cse19 .cse7)))))) (store .cse17 .cse2 (let ((.cse18 (store (select .cse17 .cse2) .cse3 ULTIMATE.start_main_~order~0))) (store .cse18 .cse11 (select .cse18 .cse11))))) ULTIMATE.start_main_~i~0.base)) (.cse0 (select |v_#memory_$Pointer$.offset_36| .cse5)) (.cse9 (select |v_#memory_$Pointer$.offset_33| .cse5))) (and (= 0 (select .cse0 0)) (<= |c_ULTIMATE.start_main_#t~mem13| (select .cse1 12)) (= (store |v_#memory_$Pointer$.base_42| .cse2 (store (select |v_#memory_$Pointer$.base_42| .cse2) .cse3 (select .cse4 .cse3))) |v_#memory_$Pointer$.base_38|) (= (store |v_#memory_$Pointer$.base_37| .cse5 (store .cse6 .cse7 (select .cse8 .cse7))) |v_#memory_$Pointer$.base_42|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_33| .cse5 (store .cse9 .cse7 (select .cse10 .cse7)))) (= (store |v_#memory_$Pointer$.base_38| .cse2 (store .cse4 .cse11 (select .cse12 .cse11))) |#memory_$Pointer$.base|) (let ((.cse13 (select |v_#memory_int_16| ULTIMATE.start_main_~i~0.base))) (<= (select .cse13 12) (select .cse13 8))) (= (select .cse12 .cse14) 0) (= .cse15 0) (= (store |v_#memory_$Pointer$.base_41| .cse5 (store (select |v_#memory_$Pointer$.base_41| .cse5) .cse16 (select .cse6 .cse16))) |v_#memory_$Pointer$.base_37|) (<= (select .cse1 8) |c_ULTIMATE.start_main_#t~mem14|) (= (store |v_#memory_$Pointer$.offset_36| .cse5 (store .cse0 .cse16 (select .cse9 .cse16))) |v_#memory_$Pointer$.offset_33|) (not (= .cse5 0))))))))) is different from true [2021-01-06 16:33:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:33:04,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:33:04,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-01-06 16:33:04,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249274759] [2021-01-06 16:33:04,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 16:33:04,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:33:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 16:33:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=429, Unknown=45, NotChecked=44, Total=600 [2021-01-06 16:33:04,151 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 25 states. [2021-01-06 16:33:10,734 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2021-01-06 16:34:33,380 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-01-06 16:35:35,767 WARN L197 SmtUtils]: Spent 36.92 s on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2021-01-06 16:36:26,434 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 116