/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/array-crafted/mapavg5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 00:44:08,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 00:44:08,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 00:44:08,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 00:44:08,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 00:44:08,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 00:44:08,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 00:44:08,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 00:44:08,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 00:44:08,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 00:44:08,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 00:44:08,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 00:44:08,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 00:44:08,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 00:44:08,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 00:44:08,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 00:44:08,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 00:44:08,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 00:44:08,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 00:44:08,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 00:44:08,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 00:44:08,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 00:44:08,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 00:44:08,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 00:44:08,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 00:44:08,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 00:44:08,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 00:44:08,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 00:44:08,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 00:44:08,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 00:44:08,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 00:44:08,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 00:44:08,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 00:44:08,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 00:44:08,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 00:44:08,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 00:44:08,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 00:44:08,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 00:44:08,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 00:44:08,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 00:44:08,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 00:44:08,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 00:44:08,469 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 00:44:08,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 00:44:08,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 00:44:08,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 00:44:08,474 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 00:44:08,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 00:44:08,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 00:44:08,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 00:44:08,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 00:44:08,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 00:44:08,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 00:44:08,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 00:44:08,477 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 00:44:08,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 00:44:08,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 00:44:08,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 00:44:08,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 00:44:08,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 00:44:08,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 00:44:08,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 00:44:08,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 00:44:08,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 00:44:08,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 00:44:08,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 00:44:08,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 00:44:08,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 00:44:08,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 00:44:08,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 00:44:08,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 00:44:08,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 00:44:08,915 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 00:44:08,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/mapavg5.i [2020-12-23 00:44:08,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f6f0225b/e1019e3d68964b2bb80b7600b5fb1e25/FLAGbf18caa6d [2020-12-23 00:44:09,549 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 00:44:09,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2020-12-23 00:44:09,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f6f0225b/e1019e3d68964b2bb80b7600b5fb1e25/FLAGbf18caa6d [2020-12-23 00:44:10,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0f6f0225b/e1019e3d68964b2bb80b7600b5fb1e25 [2020-12-23 00:44:10,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 00:44:10,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 00:44:10,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 00:44:10,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 00:44:10,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 00:44:10,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b04d038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10, skipping insertion in model container [2020-12-23 00:44:10,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 00:44:10,053 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[BinaryExpression[ARITHMINUS,IdentifierExpression[~N~0,GLOBAL],IntegerLiteral[1]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2020-12-23 00:44:10,221 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/array-crafted/mapavg5.i[1383,1396] [2020-12-23 00:44:10,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 00:44:10,232 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMINUS,IdentifierExpression[~N~0,GLOBAL],IntegerLiteral[1]]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2020-12-23 00:44:10,258 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/array-crafted/mapavg5.i[1383,1396] [2020-12-23 00:44:10,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 00:44:10,275 INFO L208 MainTranslator]: Completed translation [2020-12-23 00:44:10,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10 WrapperNode [2020-12-23 00:44:10,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 00:44:10,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 00:44:10,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 00:44:10,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 00:44:10,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 00:44:10,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 00:44:10,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 00:44:10,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 00:44:10,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... [2020-12-23 00:44:10,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 00:44:10,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 00:44:10,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 00:44:10,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 00:44:10,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 00:44:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 00:44:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 00:44:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 00:44:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 00:44:10,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 00:44:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 00:44:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 00:44:10,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 00:44:10,851 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2020-12-23 00:44:10,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:44:10 BoogieIcfgContainer [2020-12-23 00:44:10,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 00:44:10,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 00:44:10,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 00:44:10,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 00:44:10,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 12:44:10" (1/3) ... [2020-12-23 00:44:10,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463677d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:44:10, skipping insertion in model container [2020-12-23 00:44:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:44:10" (2/3) ... [2020-12-23 00:44:10,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463677d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:44:10, skipping insertion in model container [2020-12-23 00:44:10,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:44:10" (3/3) ... [2020-12-23 00:44:10,863 INFO L111 eAbstractionObserver]: Analyzing ICFG mapavg5.i [2020-12-23 00:44:10,869 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 00:44:10,874 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 00:44:10,896 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 00:44:10,923 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 00:44:10,924 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 00:44:10,924 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 00:44:10,924 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 00:44:10,924 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 00:44:10,924 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 00:44:10,924 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 00:44:10,925 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 00:44:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-12-23 00:44:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 00:44:10,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:10,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:10,948 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1563818866, now seen corresponding path program 1 times [2020-12-23 00:44:10,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:10,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760316309] [2020-12-23 00:44:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 00:44:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 00:44:11,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760316309] [2020-12-23 00:44:11,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 00:44:11,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 00:44:11,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148656234] [2020-12-23 00:44:11,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 00:44:11,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:11,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 00:44:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 00:44:11,293 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-12-23 00:44:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:11,316 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2020-12-23 00:44:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 00:44:11,318 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2020-12-23 00:44:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:11,344 INFO L225 Difference]: With dead ends: 53 [2020-12-23 00:44:11,344 INFO L226 Difference]: Without dead ends: 24 [2020-12-23 00:44:11,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 00:44:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-23 00:44:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-23 00:44:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-23 00:44:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-12-23 00:44:11,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2020-12-23 00:44:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:11,392 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-12-23 00:44:11,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 00:44:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-12-23 00:44:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 00:44:11,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:11,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:11,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 00:44:11,397 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2019195128, now seen corresponding path program 1 times [2020-12-23 00:44:11,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:11,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438505451] [2020-12-23 00:44:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 00:44:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 00:44:11,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438505451] [2020-12-23 00:44:11,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 00:44:11,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 00:44:11,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477800567] [2020-12-23 00:44:11,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 00:44:11,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 00:44:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 00:44:11,547 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2020-12-23 00:44:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:11,614 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2020-12-23 00:44:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 00:44:11,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-23 00:44:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:11,616 INFO L225 Difference]: With dead ends: 45 [2020-12-23 00:44:11,616 INFO L226 Difference]: Without dead ends: 26 [2020-12-23 00:44:11,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 00:44:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-23 00:44:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-12-23 00:44:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-23 00:44:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-12-23 00:44:11,623 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-12-23 00:44:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:11,623 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-12-23 00:44:11,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 00:44:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-12-23 00:44:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 00:44:11,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:11,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:11,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 00:44:11,625 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2143387046, now seen corresponding path program 1 times [2020-12-23 00:44:11,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:11,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043983439] [2020-12-23 00:44:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:11,646 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:44:11,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286163687] [2020-12-23 00:44:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 00:44:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 00:44:11,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:44:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 00:44:11,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043983439] [2020-12-23 00:44:11,813 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:44:11,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286163687] [2020-12-23 00:44:11,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 00:44:11,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 00:44:11,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895252778] [2020-12-23 00:44:11,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 00:44:11,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 00:44:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:11,817 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2020-12-23 00:44:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:11,875 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-12-23 00:44:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 00:44:11,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-23 00:44:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:11,877 INFO L225 Difference]: With dead ends: 47 [2020-12-23 00:44:11,877 INFO L226 Difference]: Without dead ends: 28 [2020-12-23 00:44:11,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-23 00:44:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-12-23 00:44:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-23 00:44:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-12-23 00:44:11,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2020-12-23 00:44:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:11,884 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-12-23 00:44:11,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 00:44:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-12-23 00:44:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 00:44:11,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:11,885 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:12,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 00:44:12,100 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash -524663612, now seen corresponding path program 2 times [2020-12-23 00:44:12,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:12,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333220318] [2020-12-23 00:44:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:12,120 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:44:12,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343101712] [2020-12-23 00:44:12,121 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:12,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 00:44:12,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 00:44:12,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 00:44:12,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:44:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 00:44:12,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333220318] [2020-12-23 00:44:12,265 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:44:12,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343101712] [2020-12-23 00:44:12,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 00:44:12,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 00:44:12,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174529765] [2020-12-23 00:44:12,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 00:44:12,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 00:44:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:12,273 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2020-12-23 00:44:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:12,363 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-12-23 00:44:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 00:44:12,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-23 00:44:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:12,366 INFO L225 Difference]: With dead ends: 49 [2020-12-23 00:44:12,366 INFO L226 Difference]: Without dead ends: 33 [2020-12-23 00:44:12,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-23 00:44:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-12-23 00:44:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-23 00:44:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-12-23 00:44:12,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-12-23 00:44:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:12,379 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-12-23 00:44:12,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 00:44:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-12-23 00:44:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 00:44:12,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:12,382 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:12,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:12,597 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:12,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash -187943454, now seen corresponding path program 1 times [2020-12-23 00:44:12,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:12,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973059784] [2020-12-23 00:44:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:12,617 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:44:12,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710892498] [2020-12-23 00:44:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 00:44:12,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 00:44:12,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:44:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 00:44:12,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973059784] [2020-12-23 00:44:12,769 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:44:12,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710892498] [2020-12-23 00:44:12,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 00:44:12,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 00:44:12,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379518860] [2020-12-23 00:44:12,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 00:44:12,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 00:44:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 00:44:12,772 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-12-23 00:44:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:12,842 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-12-23 00:44:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 00:44:12,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-23 00:44:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:12,844 INFO L225 Difference]: With dead ends: 57 [2020-12-23 00:44:12,844 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 00:44:12,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 00:44:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 00:44:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-12-23 00:44:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-23 00:44:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-12-23 00:44:12,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 28 [2020-12-23 00:44:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:12,854 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-12-23 00:44:12,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 00:44:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-12-23 00:44:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 00:44:12,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:12,856 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:13,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:13,072 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1916598400, now seen corresponding path program 2 times [2020-12-23 00:44:13,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:13,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348565222] [2020-12-23 00:44:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:13,096 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:44:13,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802659885] [2020-12-23 00:44:13,097 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 [2020-12-23 00:44:13,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 00:44:13,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 00:44:13,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 00:44:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:44:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 00:44:13,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348565222] [2020-12-23 00:44:13,199 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:44:13,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802659885] [2020-12-23 00:44:13,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 00:44:13,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 00:44:13,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197908498] [2020-12-23 00:44:13,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 00:44:13,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:44:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 00:44:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:13,202 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2020-12-23 00:44:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:44:13,250 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-12-23 00:44:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 00:44:13,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-23 00:44:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:44:13,251 INFO L225 Difference]: With dead ends: 49 [2020-12-23 00:44:13,252 INFO L226 Difference]: Without dead ends: 38 [2020-12-23 00:44:13,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 00:44:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-23 00:44:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-12-23 00:44:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-23 00:44:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-12-23 00:44:13,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2020-12-23 00:44:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:44:13,264 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-12-23 00:44:13,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 00:44:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-12-23 00:44:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 00:44:13,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:44:13,268 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:44:13,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:13,481 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:44:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:44:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 509646686, now seen corresponding path program 1 times [2020-12-23 00:44:13,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:44:13,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366619136] [2020-12-23 00:44:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:44:13,500 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:44:13,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235046989] [2020-12-23 00:44:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:44:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 00:44:14,002 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 89 conjunts are in the unsatisfiable core [2020-12-23 00:44:14,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:44:14,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:44:14,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:14,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:14,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:14,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:14,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,420 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 56 [2020-12-23 00:44:14,423 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:14,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2020-12-23 00:44:14,450 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:14,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,473 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 58 [2020-12-23 00:44:14,476 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:14,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,506 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2020-12-23 00:44:14,509 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:14,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,539 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2020-12-23 00:44:14,542 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:14,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:14,559 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 47 [2020-12-23 00:44:14,561 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:17,617 WARN L197 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-23 00:44:17,618 INFO L625 ElimStorePlain]: treesize reduction 65, result has 88.7 percent of original size [2020-12-23 00:44:17,622 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-12-23 00:44:17,623 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:729, output treesize:508 [2020-12-23 00:44:20,162 WARN L197 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 54 [2020-12-23 00:44:20,951 WARN L197 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 00:44:23,671 WARN L197 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 61 [2020-12-23 00:44:24,147 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-23 00:44:24,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 8, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-23 00:44:24,189 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-23 00:44:28,485 WARN L197 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2020-12-23 00:44:29,343 WARN L197 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-23 00:44:29,365 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-23 00:44:29,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,409 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 52 [2020-12-23 00:44:29,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:29,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2020-12-23 00:44:29,466 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:29,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2020-12-23 00:44:29,495 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:29,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,514 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 58 [2020-12-23 00:44:29,516 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:29,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 63 [2020-12-23 00:44:29,546 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:29,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:29,562 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 71 [2020-12-23 00:44:29,566 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:32,857 WARN L197 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2020-12-23 00:44:32,858 INFO L625 ElimStorePlain]: treesize reduction 15, result has 97.1 percent of original size [2020-12-23 00:44:32,862 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-12-23 00:44:32,863 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:695, output treesize:502 [2020-12-23 00:44:34,005 WARN L197 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-23 00:44:34,043 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-23 00:44:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,110 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 74 [2020-12-23 00:44:34,136 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,159 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 59 [2020-12-23 00:44:34,192 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:34,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,222 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2020-12-23 00:44:34,274 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:34,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,295 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 61 [2020-12-23 00:44:34,326 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,344 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,365 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 66 [2020-12-23 00:44:34,368 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:34,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:34,385 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:34,390 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 55 [2020-12-23 00:44:34,419 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:35,871 WARN L197 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 00:44:35,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:35,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-12-23 00:44:35,881 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:634, output treesize:641 [2020-12-23 00:44:36,571 WARN L197 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 00:44:43,933 WARN L197 SmtUtils]: Spent 7.22 s on a formula simplification that was a NOOP. DAG size: 61 [2020-12-23 00:44:46,861 WARN L197 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 00:44:46,983 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:46,986 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:46,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 46 [2020-12-23 00:44:46,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:47,653 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-23 00:44:47,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:47,670 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:47,674 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:47,675 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 53 [2020-12-23 00:44:47,676 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:50,298 WARN L197 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 105 [2020-12-23 00:44:50,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:50,321 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:50,324 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:50,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 42 [2020-12-23 00:44:50,326 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:50,769 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-23 00:44:50,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:50,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:50,804 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:50,807 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:50,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 48 [2020-12-23 00:44:50,810 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:51,181 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-23 00:44:51,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:51,193 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:51,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:44:51,198 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:51,199 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 61 [2020-12-23 00:44:51,202 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:51,580 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-23 00:44:51,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:51,590 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:44:51,592 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:51,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 40 [2020-12-23 00:44:51,596 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 00:44:51,753 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-23 00:44:51,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:44:51,757 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-12-23 00:44:51,757 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:648, output treesize:219 [2020-12-23 00:44:52,050 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-23 00:44:52,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:44:52,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:44:52,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:52,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,106 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,139 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,159 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,183 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,202 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,225 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:52,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,240 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,254 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,264 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,285 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,303 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,311 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:52,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:52,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,327 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,339 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,347 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,369 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,380 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,393 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,405 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,422 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,436 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,450 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,459 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,469 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:52,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,514 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,527 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:52,543 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,559 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,570 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,617 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,624 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,650 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,674 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,683 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,698 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,706 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,717 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:52,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,751 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,759 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:52,774 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,789 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,799 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,840 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,847 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:52,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,874 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,883 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,891 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,905 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,915 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,923 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:52,935 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:52,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,943 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,950 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:52,965 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,972 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:52,985 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:52,996 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,006 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,052 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,066 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,116 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,125 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,132 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:53,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,163 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,173 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,181 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,198 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,211 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,219 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:53,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,249 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,259 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:53,268 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,276 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,299 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,310 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,318 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:44:53,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:53,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,361 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,368 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,378 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,387 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,395 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,405 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:53,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,415 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,422 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,432 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,441 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,449 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,455 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:53,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:53,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,470 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,481 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,492 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,501 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,510 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,548 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,559 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,565 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,577 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,587 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,595 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,602 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:53,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,630 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,637 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:53,650 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,660 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,670 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,704 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,710 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,735 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,743 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,753 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,762 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,769 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,776 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:53,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,807 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,816 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:53,825 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,839 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,847 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,893 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,899 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:44:53,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,943 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,949 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,961 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,969 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:53,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,977 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,982 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:53,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:53,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:53,995 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,000 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,010 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:54,019 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,026 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,032 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:44:54,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:54,057 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,063 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:54,074 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,079 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,098 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,107 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,119 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:44:54,152 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:54,159 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,165 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:54,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:44:54,178 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,184 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 00:44:54,194 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,200 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,224 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,233 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:44:54,241 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,273 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,305 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:44:54,329 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-23 00:45:08,225 WARN L197 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2020-12-23 00:45:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 00:45:08,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366619136] [2020-12-23 00:45:08,866 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:45:08,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235046989] [2020-12-23 00:45:08,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 00:45:08,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-12-23 00:45:08,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014629877] [2020-12-23 00:45:08,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-23 00:45:08,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:45:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-23 00:45:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=486, Unknown=2, NotChecked=0, Total=552 [2020-12-23 00:45:08,868 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 24 states. [2020-12-23 00:45:14,974 WARN L197 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2020-12-23 00:45:18,304 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2020-12-23 00:45:21,226 WARN L197 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2020-12-23 00:45:22,187 WARN L197 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2020-12-23 00:45:30,737 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-23 00:45:39,304 WARN L197 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2020-12-23 00:45:57,179 WARN L197 SmtUtils]: Spent 16.52 s on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-12-23 00:46:09,423 WARN L197 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-12-23 00:46:17,041 WARN L197 SmtUtils]: Spent 7.15 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2020-12-23 00:46:24,741 WARN L197 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2020-12-23 00:46:31,795 WARN L197 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2020-12-23 00:46:42,305 WARN L197 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2020-12-23 00:47:10,977 WARN L197 SmtUtils]: Spent 26.62 s on a formula simplification. DAG size of input: 168 DAG size of output: 141 [2020-12-23 00:47:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:47:11,733 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2020-12-23 00:47:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 00:47:11,736 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2020-12-23 00:47:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:47:11,738 INFO L225 Difference]: With dead ends: 106 [2020-12-23 00:47:11,738 INFO L226 Difference]: Without dead ends: 101 [2020-12-23 00:47:11,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 142.4s TimeCoverageRelationStatistics Valid=244, Invalid=1555, Unknown=7, NotChecked=0, Total=1806 [2020-12-23 00:47:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-23 00:47:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 60. [2020-12-23 00:47:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-23 00:47:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2020-12-23 00:47:11,756 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2020-12-23 00:47:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:47:11,756 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2020-12-23 00:47:11,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-23 00:47:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2020-12-23 00:47:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 00:47:11,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:47:11,758 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:47:11,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 00:47:11,959 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:47:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:47:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1795298940, now seen corresponding path program 2 times [2020-12-23 00:47:11,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:47:11,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519037827] [2020-12-23 00:47:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:47:11,998 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:47:11,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078911163] [2020-12-23 00:47:12,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:47:12,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 00:47:12,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 00:47:12,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 00:47:12,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:47:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 00:47:12,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519037827] [2020-12-23 00:47:12,303 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 00:47:12,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078911163] [2020-12-23 00:47:12,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 00:47:12,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 00:47:12,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168262087] [2020-12-23 00:47:12,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 00:47:12,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 00:47:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 00:47:12,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 00:47:12,306 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 9 states. [2020-12-23 00:47:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 00:47:12,703 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2020-12-23 00:47:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 00:47:12,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-12-23 00:47:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 00:47:12,707 INFO L225 Difference]: With dead ends: 89 [2020-12-23 00:47:12,707 INFO L226 Difference]: Without dead ends: 40 [2020-12-23 00:47:12,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-23 00:47:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-23 00:47:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-12-23 00:47:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-23 00:47:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-12-23 00:47:12,715 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 38 [2020-12-23 00:47:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 00:47:12,715 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-12-23 00:47:12,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 00:47:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-12-23 00:47:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 00:47:12,716 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 00:47:12,716 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 00:47:12,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:47:12,930 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 00:47:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 00:47:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash 248734332, now seen corresponding path program 3 times [2020-12-23 00:47:12,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 00:47:12,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041305487] [2020-12-23 00:47:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 00:47:12,948 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 00:47:12,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608120857] [2020-12-23 00:47:12,949 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 00:47:13,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 00:47:13,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 00:47:13,427 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 87 conjunts are in the unsatisfiable core [2020-12-23 00:47:13,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 00:47:14,258 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-23 00:47:14,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:47:14,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:14,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:14,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:14,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:14,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 56 [2020-12-23 00:47:14,310 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:14,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,353 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 47 [2020-12-23 00:47:14,357 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:14,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,396 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 58 [2020-12-23 00:47:14,398 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,437 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2020-12-23 00:47:14,440 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:14,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,481 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2020-12-23 00:47:14,484 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:14,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:14,508 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2020-12-23 00:47:14,511 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 00:47:17,483 WARN L197 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 52 [2020-12-23 00:47:17,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 00:47:17,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-12-23 00:47:17,491 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:681, output treesize:525 [2020-12-23 00:47:18,735 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 52 [2020-12-23 00:47:19,990 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 00:47:20,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 11, 1] term [2020-12-23 00:47:20,008 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-23 00:47:21,172 WARN L197 SmtUtils]: Spent 975.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-23 00:47:24,275 WARN L197 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 52 [2020-12-23 00:47:24,287 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-23 00:47:25,583 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 00:47:25,594 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-23 00:47:27,595 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2020-12-23 00:47:27,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:47:27,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:47:27,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:27,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:27,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:27,618 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:27,656 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:27,699 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:27,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:27,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:27,753 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:27,782 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:27,825 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:27,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:27,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:27,928 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:27,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:27,957 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:27,986 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:28,060 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:28,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:28,090 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,118 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 00:47:28,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:28,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:28,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:28,309 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,334 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,379 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:28,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:28,436 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:28,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:28,461 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,487 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 00:47:28,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:28,587 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:28,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:28,613 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,636 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 00:47:28,696 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 6 disjuncts [2020-12-23 00:47:28,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 00:47:28,722 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:28,744 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 5 disjuncts [2020-12-23 00:47:29,301 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 2682 DAG size of output: 1378 [2020-12-23 00:47:31,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse305 (let ((.cse309 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse309 (+ |c_ULTIMATE.start_main_~#x~0.offset| 4)) (select .cse309 |c_ULTIMATE.start_main_~#x~0.offset|) 1)))) (let ((.cse308 (div .cse305 c_~N~0))) (let ((.cse8 (= (mod .cse305 c_~N~0) 0)) (.cse306 (mod (+ .cse308 1) 4294967296)) (.cse307 (+ c_ULTIMATE.start_main_~ret~1 4294967296)) (.cse304 (mod .cse308 4294967296))) (let ((.cse26 (< 2147483647 .cse304)) (.cse27 (= .cse307 .cse304)) (.cse72 (= .cse306 c_ULTIMATE.start_main_~ret~1)) (.cse73 (<= .cse306 2147483647)) (.cse52 (= .cse306 .cse307)) (.cse53 (< .cse305 0)) (.cse54 (not .cse8)) (.cse55 (< 2147483647 .cse306)) (.cse0 (= |c_ULTIMATE.start_main_~#x~0.offset| 0)) (.cse1 (< 1 c_~N~0)) (.cse9 (<= 0 .cse305)) (.cse2 (<= .cse304 2147483647)) (.cse7 (= c_ULTIMATE.start_main_~ret~1 .cse304))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_34 Int)) (let ((.cse3 (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_34 (select .cse6 (+ (* v_prenex_34 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse6 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse5 (div .cse3 c_~N~0))) (let ((.cse4 (mod (+ .cse5 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_34 1)) (not (= (mod .cse3 c_~N~0) 0)) (< 2147483647 .cse4) (< 2147483647 (mod .cse5 4294967296)) (<= v_prenex_34 1) (< .cse3 0) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse4)))))) .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 (exists ((v_prenex_20 Int)) (let ((.cse10 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_20 (select .cse13 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_20 4))) (select .cse13 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse12 (div .cse10 c_~N~0))) (let ((.cse11 (mod .cse12 4294967296))) (and (<= 0 .cse10) (<= .cse11 2147483647) (<= v_prenex_20 1) (= .cse11 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_20 1)) (<= (mod (+ .cse12 1) 4294967296) 2147483647)))))) .cse7) (and .cse0 .cse1 .cse9 .cse2 (exists ((v_prenex_61 Int)) (let ((.cse15 (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse17 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_61 4))) v_prenex_61 (select .cse17 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse16 (div .cse15 c_~N~0))) (let ((.cse14 (mod (+ .cse16 1) 4294967296))) (and (= |c_ULTIMATE.start_mapavg_#res| .cse14) (not (= (mod .cse15 c_~N~0) 0)) (< 2147483647 (mod .cse16 4294967296)) (<= v_prenex_61 1) (<= c_~N~0 (+ v_prenex_61 1)) (<= .cse14 2147483647) (< .cse15 0)))))) .cse7) (and (exists ((v_prenex_55 Int)) (let ((.cse19 (let ((.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse21 (+ (* v_prenex_55 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_55 (select .cse21 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse20 (div .cse19 c_~N~0))) (let ((.cse18 (mod .cse20 4294967296))) (and (= .cse18 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (< 2147483647 .cse18) (<= v_prenex_55 1) (<= c_~N~0 (+ v_prenex_55 1)) (<= 0 .cse19) (<= (mod (+ .cse20 1) 4294967296) 2147483647)))))) .cse0 .cse1 .cse9 .cse2 .cse7) (and (exists ((v_prenex_56 Int)) (let ((.cse23 (let ((.cse25 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_56 (select .cse25 (+ (* v_prenex_56 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse25 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse22 (div .cse23 c_~N~0))) (let ((.cse24 (mod .cse22 4294967296))) (and (< 2147483647 (mod (+ .cse22 1) 4294967296)) (<= v_prenex_56 1) (= (mod .cse23 c_~N~0) 0) (<= .cse24 2147483647) (= .cse24 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_56 1))))))) .cse0 .cse26 .cse1 .cse27 .cse8) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_22 Int)) (let ((.cse30 (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_22 (select .cse31 (+ (* v_prenex_22 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse31 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse28 (div .cse30 c_~N~0))) (let ((.cse29 (mod .cse28 4294967296))) (and (<= (mod (+ .cse28 1) 4294967296) 2147483647) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse29) (<= v_prenex_22 1) (= (mod .cse30 c_~N~0) 0) (< 2147483647 .cse29) (<= c_~N~0 (+ v_prenex_22 1))))))) .cse27) (and (exists ((v_prenex_30 Int)) (let ((.cse33 (let ((.cse35 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse35 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_30 4))) v_prenex_30 (select .cse35 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse32 (div .cse33 c_~N~0))) (let ((.cse34 (mod .cse32 4294967296))) (and (< 2147483647 (mod (+ .cse32 1) 4294967296)) (= (mod .cse33 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_30 1)) (< 2147483647 .cse34) (<= v_prenex_30 1) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse34)))))) .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse0 (exists ((v_prenex_27 Int)) (let ((.cse36 (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_27 (select .cse39 (+ (* v_prenex_27 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse39 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse37 (div .cse36 c_~N~0))) (let ((.cse38 (mod .cse37 4294967296))) (and (<= c_~N~0 (+ v_prenex_27 1)) (= (mod .cse36 c_~N~0) 0) (<= (mod (+ .cse37 1) 4294967296) 2147483647) (= .cse38 |c_ULTIMATE.start_mapavg_#res|) (<= .cse38 2147483647) (<= v_prenex_27 1)))))) .cse1 .cse9 .cse2 .cse7) (and (exists ((v_prenex_47 Int)) (let ((.cse42 (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_47 (select .cse43 (+ (* v_prenex_47 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse43 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse41 (div .cse42 c_~N~0))) (let ((.cse40 (mod .cse41 4294967296))) (and (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse40) (< 2147483647 (mod (+ .cse41 1) 4294967296)) (<= c_~N~0 (+ v_prenex_47 1)) (< 2147483647 .cse40) (= (mod .cse42 c_~N~0) 0) (<= v_prenex_47 1)))))) .cse0 .cse26 .cse1 .cse9 .cse27) (and (exists ((v_prenex_33 Int)) (let ((.cse44 (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_33 (select .cse47 (+ (* v_prenex_33 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse47 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse45 (div .cse44 c_~N~0))) (let ((.cse46 (mod (+ .cse45 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_33 1)) (< .cse44 0) (<= v_prenex_33 1) (<= (mod .cse45 4294967296) 2147483647) (= .cse46 |c_ULTIMATE.start_mapavg_#res|) (not (= (mod .cse44 c_~N~0) 0)) (<= .cse46 2147483647)))))) .cse0 .cse26 .cse1 .cse27 .cse8) (and (exists ((v_prenex_46 Int)) (let ((.cse48 (let ((.cse51 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_46 (select .cse51 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_46 4))) (select .cse51 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse50 (div .cse48 c_~N~0))) (let ((.cse49 (mod .cse50 4294967296))) (and (= (mod .cse48 c_~N~0) 0) (< 2147483647 .cse49) (<= (mod (+ .cse50 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_46 1)) (<= v_prenex_46 1) (= .cse49 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296))))))) .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_75 Int)) (let ((.cse58 (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse59 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_75 4))) v_prenex_75 (select .cse59 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse57 (div .cse58 c_~N~0))) (let ((.cse56 (mod .cse57 4294967296))) (and (= |c_ULTIMATE.start_mapavg_#res| .cse56) (< 2147483647 (mod (+ .cse57 1) 4294967296)) (<= 0 .cse58) (<= c_~N~0 (+ v_prenex_75 1)) (<= v_prenex_75 1) (<= .cse56 2147483647))))))) (and .cse0 .cse26 .cse1 (exists ((v_prenex_17 Int)) (let ((.cse60 (let ((.cse63 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_17 (select .cse63 (+ (* v_prenex_17 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse63 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse61 (div .cse60 c_~N~0))) (let ((.cse62 (mod .cse61 4294967296))) (and (= (mod .cse60 c_~N~0) 0) (< 2147483647 (mod (+ .cse61 1) 4294967296)) (< 2147483647 .cse62) (<= c_~N~0 (+ v_prenex_17 1)) (<= v_prenex_17 1) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse62)))))) .cse27 .cse8) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_52 Int)) (let ((.cse64 (let ((.cse67 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_52 (select .cse67 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_52 4))) (select .cse67 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse66 (div .cse64 c_~N~0))) (let ((.cse65 (mod .cse66 4294967296))) (and (<= 0 .cse64) (<= c_~N~0 (+ v_prenex_52 1)) (<= v_prenex_52 1) (< 2147483647 .cse65) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse65) (< 2147483647 (mod (+ .cse66 1) 4294967296)))))))) (and .cse53 (exists ((v_prenex_54 Int)) (let ((.cse69 (let ((.cse71 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse71 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_54 4))) v_prenex_54 (select .cse71 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse70 (div .cse69 c_~N~0))) (let ((.cse68 (mod .cse70 4294967296))) (and (<= v_prenex_54 1) (= |c_ULTIMATE.start_mapavg_#res| .cse68) (<= c_~N~0 (+ v_prenex_54 1)) (= (mod .cse69 c_~N~0) 0) (<= .cse68 2147483647) (< 2147483647 (mod (+ .cse70 1) 4294967296))))))) .cse0 .cse1 .cse54 .cse72 .cse73) (and .cse0 .cse26 .cse1 (exists ((v_prenex_43 Int)) (let ((.cse75 (let ((.cse77 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_43 (select .cse77 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_43 4))) (select .cse77 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse76 (div .cse75 c_~N~0))) (let ((.cse74 (mod .cse76 4294967296))) (and (<= c_~N~0 (+ v_prenex_43 1)) (= .cse74 |c_ULTIMATE.start_mapavg_#res|) (<= v_prenex_43 1) (<= .cse74 2147483647) (<= 0 .cse75) (<= (mod (+ .cse76 1) 4294967296) 2147483647)))))) .cse27 .cse8) (and .cse52 .cse53 .cse0 .cse1 .cse54 (exists ((v_prenex_74 Int)) (let ((.cse79 (let ((.cse81 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse81 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_74 4))) v_prenex_74 (select .cse81 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse78 (div .cse79 c_~N~0))) (let ((.cse80 (mod .cse78 4294967296))) (and (< 2147483647 (mod (+ .cse78 1) 4294967296)) (<= c_~N~0 (+ v_prenex_74 1)) (<= v_prenex_74 1) (= (mod .cse79 c_~N~0) 0) (= .cse80 |c_ULTIMATE.start_mapavg_#res|) (<= .cse80 2147483647)))))) .cse55) (and .cse0 .cse26 .cse1 (exists ((v_prenex_38 Int)) (let ((.cse83 (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_38 (select .cse85 (+ (* v_prenex_38 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse85 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse84 (div .cse83 c_~N~0))) (let ((.cse82 (mod .cse84 4294967296))) (and (= .cse82 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= v_prenex_38 1) (<= 0 .cse83) (<= c_~N~0 (+ v_prenex_38 1)) (< 2147483647 .cse82) (< 2147483647 (mod (+ .cse84 1) 4294967296))))))) .cse27 .cse8) (and .cse0 .cse26 .cse1 .cse9 .cse27 (exists ((v_prenex_78 Int)) (let ((.cse87 (let ((.cse89 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse89 (+ (* v_prenex_78 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_78 (select .cse89 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse86 (div .cse87 c_~N~0))) (let ((.cse88 (mod .cse86 4294967296))) (and (<= v_prenex_78 1) (< 2147483647 (mod (+ .cse86 1) 4294967296)) (<= 0 .cse87) (<= .cse88 2147483647) (<= c_~N~0 (+ v_prenex_78 1)) (= .cse88 |c_ULTIMATE.start_mapavg_#res|))))))) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_29 Int)) (let ((.cse90 (let ((.cse93 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_29 (select .cse93 (+ (* v_prenex_29 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse93 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse92 (div .cse90 c_~N~0))) (let ((.cse91 (mod (+ .cse92 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_29 1)) (<= v_prenex_29 1) (not (= (mod .cse90 c_~N~0) 0)) (< .cse90 0) (< 2147483647 .cse91) (<= (mod .cse92 4294967296) 2147483647) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse91))))))) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_77 Int)) (let ((.cse96 (let ((.cse97 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse97 (+ (* v_prenex_77 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_77 (select .cse97 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse94 (div .cse96 c_~N~0))) (let ((.cse95 (mod .cse94 4294967296))) (and (< 2147483647 (mod (+ .cse94 1) 4294967296)) (<= v_prenex_77 1) (<= c_~N~0 (+ v_prenex_77 1)) (= .cse95 |c_ULTIMATE.start_mapavg_#res|) (<= .cse95 2147483647) (<= 0 .cse96))))))) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_50 Int)) (let ((.cse98 (let ((.cse101 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse101 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_50 4))) v_prenex_50 (select .cse101 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse100 (div .cse98 c_~N~0))) (let ((.cse99 (mod .cse100 4294967296))) (and (<= c_~N~0 (+ v_prenex_50 1)) (<= v_prenex_50 1) (<= 0 .cse98) (= .cse99 |c_ULTIMATE.start_mapavg_#res|) (<= (mod (+ .cse100 1) 4294967296) 2147483647) (<= .cse99 2147483647)))))) .cse27) (and .cse52 .cse53 .cse0 .cse1 .cse54 (exists ((v_prenex_44 Int)) (let ((.cse103 (let ((.cse105 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse105 (+ (* v_prenex_44 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_44 (select .cse105 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse104 (div .cse103 c_~N~0))) (let ((.cse102 (mod (+ .cse104 1) 4294967296))) (and (<= v_prenex_44 1) (= |c_ULTIMATE.start_mapavg_#res| .cse102) (< .cse103 0) (<= .cse102 2147483647) (<= (mod .cse104 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_44 1)) (not (= (mod .cse103 c_~N~0) 0))))))) .cse55) (and .cse0 (exists ((v_prenex_35 Int)) (let ((.cse108 (let ((.cse109 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_35 (select .cse109 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_35 4))) (select .cse109 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse107 (div .cse108 c_~N~0))) (let ((.cse106 (mod .cse107 4294967296))) (and (= .cse106 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= (mod (+ .cse107 1) 4294967296) 2147483647) (< 2147483647 .cse106) (<= 0 .cse108) (<= v_prenex_35 1) (<= c_~N~0 (+ v_prenex_35 1))))))) .cse26 .cse1 .cse27 .cse8) (and .cse0 .cse1 (exists ((v_prenex_45 Int)) (let ((.cse111 (let ((.cse113 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_45 (select .cse113 (+ (* v_prenex_45 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse113 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse110 (div .cse111 c_~N~0))) (let ((.cse112 (mod (+ .cse110 1) 4294967296))) (and (<= (mod .cse110 4294967296) 2147483647) (< .cse111 0) (<= v_prenex_45 1) (not (= (mod .cse111 c_~N~0) 0)) (<= .cse112 2147483647) (= .cse112 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_45 1))))))) .cse9 .cse2 .cse7) (and .cse0 .cse26 .cse1 .cse27 (exists ((v_prenex_70 Int)) (let ((.cse115 (let ((.cse117 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse117 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_70 4))) v_prenex_70 (select .cse117 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse114 (div .cse115 c_~N~0))) (let ((.cse116 (mod .cse114 4294967296))) (and (<= (mod (+ .cse114 1) 4294967296) 2147483647) (= (mod .cse115 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_70 1)) (<= v_prenex_70 1) (= .cse116 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (< 2147483647 .cse116)))))) .cse8) (and .cse0 .cse1 (exists ((v_prenex_65 Int)) (let ((.cse118 (let ((.cse121 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_65 (select .cse121 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_65 4))) (select .cse121 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse120 (div .cse118 c_~N~0))) (let ((.cse119 (mod .cse120 4294967296))) (and (<= v_prenex_65 1) (<= 0 .cse118) (< 2147483647 .cse119) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse119) (<= c_~N~0 (+ v_prenex_65 1)) (< 2147483647 (mod (+ .cse120 1) 4294967296))))))) .cse9 .cse2 .cse7) (and .cse0 .cse1 (exists ((v_prenex_87 Int)) (let ((.cse122 (let ((.cse125 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse125 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_87 4))) v_prenex_87 (select .cse125 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse123 (div .cse122 c_~N~0))) (let ((.cse124 (mod .cse123 4294967296))) (and (<= 0 .cse122) (< 2147483647 (mod (+ .cse123 1) 4294967296)) (<= v_prenex_87 1) (<= .cse124 2147483647) (= .cse124 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_87 1))))))) .cse2 .cse7 .cse8) (and .cse0 .cse1 (exists ((v_prenex_40 Int)) (let ((.cse126 (let ((.cse129 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse129 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_40 4))) v_prenex_40 (select .cse129 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse128 (div .cse126 c_~N~0))) (let ((.cse127 (mod .cse128 4294967296))) (and (<= 0 .cse126) (< 2147483647 .cse127) (<= c_~N~0 (+ v_prenex_40 1)) (<= (mod (+ .cse128 1) 4294967296) 2147483647) (<= v_prenex_40 1) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse127)))))) .cse2 .cse7 .cse8) (and .cse0 .cse26 .cse1 .cse27 (exists ((v_prenex_67 Int)) (let ((.cse131 (let ((.cse133 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse133 (+ (* v_prenex_67 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_67 (select .cse133 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse132 (div .cse131 c_~N~0))) (let ((.cse130 (mod (+ .cse132 1) 4294967296))) (and (< 2147483647 .cse130) (< .cse131 0) (<= c_~N~0 (+ v_prenex_67 1)) (not (= (mod .cse131 c_~N~0) 0)) (<= v_prenex_67 1) (<= (mod .cse132 4294967296) 2147483647) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse130)))))) .cse8) (and .cse52 .cse53 .cse0 .cse1 .cse54 (exists ((v_prenex_48 Int)) (let ((.cse134 (let ((.cse137 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_48 (select .cse137 (+ (* v_prenex_48 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse137 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse136 (div .cse134 c_~N~0))) (let ((.cse135 (mod (+ .cse136 1) 4294967296))) (and (< .cse134 0) (<= c_~N~0 (+ v_prenex_48 1)) (<= .cse135 2147483647) (< 2147483647 (mod .cse136 4294967296)) (<= v_prenex_48 1) (not (= (mod .cse134 c_~N~0) 0)) (= .cse135 |c_ULTIMATE.start_mapavg_#res|)))))) .cse55) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_59 Int)) (let ((.cse139 (let ((.cse141 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_59 (select .cse141 (+ (* v_prenex_59 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse141 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse140 (div .cse139 c_~N~0))) (let ((.cse138 (mod (+ .cse140 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_59 1)) (<= .cse138 2147483647) (< .cse139 0) (<= (mod .cse140 4294967296) 2147483647) (= .cse138 |c_ULTIMATE.start_mapavg_#res|) (not (= (mod .cse139 c_~N~0) 0)) (<= v_prenex_59 1)))))) .cse27) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_28 Int)) (let ((.cse144 (let ((.cse145 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_28 (select .cse145 (+ (* v_prenex_28 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse145 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse142 (div .cse144 c_~N~0))) (let ((.cse143 (mod .cse142 4294967296))) (and (<= c_~N~0 (+ v_prenex_28 1)) (<= (mod (+ .cse142 1) 4294967296) 2147483647) (< 2147483647 .cse143) (= (mod .cse144 c_~N~0) 0) (<= v_prenex_28 1) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse143))))))) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_19 Int)) (let ((.cse146 (let ((.cse149 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse149 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_19 4))) v_prenex_19 (select .cse149 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse147 (div .cse146 c_~N~0))) (let ((.cse148 (mod .cse147 4294967296))) (and (<= c_~N~0 (+ v_prenex_19 1)) (<= 0 .cse146) (<= (mod (+ .cse147 1) 4294967296) 2147483647) (= .cse148 |c_ULTIMATE.start_mapavg_#res|) (<= v_prenex_19 1) (<= .cse148 2147483647))))))) (and .cse53 .cse0 .cse1 (exists ((v_prenex_76 Int)) (let ((.cse150 (let ((.cse153 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse153 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_76 4))) v_prenex_76 (select .cse153 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse152 (div .cse150 c_~N~0))) (let ((.cse151 (mod (+ .cse152 1) 4294967296))) (and (not (= (mod .cse150 c_~N~0) 0)) (= .cse151 |c_ULTIMATE.start_mapavg_#res|) (< .cse150 0) (<= .cse151 2147483647) (<= v_prenex_76 1) (<= (mod .cse152 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_76 1))))))) .cse54 .cse72 .cse73) (and .cse53 (exists ((v_prenex_82 Int)) (let ((.cse154 (let ((.cse157 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse157 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_82 4))) v_prenex_82 (select .cse157 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse156 (div .cse154 c_~N~0))) (let ((.cse155 (mod .cse156 4294967296))) (and (= (mod .cse154 c_~N~0) 0) (<= v_prenex_82 1) (< 2147483647 .cse155) (<= (mod (+ .cse156 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_82 1)) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse155)))))) .cse0 .cse1 .cse54 .cse72 .cse73) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_42 Int)) (let ((.cse158 (let ((.cse161 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse161 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_42 4))) v_prenex_42 (select .cse161 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse159 (div .cse158 c_~N~0))) (let ((.cse160 (mod .cse159 4294967296))) (and (= (mod .cse158 c_~N~0) 0) (<= (mod (+ .cse159 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_42 1)) (<= v_prenex_42 1) (<= .cse160 2147483647) (= .cse160 |c_ULTIMATE.start_mapavg_#res|))))))) (and .cse0 .cse1 .cse9 .cse2 (exists ((v_prenex_39 Int)) (let ((.cse163 (let ((.cse165 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_39 (select .cse165 (+ (* v_prenex_39 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse165 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse164 (div .cse163 c_~N~0))) (let ((.cse162 (mod .cse164 4294967296))) (and (= .cse162 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (< 2147483647 .cse162) (<= c_~N~0 (+ v_prenex_39 1)) (= (mod .cse163 c_~N~0) 0) (< 2147483647 (mod (+ .cse164 1) 4294967296)) (<= v_prenex_39 1)))))) .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse7 (exists ((v_prenex_86 Int)) (let ((.cse168 (let ((.cse169 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse169 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_86 4))) v_prenex_86 (select .cse169 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse167 (div .cse168 c_~N~0))) (let ((.cse166 (mod .cse167 4294967296))) (and (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse166) (<= v_prenex_86 1) (<= c_~N~0 (+ v_prenex_86 1)) (< 2147483647 .cse166) (<= (mod (+ .cse167 1) 4294967296) 2147483647) (= (mod .cse168 c_~N~0) 0))))))) (and (exists ((v_prenex_18 Int)) (let ((.cse171 (let ((.cse173 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_18 (select .cse173 (+ (* v_prenex_18 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse173 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse172 (div .cse171 c_~N~0))) (let ((.cse170 (mod (+ .cse172 1) 4294967296))) (and (< 2147483647 .cse170) (not (= (mod .cse171 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_18 1)) (< .cse171 0) (<= v_prenex_18 1) (= .cse170 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= (mod .cse172 4294967296) 2147483647)))))) .cse0 .cse26 .cse1 .cse9 .cse27) (and .cse0 .cse26 .cse1 .cse27 .cse8 (exists ((v_prenex_66 Int)) (let ((.cse175 (let ((.cse177 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_66 (select .cse177 (+ (* v_prenex_66 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse177 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse174 (div .cse175 c_~N~0))) (let ((.cse176 (mod .cse174 4294967296))) (and (< 2147483647 (mod (+ .cse174 1) 4294967296)) (<= 0 .cse175) (<= .cse176 2147483647) (= .cse176 |c_ULTIMATE.start_mapavg_#res|) (<= v_prenex_66 1) (<= c_~N~0 (+ v_prenex_66 1)))))))) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_21 Int)) (let ((.cse178 (let ((.cse181 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_21 (select .cse181 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_21 4))) (select .cse181 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse179 (div .cse178 c_~N~0))) (let ((.cse180 (mod .cse179 4294967296))) (and (= (mod .cse178 c_~N~0) 0) (<= v_prenex_21 1) (<= c_~N~0 (+ v_prenex_21 1)) (< 2147483647 (mod (+ .cse179 1) 4294967296)) (< 2147483647 .cse180) (= .cse180 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)))))))) (and (exists ((v_ULTIMATE.start_mapavg_~i~0_31 Int)) (let ((.cse182 (let ((.cse185 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_ULTIMATE.start_mapavg_~i~0_31 (select .cse185 (+ (* v_ULTIMATE.start_mapavg_~i~0_31 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse185 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse184 (div .cse182 c_~N~0))) (let ((.cse183 (mod (+ .cse184 1) 4294967296))) (and (< .cse182 0) (<= v_ULTIMATE.start_mapavg_~i~0_31 1) (< 2147483647 .cse183) (not (= (mod .cse182 c_~N~0) 0)) (<= (mod .cse184 4294967296) 2147483647) (<= c_~N~0 (+ v_ULTIMATE.start_mapavg_~i~0_31 1)) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse183)))))) .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_24 Int)) (let ((.cse186 (let ((.cse189 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse189 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_24 4))) v_prenex_24 (select .cse189 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse188 (div .cse186 c_~N~0))) (let ((.cse187 (mod (+ .cse188 1) 4294967296))) (and (not (= (mod .cse186 c_~N~0) 0)) (<= .cse187 2147483647) (< .cse186 0) (<= c_~N~0 (+ v_prenex_24 1)) (<= v_prenex_24 1) (< 2147483647 (mod .cse188 4294967296)) (= .cse187 |c_ULTIMATE.start_mapavg_#res|)))))) .cse27) (and .cse0 .cse26 .cse1 (exists ((v_prenex_71 Int)) (let ((.cse191 (let ((.cse193 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse193 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_71 4))) v_prenex_71 (select .cse193 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse192 (div .cse191 c_~N~0))) (let ((.cse190 (mod .cse192 4294967296))) (and (<= c_~N~0 (+ v_prenex_71 1)) (= .cse190 |c_ULTIMATE.start_mapavg_#res|) (= (mod .cse191 c_~N~0) 0) (<= (mod (+ .cse192 1) 4294967296) 2147483647) (<= .cse190 2147483647) (<= v_prenex_71 1)))))) .cse27 .cse8) (and .cse0 (exists ((v_prenex_49 Int)) (let ((.cse196 (let ((.cse197 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_49 (select .cse197 (+ (* v_prenex_49 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse197 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse194 (div .cse196 c_~N~0))) (let ((.cse195 (mod (+ .cse194 1) 4294967296))) (and (< 2147483647 (mod .cse194 4294967296)) (< 2147483647 .cse195) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse195) (not (= (mod .cse196 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_49 1)) (<= v_prenex_49 1) (< .cse196 0)))))) .cse26 .cse1 .cse9 .cse27) (and (exists ((v_prenex_84 Int)) (let ((.cse200 (let ((.cse201 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse201 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_84 4))) v_prenex_84 (select .cse201 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse199 (div .cse200 c_~N~0))) (let ((.cse198 (mod .cse199 4294967296))) (and (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse198) (< 2147483647 (mod (+ .cse199 1) 4294967296)) (< 2147483647 .cse198) (<= c_~N~0 (+ v_prenex_84 1)) (<= v_prenex_84 1) (<= 0 .cse200)))))) .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_62 Int)) (let ((.cse202 (let ((.cse205 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse205 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_62 4))) v_prenex_62 (select .cse205 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse204 (div .cse202 c_~N~0))) (let ((.cse203 (mod .cse204 4294967296))) (and (<= c_~N~0 (+ v_prenex_62 1)) (= (mod .cse202 c_~N~0) 0) (<= .cse203 2147483647) (<= v_prenex_62 1) (= .cse203 |c_ULTIMATE.start_mapavg_#res|) (<= (mod (+ .cse204 1) 4294967296) 2147483647))))))) (and .cse52 .cse53 .cse0 .cse1 .cse54 .cse55 (exists ((v_prenex_57 Int)) (let ((.cse208 (let ((.cse209 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse209 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_57 4))) v_prenex_57 (select .cse209 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse206 (div .cse208 c_~N~0))) (let ((.cse207 (mod .cse206 4294967296))) (and (<= c_~N~0 (+ v_prenex_57 1)) (<= v_prenex_57 1) (< 2147483647 (mod (+ .cse206 1) 4294967296)) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse207) (< 2147483647 .cse207) (= (mod .cse208 c_~N~0) 0))))))) (and .cse0 .cse1 (exists ((v_prenex_37 Int)) (let ((.cse211 (let ((.cse213 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_37 (select .cse213 (+ (* v_prenex_37 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse213 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse212 (div .cse211 c_~N~0))) (let ((.cse210 (mod .cse212 4294967296))) (and (<= v_prenex_37 1) (<= c_~N~0 (+ v_prenex_37 1)) (<= .cse210 2147483647) (= (mod .cse211 c_~N~0) 0) (= .cse210 |c_ULTIMATE.start_mapavg_#res|) (< 2147483647 (mod (+ .cse212 1) 4294967296))))))) .cse2 .cse7 .cse8) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_85 Int)) (let ((.cse216 (let ((.cse217 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse217 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_85 4))) v_prenex_85 (select .cse217 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse215 (div .cse216 c_~N~0))) (let ((.cse214 (mod .cse215 4294967296))) (and (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse214) (<= v_prenex_85 1) (<= (mod (+ .cse215 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_85 1)) (<= 0 .cse216) (< 2147483647 .cse214))))))) (and .cse53 .cse0 .cse1 .cse54 .cse72 (exists ((v_prenex_26 Int)) (let ((.cse219 (let ((.cse221 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_26 (select .cse221 (+ (* v_prenex_26 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse221 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse220 (div .cse219 c_~N~0))) (let ((.cse218 (mod .cse220 4294967296))) (and (= .cse218 |c_ULTIMATE.start_mapavg_#res|) (<= 0 .cse219) (<= c_~N~0 (+ v_prenex_26 1)) (<= (mod (+ .cse220 1) 4294967296) 2147483647) (<= .cse218 2147483647) (<= v_prenex_26 1)))))) .cse73) (and (exists ((v_prenex_60 Int)) (let ((.cse224 (let ((.cse225 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse225 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_60 4))) v_prenex_60 (select .cse225 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse223 (div .cse224 c_~N~0))) (let ((.cse222 (mod (+ .cse223 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_60 1)) (< 2147483647 .cse222) (<= v_prenex_60 1) (= .cse222 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (< 2147483647 (mod .cse223 4294967296)) (not (= (mod .cse224 c_~N~0) 0)) (< .cse224 0)))))) .cse0 .cse26 .cse1 .cse27 .cse8) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_41 Int)) (let ((.cse227 (let ((.cse229 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse229 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_41 4))) v_prenex_41 (select .cse229 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse228 (div .cse227 c_~N~0))) (let ((.cse226 (mod .cse228 4294967296))) (and (<= v_prenex_41 1) (= .cse226 |c_ULTIMATE.start_mapavg_#res|) (= (mod .cse227 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_41 1)) (<= .cse226 2147483647) (<= (mod (+ .cse228 1) 4294967296) 2147483647)))))) .cse27) (and .cse0 .cse1 (exists ((v_prenex_69 Int)) (let ((.cse232 (let ((.cse233 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_69 (select .cse233 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_69 4))) (select .cse233 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse230 (div .cse232 c_~N~0))) (let ((.cse231 (mod .cse230 4294967296))) (and (< 2147483647 (mod (+ .cse230 1) 4294967296)) (= .cse231 |c_ULTIMATE.start_mapavg_#res|) (<= v_prenex_69 1) (<= 0 .cse232) (<= .cse231 2147483647) (<= c_~N~0 (+ v_prenex_69 1))))))) .cse9 .cse2 .cse7) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_68 Int)) (let ((.cse234 (let ((.cse237 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_68 (select .cse237 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_68 4))) (select .cse237 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse236 (div .cse234 c_~N~0))) (let ((.cse235 (mod (+ .cse236 1) 4294967296))) (and (<= v_prenex_68 1) (< .cse234 0) (< 2147483647 .cse235) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse235) (<= c_~N~0 (+ v_prenex_68 1)) (< 2147483647 (mod .cse236 4294967296)) (not (= (mod .cse234 c_~N~0) 0)))))))) (and .cse0 .cse1 .cse2 .cse7 .cse8 (exists ((v_prenex_23 Int)) (let ((.cse238 (let ((.cse241 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_23 (select .cse241 (+ (* v_prenex_23 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse241 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse239 (div .cse238 c_~N~0))) (let ((.cse240 (mod (+ .cse239 1) 4294967296))) (and (< .cse238 0) (<= v_prenex_23 1) (not (= 0 (mod .cse238 c_~N~0))) (< 2147483647 (mod .cse239 4294967296)) (= .cse240 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_23 1)) (<= .cse240 2147483647))))))) (and .cse0 .cse1 .cse2 (exists ((v_prenex_36 Int)) (let ((.cse242 (let ((.cse245 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse245 (+ (* v_prenex_36 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_36 (select .cse245 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse244 (div .cse242 c_~N~0))) (let ((.cse243 (mod .cse244 4294967296))) (and (= (mod .cse242 c_~N~0) 0) (<= .cse243 2147483647) (<= (mod (+ .cse244 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_36 1)) (= .cse243 |c_ULTIMATE.start_mapavg_#res|) (<= v_prenex_36 1)))))) .cse7 .cse8) (and .cse53 .cse0 (exists ((v_prenex_80 Int)) (let ((.cse247 (let ((.cse249 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse249 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_80 4))) v_prenex_80 (select .cse249 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse246 (div .cse247 c_~N~0))) (let ((.cse248 (mod (+ .cse246 1) 4294967296))) (and (<= v_prenex_80 1) (< 2147483647 (mod .cse246 4294967296)) (not (= (mod .cse247 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_80 1)) (<= .cse248 2147483647) (< .cse247 0) (= |c_ULTIMATE.start_mapavg_#res| .cse248)))))) .cse1 .cse54 .cse72 .cse73) (and .cse0 .cse26 .cse1 .cse9 .cse27 (exists ((v_prenex_25 Int)) (let ((.cse250 (let ((.cse253 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_25 (select .cse253 (+ (* v_prenex_25 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse253 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse251 (div .cse250 c_~N~0))) (let ((.cse252 (mod .cse251 4294967296))) (and (= (mod .cse250 c_~N~0) 0) (< 2147483647 (mod (+ .cse251 1) 4294967296)) (<= v_prenex_25 1) (= .cse252 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_25 1)) (<= .cse252 2147483647))))))) (and (exists ((v_prenex_51 Int)) (let ((.cse259 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (let ((.cse254 (select .cse259 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_51 4)))) (.cse255 (select .cse259 |c_ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse258 (+ v_prenex_51 .cse254 .cse255))) (let ((.cse257 (div .cse258 c_~N~0))) (let ((.cse256 (mod (+ .cse257 1) 4294967296))) (and (<= v_prenex_51 1) (< (+ .cse254 v_prenex_51 .cse255) 0) (= .cse256 |c_ULTIMATE.start_mapavg_#res|) (<= c_~N~0 (+ v_prenex_51 1)) (< 2147483647 (mod .cse257 4294967296)) (<= .cse256 2147483647) (not (= (mod .cse258 c_~N~0) 0))))))))) .cse0 .cse26 .cse1 .cse27 .cse8) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_83 Int)) (let ((.cse261 (let ((.cse263 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse263 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_83 4))) v_prenex_83 (select .cse263 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse262 (div .cse261 c_~N~0))) (let ((.cse260 (mod .cse262 4294967296))) (and (<= c_~N~0 (+ v_prenex_83 1)) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse260) (<= 0 .cse261) (< 2147483647 .cse260) (<= (mod (+ .cse262 1) 4294967296) 2147483647) (<= v_prenex_83 1)))))) .cse27) (and .cse52 .cse53 .cse0 .cse1 .cse54 (exists ((v_prenex_81 Int)) (let ((.cse266 (let ((.cse267 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse267 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_81 4))) v_prenex_81 (select .cse267 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse264 (div .cse266 c_~N~0))) (let ((.cse265 (mod .cse264 4294967296))) (and (<= (mod (+ .cse264 1) 4294967296) 2147483647) (< 2147483647 .cse265) (<= v_prenex_81 1) (<= 0 .cse266) (= .cse265 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= c_~N~0 (+ v_prenex_81 1))))))) .cse55) (and .cse53 .cse0 .cse1 .cse54 .cse72 .cse73 (exists ((v_prenex_32 Int)) (let ((.cse270 (let ((.cse271 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse271 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_32 4))) v_prenex_32 (select .cse271 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse268 (div .cse270 c_~N~0))) (let ((.cse269 (mod (+ .cse268 1) 4294967296))) (and (<= (mod .cse268 4294967296) 2147483647) (= .cse269 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= v_prenex_32 1) (<= c_~N~0 (+ v_prenex_32 1)) (< .cse270 0) (< 2147483647 .cse269) (not (= (mod .cse270 c_~N~0) 0)))))))) (and .cse0 .cse1 (exists ((v_prenex_64 Int)) (let ((.cse273 (let ((.cse275 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse275 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_64 4))) v_prenex_64 (select .cse275 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse274 (div .cse273 c_~N~0))) (let ((.cse272 (mod (+ .cse274 1) 4294967296))) (and (= .cse272 |c_ULTIMATE.start_mapavg_#res|) (not (= (mod .cse273 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_64 1)) (<= v_prenex_64 1) (<= (mod .cse274 4294967296) 2147483647) (< .cse273 0) (<= .cse272 2147483647)))))) .cse2 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 (exists ((v_prenex_58 Int)) (let ((.cse276 (let ((.cse279 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_58 (select .cse279 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_58 4))) (select .cse279 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse277 (div .cse276 c_~N~0))) (let ((.cse278 (mod (+ .cse277 1) 4294967296))) (and (< .cse276 0) (<= v_prenex_58 1) (< 2147483647 (mod .cse277 4294967296)) (< 2147483647 .cse278) (<= c_~N~0 (+ v_prenex_58 1)) (= .cse278 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (not (= (mod .cse276 c_~N~0) 0))))))) .cse7) (and (exists ((v_prenex_73 Int)) (let ((.cse281 (let ((.cse283 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_73 (select .cse283 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_73 4))) (select .cse283 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse280 (div .cse281 c_~N~0))) (let ((.cse282 (mod .cse280 4294967296))) (and (<= v_prenex_73 1) (<= c_~N~0 (+ v_prenex_73 1)) (<= (mod (+ .cse280 1) 4294967296) 2147483647) (<= 0 .cse281) (<= .cse282 2147483647) (= .cse282 |c_ULTIMATE.start_mapavg_#res|)))))) .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse0 .cse26 .cse1 .cse9 (exists ((v_prenex_79 Int)) (let ((.cse286 (let ((.cse287 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_79 (select .cse287 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_79 4))) (select .cse287 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse284 (div .cse286 c_~N~0))) (let ((.cse285 (mod .cse284 4294967296))) (and (< 2147483647 (mod (+ .cse284 1) 4294967296)) (<= v_prenex_79 1) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse285) (< 2147483647 .cse285) (<= c_~N~0 (+ v_prenex_79 1)) (<= 0 .cse286)))))) .cse27) (and .cse53 (exists ((v_prenex_53 Int)) (let ((.cse289 (let ((.cse291 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_53 (select .cse291 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_53 4))) (select .cse291 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse290 (div .cse289 c_~N~0))) (let ((.cse288 (mod .cse290 4294967296))) (and (= .cse288 (+ |c_ULTIMATE.start_mapavg_#res| 4294967296)) (<= 0 .cse289) (< 2147483647 .cse288) (<= c_~N~0 (+ v_prenex_53 1)) (< 2147483647 (mod (+ .cse290 1) 4294967296)) (<= v_prenex_53 1)))))) .cse0 .cse1 .cse54 .cse72 .cse73) (and (exists ((v_prenex_63 Int)) (let ((.cse292 (let ((.cse295 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse295 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_63 4))) v_prenex_63 (select .cse295 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse294 (div .cse292 c_~N~0))) (let ((.cse293 (mod .cse294 4294967296))) (and (= (mod .cse292 c_~N~0) 0) (= .cse293 |c_ULTIMATE.start_mapavg_#res|) (< 2147483647 (mod (+ .cse294 1) 4294967296)) (<= .cse293 2147483647) (<= v_prenex_63 1) (<= c_~N~0 (+ v_prenex_63 1))))))) .cse0 .cse1 .cse9 .cse2 .cse7) (and .cse52 .cse53 .cse0 (exists ((v_prenex_72 Int)) (let ((.cse298 (let ((.cse299 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse299 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_72 4))) v_prenex_72 (select .cse299 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse296 (div .cse298 c_~N~0))) (let ((.cse297 (mod (+ .cse296 1) 4294967296))) (and (<= v_prenex_72 1) (< 2147483647 (mod .cse296 4294967296)) (< 2147483647 .cse297) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse297) (<= c_~N~0 (+ v_prenex_72 1)) (< .cse298 0) (not (= (mod .cse298 c_~N~0) 0))))))) .cse1 .cse54 .cse55) (and .cse0 .cse1 .cse9 .cse2 (exists ((v_prenex_31 Int)) (let ((.cse302 (let ((.cse303 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse303 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_31 4))) v_prenex_31 (select .cse303 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse301 (div .cse302 c_~N~0))) (let ((.cse300 (mod (+ .cse301 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_31 1)) (< 2147483647 .cse300) (<= (mod .cse301 4294967296) 2147483647) (= (+ |c_ULTIMATE.start_mapavg_#res| 4294967296) .cse300) (not (= (mod .cse302 c_~N~0) 0)) (<= v_prenex_31 1) (< .cse302 0)))))) .cse7)))))) is different from false [2020-12-23 00:47:34,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse312 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (let ((.cse308 (select .cse312 |c_ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse309 (+ (select .cse312 (+ |c_ULTIMATE.start_main_~#x~0.offset| 4)) .cse308 1))) (let ((.cse311 (div .cse309 c_~N~0))) (let ((.cse23 (= (mod .cse309 c_~N~0) 0)) (.cse307 (mod .cse311 4294967296)) (.cse310 (mod (+ .cse311 1) 4294967296)) (.cse306 (+ c_ULTIMATE.start_main_~ret~1 4294967296))) (let ((.cse48 (= .cse310 .cse306)) (.cse49 (< 2147483647 .cse310)) (.cse4 (<= .cse307 2147483647)) (.cse10 (= c_ULTIMATE.start_main_~ret~1 .cse307)) (.cse28 (< .cse309 0)) (.cse29 (not .cse23)) (.cse30 (= .cse310 c_ULTIMATE.start_main_~ret~1)) (.cse31 (<= .cse310 2147483647)) (.cse0 (= c_ULTIMATE.start_main_~i~2 0)) (.cse1 (= |c_ULTIMATE.start_main_~#x~0.offset| 0)) (.cse11 (< 2147483647 .cse307)) (.cse2 (< 1 c_~N~0)) (.cse3 (<= 0 .cse309)) (.cse5 (= .cse308 c_ULTIMATE.start_main_~temp~0)) (.cse12 (= .cse306 .cse307))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_31 Int)) (let ((.cse8 (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_31 4))) v_prenex_31 (select .cse9 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse7 (div .cse8 c_~N~0))) (let ((.cse6 (mod (+ .cse7 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_31 1)) (< 2147483647 .cse6) (<= (mod .cse7 4294967296) 2147483647) (not (= (mod .cse8 c_~N~0) 0)) (<= v_prenex_31 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse6) (< .cse8 0)))))) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse12 (exists ((v_prenex_47 Int)) (let ((.cse15 (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_47 (select .cse16 (+ (* v_prenex_47 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse16 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse13 (div .cse15 c_~N~0))) (let ((.cse14 (mod .cse13 4294967296))) (and (< 2147483647 (mod (+ .cse13 1) 4294967296)) (<= c_~N~0 (+ v_prenex_47 1)) (< 2147483647 .cse14) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse14) (= (mod .cse15 c_~N~0) 0) (<= v_prenex_47 1))))))) (and .cse0 .cse1 .cse11 .cse2 .cse5 .cse12 (exists ((v_prenex_51 Int)) (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (let ((.cse17 (select .cse22 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_51 4)))) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse21 (+ v_prenex_51 .cse17 .cse18))) (let ((.cse19 (div .cse21 c_~N~0))) (let ((.cse20 (mod (+ .cse19 1) 4294967296))) (and (<= v_prenex_51 1) (< (+ .cse17 v_prenex_51 .cse18) 0) (<= c_~N~0 (+ v_prenex_51 1)) (< 2147483647 (mod .cse19 4294967296)) (<= .cse20 2147483647) (not (= (mod .cse21 c_~N~0) 0)) (= .cse20 c_ULTIMATE.start_main_~ret2~0)))))))) .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse12 (exists ((v_prenex_25 Int)) (let ((.cse24 (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_25 (select .cse27 (+ (* v_prenex_25 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse27 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse25 (div .cse24 c_~N~0))) (let ((.cse26 (mod .cse25 4294967296))) (and (= (mod .cse24 c_~N~0) 0) (< 2147483647 (mod (+ .cse25 1) 4294967296)) (<= v_prenex_25 1) (= c_ULTIMATE.start_main_~ret2~0 .cse26) (<= c_~N~0 (+ v_prenex_25 1)) (<= .cse26 2147483647))))))) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 .cse31 (exists ((v_prenex_80 Int)) (let ((.cse33 (let ((.cse35 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse35 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_80 4))) v_prenex_80 (select .cse35 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse32 (div .cse33 c_~N~0))) (let ((.cse34 (mod (+ .cse32 1) 4294967296))) (and (<= v_prenex_80 1) (< 2147483647 (mod .cse32 4294967296)) (not (= (mod .cse33 c_~N~0) 0)) (= c_ULTIMATE.start_main_~ret2~0 .cse34) (<= c_~N~0 (+ v_prenex_80 1)) (<= .cse34 2147483647) (< .cse33 0))))))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse23 (exists ((v_prenex_34 Int)) (let ((.cse37 (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_34 (select .cse39 (+ (* v_prenex_34 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse39 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse38 (div .cse37 c_~N~0))) (let ((.cse36 (mod (+ .cse38 1) 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse36) (<= c_~N~0 (+ v_prenex_34 1)) (not (= (mod .cse37 c_~N~0) 0)) (< 2147483647 .cse36) (< 2147483647 (mod .cse38 4294967296)) (<= v_prenex_34 1) (< .cse37 0))))))) (and .cse28 .cse0 (exists ((v_prenex_21 Int)) (let ((.cse40 (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_21 (select .cse43 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_21 4))) (select .cse43 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse41 (div .cse40 c_~N~0))) (let ((.cse42 (mod .cse41 4294967296))) (and (= (mod .cse40 c_~N~0) 0) (<= v_prenex_21 1) (<= c_~N~0 (+ v_prenex_21 1)) (< 2147483647 (mod (+ .cse41 1) 4294967296)) (< 2147483647 .cse42) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse42)))))) .cse1 .cse2 .cse29 .cse30 .cse5 .cse31) (and .cse28 .cse0 (exists ((v_prenex_54 Int)) (let ((.cse45 (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse47 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_54 4))) v_prenex_54 (select .cse47 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse46 (div .cse45 c_~N~0))) (let ((.cse44 (mod .cse46 4294967296))) (and (= c_ULTIMATE.start_main_~ret2~0 .cse44) (<= v_prenex_54 1) (<= c_~N~0 (+ v_prenex_54 1)) (= (mod .cse45 c_~N~0) 0) (<= .cse44 2147483647) (< 2147483647 (mod (+ .cse46 1) 4294967296))))))) .cse1 .cse2 .cse29 .cse30 .cse5 .cse31) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_28 Int)) (let ((.cse52 (let ((.cse53 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_28 (select .cse53 (+ (* v_prenex_28 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse53 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse50 (div .cse52 c_~N~0))) (let ((.cse51 (mod .cse50 4294967296))) (and (<= c_~N~0 (+ v_prenex_28 1)) (<= (mod (+ .cse50 1) 4294967296) 2147483647) (< 2147483647 .cse51) (= (mod .cse52 c_~N~0) 0) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse51) (<= v_prenex_28 1))))))) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 (exists ((v_prenex_68 Int)) (let ((.cse55 (let ((.cse57 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_68 (select .cse57 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_68 4))) (select .cse57 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse56 (div .cse55 c_~N~0))) (let ((.cse54 (mod (+ .cse56 1) 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse54) (<= v_prenex_68 1) (< .cse55 0) (< 2147483647 .cse54) (<= c_~N~0 (+ v_prenex_68 1)) (< 2147483647 (mod .cse56 4294967296)) (not (= (mod .cse55 c_~N~0) 0))))))) .cse31) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 .cse31 (exists ((v_prenex_32 Int)) (let ((.cse60 (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse61 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_32 4))) v_prenex_32 (select .cse61 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse58 (div .cse60 c_~N~0))) (let ((.cse59 (mod (+ .cse58 1) 4294967296))) (and (<= (mod .cse58 4294967296) 2147483647) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse59) (<= v_prenex_32 1) (<= c_~N~0 (+ v_prenex_32 1)) (< .cse60 0) (< 2147483647 .cse59) (not (= (mod .cse60 c_~N~0) 0)))))))) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 (exists ((v_prenex_74 Int)) (let ((.cse64 (let ((.cse65 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse65 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_74 4))) v_prenex_74 (select .cse65 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse62 (div .cse64 c_~N~0))) (let ((.cse63 (mod .cse62 4294967296))) (and (< 2147483647 (mod (+ .cse62 1) 4294967296)) (<= c_~N~0 (+ v_prenex_74 1)) (<= v_prenex_74 1) (= c_ULTIMATE.start_main_~ret2~0 .cse63) (= (mod .cse64 c_~N~0) 0) (<= .cse63 2147483647)))))) .cse49) (and .cse0 .cse1 .cse11 .cse2 .cse5 (exists ((v_prenex_38 Int)) (let ((.cse67 (let ((.cse69 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_38 (select .cse69 (+ (* v_prenex_38 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse69 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse68 (div .cse67 c_~N~0))) (let ((.cse66 (mod .cse68 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse66) (<= v_prenex_38 1) (<= 0 .cse67) (<= c_~N~0 (+ v_prenex_38 1)) (< 2147483647 .cse66) (< 2147483647 (mod (+ .cse68 1) 4294967296))))))) .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_63 Int)) (let ((.cse70 (let ((.cse73 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse73 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_63 4))) v_prenex_63 (select .cse73 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse72 (div .cse70 c_~N~0))) (let ((.cse71 (mod .cse72 4294967296))) (and (= (mod .cse70 c_~N~0) 0) (= .cse71 c_ULTIMATE.start_main_~ret2~0) (< 2147483647 (mod (+ .cse72 1) 4294967296)) (<= .cse71 2147483647) (<= v_prenex_63 1) (<= c_~N~0 (+ v_prenex_63 1))))))) .cse10) (and .cse48 .cse28 .cse0 (exists ((v_prenex_48 Int)) (let ((.cse74 (let ((.cse77 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_48 (select .cse77 (+ (* v_prenex_48 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse77 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse76 (div .cse74 c_~N~0))) (let ((.cse75 (mod (+ .cse76 1) 4294967296))) (and (< .cse74 0) (<= c_~N~0 (+ v_prenex_48 1)) (<= .cse75 2147483647) (< 2147483647 (mod .cse76 4294967296)) (<= v_prenex_48 1) (not (= (mod .cse74 c_~N~0) 0)) (= .cse75 c_ULTIMATE.start_main_~ret2~0)))))) .cse1 .cse2 .cse29 .cse5 .cse49) (and .cse0 .cse1 (exists ((v_prenex_36 Int)) (let ((.cse78 (let ((.cse81 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse81 (+ (* v_prenex_36 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_36 (select .cse81 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse80 (div .cse78 c_~N~0))) (let ((.cse79 (mod .cse80 4294967296))) (and (= (mod .cse78 c_~N~0) 0) (<= .cse79 2147483647) (= .cse79 c_ULTIMATE.start_main_~ret2~0) (<= (mod (+ .cse80 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_36 1)) (<= v_prenex_36 1)))))) .cse2 .cse4 .cse5 .cse10 .cse23) (and (exists ((v_prenex_67 Int)) (let ((.cse83 (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse85 (+ (* v_prenex_67 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_67 (select .cse85 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse84 (div .cse83 c_~N~0))) (let ((.cse82 (mod (+ .cse84 1) 4294967296))) (and (< 2147483647 .cse82) (< .cse83 0) (<= c_~N~0 (+ v_prenex_67 1)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse82) (not (= (mod .cse83 c_~N~0) 0)) (<= v_prenex_67 1) (<= (mod .cse84 4294967296) 2147483647)))))) .cse0 .cse1 .cse11 .cse2 .cse5 .cse12 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 .cse31 (exists ((v_prenex_42 Int)) (let ((.cse86 (let ((.cse89 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse89 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_42 4))) v_prenex_42 (select .cse89 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse88 (div .cse86 c_~N~0))) (let ((.cse87 (mod .cse88 4294967296))) (and (= (mod .cse86 c_~N~0) 0) (= c_ULTIMATE.start_main_~ret2~0 .cse87) (<= (mod (+ .cse88 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_42 1)) (<= v_prenex_42 1) (<= .cse87 2147483647))))))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (exists ((v_prenex_37 Int)) (let ((.cse91 (let ((.cse93 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_37 (select .cse93 (+ (* v_prenex_37 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse93 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse92 (div .cse91 c_~N~0))) (let ((.cse90 (mod .cse92 4294967296))) (and (<= v_prenex_37 1) (<= c_~N~0 (+ v_prenex_37 1)) (= .cse90 c_ULTIMATE.start_main_~ret2~0) (<= .cse90 2147483647) (= (mod .cse91 c_~N~0) 0) (< 2147483647 (mod (+ .cse92 1) 4294967296))))))) .cse10 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_20 Int)) (let ((.cse94 (let ((.cse97 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_20 (select .cse97 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_20 4))) (select .cse97 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse96 (div .cse94 c_~N~0))) (let ((.cse95 (mod .cse96 4294967296))) (and (<= 0 .cse94) (<= .cse95 2147483647) (= .cse95 c_ULTIMATE.start_main_~ret2~0) (<= v_prenex_20 1) (<= c_~N~0 (+ v_prenex_20 1)) (<= (mod (+ .cse96 1) 4294967296) 2147483647)))))) .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 (exists ((v_prenex_23 Int)) (let ((.cse99 (let ((.cse101 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_23 (select .cse101 (+ (* v_prenex_23 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse101 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse100 (div .cse99 c_~N~0))) (let ((.cse98 (mod (+ .cse100 1) 4294967296))) (and (= .cse98 c_ULTIMATE.start_main_~ret2~0) (< .cse99 0) (<= v_prenex_23 1) (not (= 0 (mod .cse99 c_~N~0))) (< 2147483647 (mod .cse100 4294967296)) (<= c_~N~0 (+ v_prenex_23 1)) (<= .cse98 2147483647)))))) .cse23) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_52 Int)) (let ((.cse102 (let ((.cse105 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_52 (select .cse105 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_52 4))) (select .cse105 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse104 (div .cse102 c_~N~0))) (let ((.cse103 (mod .cse104 4294967296))) (and (<= 0 .cse102) (<= c_~N~0 (+ v_prenex_52 1)) (<= v_prenex_52 1) (< 2147483647 .cse103) (< 2147483647 (mod (+ .cse104 1) 4294967296)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse103))))))) (and .cse0 (exists ((v_prenex_22 Int)) (let ((.cse108 (let ((.cse109 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_22 (select .cse109 (+ (* v_prenex_22 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse109 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse107 (div .cse108 c_~N~0))) (let ((.cse106 (mod .cse107 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse106) (<= (mod (+ .cse107 1) 4294967296) 2147483647) (<= v_prenex_22 1) (= (mod .cse108 c_~N~0) 0) (< 2147483647 .cse106) (<= c_~N~0 (+ v_prenex_22 1))))))) .cse1 .cse11 .cse2 .cse3 .cse5 .cse12) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_44 Int)) (let ((.cse110 (let ((.cse113 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse113 (+ (* v_prenex_44 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_44 (select .cse113 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse112 (div .cse110 c_~N~0))) (let ((.cse111 (mod (+ .cse112 1) 4294967296))) (and (<= v_prenex_44 1) (< .cse110 0) (<= .cse111 2147483647) (<= (mod .cse112 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_44 1)) (not (= (mod .cse110 c_~N~0) 0)) (= c_ULTIMATE.start_main_~ret2~0 .cse111))))))) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 (exists ((v_prenex_78 Int)) (let ((.cse115 (let ((.cse117 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse117 (+ (* v_prenex_78 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_78 (select .cse117 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse114 (div .cse115 c_~N~0))) (let ((.cse116 (mod .cse114 4294967296))) (and (<= v_prenex_78 1) (< 2147483647 (mod (+ .cse114 1) 4294967296)) (<= 0 .cse115) (<= .cse116 2147483647) (<= c_~N~0 (+ v_prenex_78 1)) (= c_ULTIMATE.start_main_~ret2~0 .cse116)))))) .cse12) (and .cse0 .cse1 (exists ((v_prenex_30 Int)) (let ((.cse119 (let ((.cse121 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse121 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_30 4))) v_prenex_30 (select .cse121 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse118 (div .cse119 c_~N~0))) (let ((.cse120 (mod .cse118 4294967296))) (and (< 2147483647 (mod (+ .cse118 1) 4294967296)) (= (mod .cse119 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_30 1)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse120) (< 2147483647 .cse120) (<= v_prenex_30 1)))))) .cse2 .cse4 .cse5 .cse10 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 (exists ((v_prenex_46 Int)) (let ((.cse122 (let ((.cse125 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_46 (select .cse125 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_46 4))) (select .cse125 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse124 (div .cse122 c_~N~0))) (let ((.cse123 (mod .cse124 4294967296))) (and (= (mod .cse122 c_~N~0) 0) (< 2147483647 .cse123) (<= (mod (+ .cse124 1) 4294967296) 2147483647) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse123) (<= c_~N~0 (+ v_prenex_46 1)) (<= v_prenex_46 1)))))) .cse10 .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse5 (exists ((v_prenex_17 Int)) (let ((.cse126 (let ((.cse129 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_17 (select .cse129 (+ (* v_prenex_17 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse129 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse127 (div .cse126 c_~N~0))) (let ((.cse128 (mod .cse127 4294967296))) (and (= (mod .cse126 c_~N~0) 0) (< 2147483647 (mod (+ .cse127 1) 4294967296)) (< 2147483647 .cse128) (<= c_~N~0 (+ v_prenex_17 1)) (<= v_prenex_17 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse128)))))) .cse12 .cse23) (and (exists ((v_prenex_61 Int)) (let ((.cse131 (let ((.cse133 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse133 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_61 4))) v_prenex_61 (select .cse133 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse132 (div .cse131 c_~N~0))) (let ((.cse130 (mod (+ .cse132 1) 4294967296))) (and (= c_ULTIMATE.start_main_~ret2~0 .cse130) (not (= (mod .cse131 c_~N~0) 0)) (< 2147483647 (mod .cse132 4294967296)) (<= v_prenex_61 1) (<= c_~N~0 (+ v_prenex_61 1)) (<= .cse130 2147483647) (< .cse131 0)))))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_29 Int)) (let ((.cse134 (let ((.cse137 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_29 (select .cse137 (+ (* v_prenex_29 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse137 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse136 (div .cse134 c_~N~0))) (let ((.cse135 (mod (+ .cse136 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_29 1)) (<= v_prenex_29 1) (not (= (mod .cse134 c_~N~0) 0)) (< .cse134 0) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse135) (< 2147483647 .cse135) (<= (mod .cse136 4294967296) 2147483647))))))) (and .cse0 .cse1 .cse2 (exists ((v_prenex_45 Int)) (let ((.cse139 (let ((.cse141 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_45 (select .cse141 (+ (* v_prenex_45 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse141 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse138 (div .cse139 c_~N~0))) (let ((.cse140 (mod (+ .cse138 1) 4294967296))) (and (<= (mod .cse138 4294967296) 2147483647) (< .cse139 0) (<= v_prenex_45 1) (not (= (mod .cse139 c_~N~0) 0)) (= .cse140 c_ULTIMATE.start_main_~ret2~0) (<= .cse140 2147483647) (<= c_~N~0 (+ v_prenex_45 1))))))) .cse3 .cse4 .cse5 .cse10) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 .cse31 (exists ((v_prenex_85 Int)) (let ((.cse143 (let ((.cse145 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse145 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_85 4))) v_prenex_85 (select .cse145 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse142 (div .cse143 c_~N~0))) (let ((.cse144 (mod .cse142 4294967296))) (and (<= v_prenex_85 1) (<= (mod (+ .cse142 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_85 1)) (<= 0 .cse143) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse144) (< 2147483647 .cse144))))))) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 (exists ((v_prenex_62 Int)) (let ((.cse147 (let ((.cse149 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse149 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_62 4))) v_prenex_62 (select .cse149 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse148 (div .cse147 c_~N~0))) (let ((.cse146 (mod .cse148 4294967296))) (and (= .cse146 c_ULTIMATE.start_main_~ret2~0) (<= c_~N~0 (+ v_prenex_62 1)) (= (mod .cse147 c_~N~0) 0) (<= .cse146 2147483647) (<= v_prenex_62 1) (<= (mod (+ .cse148 1) 4294967296) 2147483647)))))) .cse5 .cse49) (and .cse28 .cse0 .cse1 .cse2 (exists ((v_prenex_76 Int)) (let ((.cse150 (let ((.cse153 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse153 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_76 4))) v_prenex_76 (select .cse153 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse152 (div .cse150 c_~N~0))) (let ((.cse151 (mod (+ .cse152 1) 4294967296))) (and (not (= (mod .cse150 c_~N~0) 0)) (< .cse150 0) (= c_ULTIMATE.start_main_~ret2~0 .cse151) (<= .cse151 2147483647) (<= v_prenex_76 1) (<= (mod .cse152 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_76 1))))))) .cse29 .cse30 .cse5 .cse31) (and .cse48 .cse28 .cse0 .cse1 (exists ((v_prenex_81 Int)) (let ((.cse156 (let ((.cse157 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse157 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_81 4))) v_prenex_81 (select .cse157 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse154 (div .cse156 c_~N~0))) (let ((.cse155 (mod .cse154 4294967296))) (and (<= (mod (+ .cse154 1) 4294967296) 2147483647) (< 2147483647 .cse155) (<= v_prenex_81 1) (<= 0 .cse156) (<= c_~N~0 (+ v_prenex_81 1)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse155)))))) .cse2 .cse29 .cse5 .cse49) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 (exists ((v_prenex_26 Int)) (let ((.cse158 (let ((.cse161 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_26 (select .cse161 (+ (* v_prenex_26 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse161 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse159 (div .cse158 c_~N~0))) (let ((.cse160 (mod .cse159 4294967296))) (and (<= 0 .cse158) (<= c_~N~0 (+ v_prenex_26 1)) (<= (mod (+ .cse159 1) 4294967296) 2147483647) (= c_ULTIMATE.start_main_~ret2~0 .cse160) (<= .cse160 2147483647) (<= v_prenex_26 1)))))) .cse5 .cse31) (and .cse48 .cse28 .cse0 .cse1 .cse2 (exists ((v_prenex_75 Int)) (let ((.cse163 (let ((.cse165 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse165 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_75 4))) v_prenex_75 (select .cse165 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse162 (div .cse163 c_~N~0))) (let ((.cse164 (mod .cse162 4294967296))) (and (< 2147483647 (mod (+ .cse162 1) 4294967296)) (<= 0 .cse163) (<= c_~N~0 (+ v_prenex_75 1)) (= c_ULTIMATE.start_main_~ret2~0 .cse164) (<= v_prenex_75 1) (<= .cse164 2147483647)))))) .cse29 .cse5 .cse49) (and .cse0 .cse1 .cse2 (exists ((v_ULTIMATE.start_mapavg_~i~0_31 Int)) (let ((.cse166 (let ((.cse169 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_ULTIMATE.start_mapavg_~i~0_31 (select .cse169 (+ (* v_ULTIMATE.start_mapavg_~i~0_31 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse169 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse168 (div .cse166 c_~N~0))) (let ((.cse167 (mod (+ .cse168 1) 4294967296))) (and (< .cse166 0) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse167) (<= v_ULTIMATE.start_mapavg_~i~0_31 1) (< 2147483647 .cse167) (not (= (mod .cse166 c_~N~0) 0)) (<= (mod .cse168 4294967296) 2147483647) (<= c_~N~0 (+ v_ULTIMATE.start_mapavg_~i~0_31 1))))))) .cse4 .cse5 .cse10 .cse23) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 (exists ((v_prenex_19 Int)) (let ((.cse170 (let ((.cse173 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse173 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_19 4))) v_prenex_19 (select .cse173 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse171 (div .cse170 c_~N~0))) (let ((.cse172 (mod .cse171 4294967296))) (and (<= c_~N~0 (+ v_prenex_19 1)) (<= 0 .cse170) (<= (mod (+ .cse171 1) 4294967296) 2147483647) (= .cse172 c_ULTIMATE.start_main_~ret2~0) (<= v_prenex_19 1) (<= .cse172 2147483647)))))) .cse5 .cse49) (and .cse0 (exists ((v_prenex_70 Int)) (let ((.cse175 (let ((.cse177 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse177 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_70 4))) v_prenex_70 (select .cse177 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse174 (div .cse175 c_~N~0))) (let ((.cse176 (mod .cse174 4294967296))) (and (<= (mod (+ .cse174 1) 4294967296) 2147483647) (= (mod .cse175 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_70 1)) (<= v_prenex_70 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse176) (< 2147483647 .cse176)))))) .cse1 .cse11 .cse2 .cse5 .cse12 .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse3 (exists ((v_prenex_59 Int)) (let ((.cse179 (let ((.cse181 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_59 (select .cse181 (+ (* v_prenex_59 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse181 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse180 (div .cse179 c_~N~0))) (let ((.cse178 (mod (+ .cse180 1) 4294967296))) (and (= c_ULTIMATE.start_main_~ret2~0 .cse178) (<= c_~N~0 (+ v_prenex_59 1)) (<= .cse178 2147483647) (< .cse179 0) (<= (mod .cse180 4294967296) 2147483647) (not (= (mod .cse179 c_~N~0) 0)) (<= v_prenex_59 1)))))) .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_27 Int)) (let ((.cse183 (let ((.cse185 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_27 (select .cse185 (+ (* v_prenex_27 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse185 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse184 (div .cse183 c_~N~0))) (let ((.cse182 (mod .cse184 4294967296))) (and (= c_ULTIMATE.start_main_~ret2~0 .cse182) (<= c_~N~0 (+ v_prenex_27 1)) (= (mod .cse183 c_~N~0) 0) (<= (mod (+ .cse184 1) 4294967296) 2147483647) (<= .cse182 2147483647) (<= v_prenex_27 1)))))) .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 (exists ((v_prenex_73 Int)) (let ((.cse187 (let ((.cse189 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_73 (select .cse189 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_73 4))) (select .cse189 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse186 (div .cse187 c_~N~0))) (let ((.cse188 (mod .cse186 4294967296))) (and (<= v_prenex_73 1) (<= c_~N~0 (+ v_prenex_73 1)) (<= (mod (+ .cse186 1) 4294967296) 2147483647) (<= 0 .cse187) (= c_ULTIMATE.start_main_~ret2~0 .cse188) (<= .cse188 2147483647)))))) .cse10 .cse23) (and .cse0 .cse1 (exists ((v_prenex_39 Int)) (let ((.cse191 (let ((.cse193 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_39 (select .cse193 (+ (* v_prenex_39 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse193 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse192 (div .cse191 c_~N~0))) (let ((.cse190 (mod .cse192 4294967296))) (and (< 2147483647 .cse190) (<= c_~N~0 (+ v_prenex_39 1)) (= (mod .cse191 c_~N~0) 0) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse190) (< 2147483647 (mod (+ .cse192 1) 4294967296)) (<= v_prenex_39 1)))))) .cse2 .cse3 .cse4 .cse5 .cse10) (and .cse0 .cse1 (exists ((v_prenex_66 Int)) (let ((.cse195 (let ((.cse197 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_66 (select .cse197 (+ (* v_prenex_66 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse197 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse194 (div .cse195 c_~N~0))) (let ((.cse196 (mod .cse194 4294967296))) (and (< 2147483647 (mod (+ .cse194 1) 4294967296)) (<= 0 .cse195) (= c_ULTIMATE.start_main_~ret2~0 .cse196) (<= .cse196 2147483647) (<= v_prenex_66 1) (<= c_~N~0 (+ v_prenex_66 1))))))) .cse11 .cse2 .cse5 .cse12 .cse23) (and .cse0 .cse1 .cse2 (exists ((v_prenex_65 Int)) (let ((.cse198 (let ((.cse201 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_65 (select .cse201 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_65 4))) (select .cse201 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse200 (div .cse198 c_~N~0))) (let ((.cse199 (mod .cse200 4294967296))) (and (<= v_prenex_65 1) (<= 0 .cse198) (< 2147483647 .cse199) (<= c_~N~0 (+ v_prenex_65 1)) (< 2147483647 (mod (+ .cse200 1) 4294967296)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse199)))))) .cse3 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 (exists ((v_prenex_58 Int)) (let ((.cse202 (let ((.cse205 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_58 (select .cse205 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_58 4))) (select .cse205 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse204 (div .cse202 c_~N~0))) (let ((.cse203 (mod (+ .cse204 1) 4294967296))) (and (< .cse202 0) (<= v_prenex_58 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse203) (< 2147483647 (mod .cse204 4294967296)) (< 2147483647 .cse203) (<= c_~N~0 (+ v_prenex_58 1)) (not (= (mod .cse202 c_~N~0) 0)))))))) (and (exists ((v_prenex_56 Int)) (let ((.cse207 (let ((.cse209 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_56 (select .cse209 (+ (* v_prenex_56 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse209 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse206 (div .cse207 c_~N~0))) (let ((.cse208 (mod .cse206 4294967296))) (and (< 2147483647 (mod (+ .cse206 1) 4294967296)) (<= v_prenex_56 1) (= (mod .cse207 c_~N~0) 0) (= .cse208 c_ULTIMATE.start_main_~ret2~0) (<= .cse208 2147483647) (<= c_~N~0 (+ v_prenex_56 1))))))) .cse0 .cse1 .cse11 .cse2 .cse5 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 (exists ((v_prenex_64 Int)) (let ((.cse210 (let ((.cse213 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse213 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_64 4))) v_prenex_64 (select .cse213 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse211 (div .cse210 c_~N~0))) (let ((.cse212 (mod (+ .cse211 1) 4294967296))) (and (not (= (mod .cse210 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_64 1)) (<= v_prenex_64 1) (<= (mod .cse211 4294967296) 2147483647) (< .cse210 0) (= c_ULTIMATE.start_main_~ret2~0 .cse212) (<= .cse212 2147483647)))))) .cse10 .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse12 (exists ((v_prenex_50 Int)) (let ((.cse215 (let ((.cse217 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse217 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_50 4))) v_prenex_50 (select .cse217 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse216 (div .cse215 c_~N~0))) (let ((.cse214 (mod .cse216 4294967296))) (and (= .cse214 c_ULTIMATE.start_main_~ret2~0) (<= c_~N~0 (+ v_prenex_50 1)) (<= v_prenex_50 1) (<= 0 .cse215) (<= (mod (+ .cse216 1) 4294967296) 2147483647) (<= .cse214 2147483647))))))) (and .cse0 (exists ((v_prenex_87 Int)) (let ((.cse218 (let ((.cse221 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse221 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_87 4))) v_prenex_87 (select .cse221 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse219 (div .cse218 c_~N~0))) (let ((.cse220 (mod .cse219 4294967296))) (and (<= 0 .cse218) (< 2147483647 (mod (+ .cse219 1) 4294967296)) (= c_ULTIMATE.start_main_~ret2~0 .cse220) (<= v_prenex_87 1) (<= .cse220 2147483647) (<= c_~N~0 (+ v_prenex_87 1))))))) .cse1 .cse2 .cse4 .cse5 .cse10 .cse23) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_57 Int)) (let ((.cse224 (let ((.cse225 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse225 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_57 4))) v_prenex_57 (select .cse225 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse223 (div .cse224 c_~N~0))) (let ((.cse222 (mod .cse223 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse222) (<= c_~N~0 (+ v_prenex_57 1)) (<= v_prenex_57 1) (< 2147483647 (mod (+ .cse223 1) 4294967296)) (< 2147483647 .cse222) (= (mod .cse224 c_~N~0) 0))))))) (and .cse0 .cse1 .cse2 (exists ((v_prenex_86 Int)) (let ((.cse228 (let ((.cse229 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse229 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_86 4))) v_prenex_86 (select .cse229 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse227 (div .cse228 c_~N~0))) (let ((.cse226 (mod .cse227 4294967296))) (and (<= v_prenex_86 1) (<= c_~N~0 (+ v_prenex_86 1)) (< 2147483647 .cse226) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse226) (<= (mod (+ .cse227 1) 4294967296) 2147483647) (= (mod .cse228 c_~N~0) 0)))))) .cse3 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse5 (exists ((v_prenex_71 Int)) (let ((.cse231 (let ((.cse233 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse233 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_71 4))) v_prenex_71 (select .cse233 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse232 (div .cse231 c_~N~0))) (let ((.cse230 (mod .cse232 4294967296))) (and (<= c_~N~0 (+ v_prenex_71 1)) (= c_ULTIMATE.start_main_~ret2~0 .cse230) (= (mod .cse231 c_~N~0) 0) (<= (mod (+ .cse232 1) 4294967296) 2147483647) (<= .cse230 2147483647) (<= v_prenex_71 1)))))) .cse12 .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 (exists ((v_prenex_41 Int)) (let ((.cse234 (let ((.cse237 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse237 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_41 4))) v_prenex_41 (select .cse237 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse236 (div .cse234 c_~N~0))) (let ((.cse235 (mod .cse236 4294967296))) (and (<= v_prenex_41 1) (= (mod .cse234 c_~N~0) 0) (<= c_~N~0 (+ v_prenex_41 1)) (<= .cse235 2147483647) (<= (mod (+ .cse236 1) 4294967296) 2147483647) (= c_ULTIMATE.start_main_~ret2~0 .cse235)))))) .cse12) (and .cse0 .cse1 .cse11 .cse2 (exists ((v_prenex_49 Int)) (let ((.cse240 (let ((.cse241 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_49 (select .cse241 (+ (* v_prenex_49 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse241 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse238 (div .cse240 c_~N~0))) (let ((.cse239 (mod (+ .cse238 1) 4294967296))) (and (< 2147483647 (mod .cse238 4294967296)) (< 2147483647 .cse239) (not (= (mod .cse240 c_~N~0) 0)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse239) (<= c_~N~0 (+ v_prenex_49 1)) (<= v_prenex_49 1) (< .cse240 0)))))) .cse3 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 (exists ((v_prenex_55 Int)) (let ((.cse243 (let ((.cse245 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse245 (+ (* v_prenex_55 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_55 (select .cse245 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse244 (div .cse243 c_~N~0))) (let ((.cse242 (mod .cse244 4294967296))) (and (< 2147483647 .cse242) (<= v_prenex_55 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse242) (<= c_~N~0 (+ v_prenex_55 1)) (<= 0 .cse243) (<= (mod (+ .cse244 1) 4294967296) 2147483647))))))) (and .cse0 .cse1 .cse11 .cse2 .cse5 .cse12 (exists ((v_prenex_60 Int)) (let ((.cse248 (let ((.cse249 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse249 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_60 4))) v_prenex_60 (select .cse249 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse247 (div .cse248 c_~N~0))) (let ((.cse246 (mod (+ .cse247 1) 4294967296))) (and (= .cse246 (+ c_ULTIMATE.start_main_~ret2~0 4294967296)) (<= c_~N~0 (+ v_prenex_60 1)) (< 2147483647 .cse246) (<= v_prenex_60 1) (< 2147483647 (mod .cse247 4294967296)) (not (= (mod .cse248 c_~N~0) 0)) (< .cse248 0)))))) .cse23) (and .cse0 (exists ((v_prenex_18 Int)) (let ((.cse251 (let ((.cse253 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_18 (select .cse253 (+ (* v_prenex_18 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse253 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse252 (div .cse251 c_~N~0))) (let ((.cse250 (mod (+ .cse252 1) 4294967296))) (and (< 2147483647 .cse250) (not (= (mod .cse251 c_~N~0) 0)) (<= c_~N~0 (+ v_prenex_18 1)) (< .cse251 0) (<= v_prenex_18 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse250) (<= (mod .cse252 4294967296) 2147483647)))))) .cse1 .cse11 .cse2 .cse3 .cse5 .cse12) (and .cse48 .cse28 .cse0 .cse1 .cse2 .cse29 .cse5 .cse49 (exists ((v_prenex_72 Int)) (let ((.cse256 (let ((.cse257 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse257 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_72 4))) v_prenex_72 (select .cse257 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse255 (div .cse256 c_~N~0))) (let ((.cse254 (mod (+ .cse255 1) 4294967296))) (and (<= v_prenex_72 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse254) (< 2147483647 (mod .cse255 4294967296)) (< 2147483647 .cse254) (<= c_~N~0 (+ v_prenex_72 1)) (< .cse256 0) (not (= (mod .cse256 c_~N~0) 0)))))))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_69 Int)) (let ((.cse260 (let ((.cse261 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_69 (select .cse261 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_69 4))) (select .cse261 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse259 (div .cse260 c_~N~0))) (let ((.cse258 (mod .cse259 4294967296))) (and (= .cse258 c_ULTIMATE.start_main_~ret2~0) (< 2147483647 (mod (+ .cse259 1) 4294967296)) (<= v_prenex_69 1) (<= 0 .cse260) (<= .cse258 2147483647) (<= c_~N~0 (+ v_prenex_69 1))))))) .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse11 .cse2 (exists ((v_prenex_35 Int)) (let ((.cse264 (let ((.cse265 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_35 (select .cse265 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_35 4))) (select .cse265 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse262 (div .cse264 c_~N~0))) (let ((.cse263 (mod .cse262 4294967296))) (and (<= (mod (+ .cse262 1) 4294967296) 2147483647) (< 2147483647 .cse263) (<= 0 .cse264) (<= v_prenex_35 1) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse263) (<= c_~N~0 (+ v_prenex_35 1))))))) .cse5 .cse12 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse29 (exists ((v_prenex_82 Int)) (let ((.cse267 (let ((.cse269 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse269 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_82 4))) v_prenex_82 (select .cse269 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse268 (div .cse267 c_~N~0))) (let ((.cse266 (mod .cse268 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse266) (= (mod .cse267 c_~N~0) 0) (<= v_prenex_82 1) (< 2147483647 .cse266) (<= (mod (+ .cse268 1) 4294967296) 2147483647) (<= c_~N~0 (+ v_prenex_82 1))))))) .cse30 .cse5 .cse31) (and .cse0 (exists ((v_prenex_84 Int)) (let ((.cse272 (let ((.cse273 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse273 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_84 4))) v_prenex_84 (select .cse273 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse271 (div .cse272 c_~N~0))) (let ((.cse270 (mod .cse271 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse270) (< 2147483647 (mod (+ .cse271 1) 4294967296)) (< 2147483647 .cse270) (<= c_~N~0 (+ v_prenex_84 1)) (<= v_prenex_84 1) (<= 0 .cse272)))))) .cse1 .cse2 .cse4 .cse5 .cse10 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 (exists ((v_prenex_53 Int)) (let ((.cse275 (let ((.cse277 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_53 (select .cse277 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_53 4))) (select .cse277 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse276 (div .cse275 c_~N~0))) (let ((.cse274 (mod .cse276 4294967296))) (and (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse274) (<= 0 .cse275) (< 2147483647 .cse274) (<= c_~N~0 (+ v_prenex_53 1)) (< 2147483647 (mod (+ .cse276 1) 4294967296)) (<= v_prenex_53 1)))))) .cse5 .cse31) (and .cse0 .cse1 .cse2 (exists ((v_prenex_40 Int)) (let ((.cse278 (let ((.cse281 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse281 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_40 4))) v_prenex_40 (select .cse281 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse280 (div .cse278 c_~N~0))) (let ((.cse279 (mod .cse280 4294967296))) (and (<= 0 .cse278) (< 2147483647 .cse279) (<= c_~N~0 (+ v_prenex_40 1)) (<= (mod (+ .cse280 1) 4294967296) 2147483647) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse279) (<= v_prenex_40 1)))))) .cse4 .cse5 .cse10 .cse23) (and .cse0 .cse1 .cse11 .cse2 .cse3 (exists ((v_prenex_24 Int)) (let ((.cse282 (let ((.cse285 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse285 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_24 4))) v_prenex_24 (select .cse285 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse284 (div .cse282 c_~N~0))) (let ((.cse283 (mod (+ .cse284 1) 4294967296))) (and (not (= (mod .cse282 c_~N~0) 0)) (<= .cse283 2147483647) (= c_ULTIMATE.start_main_~ret2~0 .cse283) (< .cse282 0) (<= c_~N~0 (+ v_prenex_24 1)) (<= v_prenex_24 1) (< 2147483647 (mod .cse284 4294967296))))))) .cse5 .cse12) (and .cse0 .cse1 .cse11 .cse2 .cse5 .cse12 (exists ((v_prenex_43 Int)) (let ((.cse287 (let ((.cse289 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_43 (select .cse289 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_43 4))) (select .cse289 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse288 (div .cse287 c_~N~0))) (let ((.cse286 (mod .cse288 4294967296))) (and (<= c_~N~0 (+ v_prenex_43 1)) (<= v_prenex_43 1) (= c_ULTIMATE.start_main_~ret2~0 .cse286) (<= .cse286 2147483647) (<= 0 .cse287) (<= (mod (+ .cse288 1) 4294967296) 2147483647)))))) .cse23) (and .cse0 .cse1 .cse11 .cse2 (exists ((v_prenex_33 Int)) (let ((.cse290 (let ((.cse293 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_33 (select .cse293 (+ (* v_prenex_33 4) |c_ULTIMATE.start_main_~#x~0.offset|)) (select .cse293 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse291 (div .cse290 c_~N~0))) (let ((.cse292 (mod (+ .cse291 1) 4294967296))) (and (<= c_~N~0 (+ v_prenex_33 1)) (< .cse290 0) (<= v_prenex_33 1) (<= (mod .cse291 4294967296) 2147483647) (not (= (mod .cse290 c_~N~0) 0)) (<= .cse292 2147483647) (= .cse292 c_ULTIMATE.start_main_~ret2~0)))))) .cse5 .cse12 .cse23) (and .cse0 .cse1 .cse11 .cse2 (exists ((v_prenex_79 Int)) (let ((.cse296 (let ((.cse297 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ v_prenex_79 (select .cse297 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_79 4))) (select .cse297 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse294 (div .cse296 c_~N~0))) (let ((.cse295 (mod .cse294 4294967296))) (and (< 2147483647 (mod (+ .cse294 1) 4294967296)) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse295) (<= v_prenex_79 1) (< 2147483647 .cse295) (<= c_~N~0 (+ v_prenex_79 1)) (<= 0 .cse296)))))) .cse3 .cse5 .cse12) (and .cse28 .cse0 .cse1 .cse2 .cse29 .cse30 .cse5 .cse31 (exists ((v_prenex_77 Int)) (let ((.cse300 (let ((.cse301 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse301 (+ (* v_prenex_77 4) |c_ULTIMATE.start_main_~#x~0.offset|)) v_prenex_77 (select .cse301 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse298 (div .cse300 c_~N~0))) (let ((.cse299 (mod .cse298 4294967296))) (and (< 2147483647 (mod (+ .cse298 1) 4294967296)) (= .cse299 c_ULTIMATE.start_main_~ret2~0) (<= v_prenex_77 1) (<= c_~N~0 (+ v_prenex_77 1)) (<= .cse299 2147483647) (<= 0 .cse300))))))) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse12 (exists ((v_prenex_83 Int)) (let ((.cse302 (let ((.cse305 (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0.base|))) (+ (select .cse305 (+ |c_ULTIMATE.start_main_~#x~0.offset| (* v_prenex_83 4))) v_prenex_83 (select .cse305 |c_ULTIMATE.start_main_~#x~0.offset|))))) (let ((.cse304 (div .cse302 c_~N~0))) (let ((.cse303 (mod .cse304 4294967296))) (and (<= c_~N~0 (+ v_prenex_83 1)) (<= 0 .cse302) (< 2147483647 .cse303) (= (+ c_ULTIMATE.start_main_~ret2~0 4294967296) .cse303) (<= (mod (+ .cse304 1) 4294967296) 2147483647) (<= v_prenex_83 1)))))))))))))) is different from false [2020-12-23 00:47:34,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 72, 9, 1] term [2020-12-23 00:47:34,579 INFO L639 QuantifierPusher]: Distributing 72 conjuncts over 2 disjuncts [2020-12-23 00:47:39,520 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 00:47:41,553 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* v_prenex_22 4) |ULTIMATE.start_main_~#x~0.offset|) 0) [2020-12-23 00:47:41,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 00:47:41,555 INFO L244 Elim1Store]: Index analysis took 2036 ms [2020-12-23 00:47:41,571 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 92 [2020-12-23 00:47:41,577 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.