/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:38,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:38,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:39,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:39,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:39,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:39,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:39,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:39,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:39,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:39,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:39,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:39,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:39,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:39,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:39,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:39,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:39,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:39,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:39,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:39,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:39,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:39,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:39,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:39,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:39,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:39,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:39,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:39,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:39,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:39,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:39,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:39,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:39,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:39,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:39,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:39,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:39,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:39,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:39,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:39,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:39,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:45:39,060 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:39,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:39,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:39,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:39,062 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:39,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:39,063 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:39,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:39,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:39,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:39,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:39,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:39,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:39,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:39,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:39,068 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:39,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:39,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:39,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:39,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:39,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:39,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:39,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:39,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:39,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:39,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:39,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:39,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:39,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:39,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:39,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:39,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:39,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:39,391 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:39,392 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:39,392 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2020-07-08 12:45:39,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3b34b5b/b480a2e7319c40f98da7eaa15f4dcbaf/FLAGb6eb50937 [2020-07-08 12:45:39,857 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:39,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2020-07-08 12:45:39,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3b34b5b/b480a2e7319c40f98da7eaa15f4dcbaf/FLAGb6eb50937 [2020-07-08 12:45:40,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3b34b5b/b480a2e7319c40f98da7eaa15f4dcbaf [2020-07-08 12:45:40,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:40,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:40,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:40,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:40,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:40,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4799de3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40, skipping insertion in model container [2020-07-08 12:45:40,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:40,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:40,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:40,524 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:40,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:40,571 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:40,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40 WrapperNode [2020-07-08 12:45:40,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:40,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:40,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:40,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:40,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... [2020-07-08 12:45:40,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:40,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:40,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:40,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:40,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:41,150 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:41,150 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:45:41,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:41 BoogieIcfgContainer [2020-07-08 12:45:41,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:41,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:41,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:41,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:41,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:40" (1/3) ... [2020-07-08 12:45:41,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:41, skipping insertion in model container [2020-07-08 12:45:41,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:40" (2/3) ... [2020-07-08 12:45:41,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:41, skipping insertion in model container [2020-07-08 12:45:41,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:41" (3/3) ... [2020-07-08 12:45:41,162 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2020-07-08 12:45:41,173 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:41,181 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:41,199 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:41,225 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:41,225 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:41,225 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:41,225 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:41,225 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:41,226 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:41,226 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:41,226 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-08 12:45:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 12:45:41,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:41,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:41,252 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2020-07-08 12:45:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:41,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331493874] [2020-07-08 12:45:41,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:41,352 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:41,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258326750] [2020-07-08 12:45:41,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:41,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-08 12:45:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:41,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:41,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-08 12:45:41,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-08 12:45:41,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 12:45:41,511 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #52#return; {27#true} is VALID [2020-07-08 12:45:41,511 INFO L263 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2020-07-08 12:45:41,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {27#true} is VALID [2020-07-08 12:45:41,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-08 12:45:41,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2020-07-08 12:45:41,514 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2020-07-08 12:45:41,515 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-08 12:45:41,515 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-08 12:45:41,516 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-08 12:45:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:41,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331493874] [2020-07-08 12:45:41,520 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:41,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258326750] [2020-07-08 12:45:41,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:41,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:45:41,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588069790] [2020-07-08 12:45:41,529 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 12:45:41,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:41,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:45:41,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:41,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:45:41,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:45:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:41,573 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-08 12:45:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:41,660 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-08 12:45:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:45:41,661 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 12:45:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-08 12:45:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-08 12:45:41,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2020-07-08 12:45:41,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:41,846 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:45:41,846 INFO L226 Difference]: Without dead ends: 17 [2020-07-08 12:45:41,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-07-08 12:45:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-08 12:45:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-08 12:45:41,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:41,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-08 12:45:41,910 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-08 12:45:41,910 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-08 12:45:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:41,918 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-08 12:45:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-08 12:45:41,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:41,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:41,921 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-08 12:45:41,922 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-08 12:45:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:41,929 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-08 12:45:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-08 12:45:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:41,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:41,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:41,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:45:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-08 12:45:41,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-07-08 12:45:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:41,938 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-08 12:45:41,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:45:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-08 12:45:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 12:45:41,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:41,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:42,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-08 12:45:42,145 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2020-07-08 12:45:42,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:42,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064264430] [2020-07-08 12:45:42,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:42,160 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:42,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136491942] [2020-07-08 12:45:42,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:45:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:42,293 INFO L263 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2020-07-08 12:45:42,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {177#true} is VALID [2020-07-08 12:45:42,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2020-07-08 12:45:42,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #52#return; {177#true} is VALID [2020-07-08 12:45:42,294 INFO L263 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret7 := main(); {177#true} is VALID [2020-07-08 12:45:42,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {177#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {197#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:45:42,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {178#false} is VALID [2020-07-08 12:45:42,298 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {178#false} is VALID [2020-07-08 12:45:42,298 INFO L263 TraceCheckUtils]: 8: Hoare triple {178#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {178#false} is VALID [2020-07-08 12:45:42,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2020-07-08 12:45:42,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {178#false} assume 0 == ~cond; {178#false} is VALID [2020-07-08 12:45:42,299 INFO L280 TraceCheckUtils]: 11: Hoare triple {178#false} assume !false; {178#false} is VALID [2020-07-08 12:45:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:42,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064264430] [2020-07-08 12:45:42,301 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:42,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136491942] [2020-07-08 12:45:42,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:42,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:42,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576869870] [2020-07-08 12:45:42,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 12:45:42,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:42,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:42,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:42,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:42,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:42,322 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2020-07-08 12:45:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,402 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-08 12:45:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:42,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 12:45:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-08 12:45:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-08 12:45:42,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2020-07-08 12:45:42,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:42,454 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:45:42,454 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:45:42,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-07-08 12:45:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:45:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-08 12:45:42,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:42,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 18 states. [2020-07-08 12:45:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 18 states. [2020-07-08 12:45:42,465 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 18 states. [2020-07-08 12:45:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,467 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:45:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:45:42,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,468 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states. [2020-07-08 12:45:42,469 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states. [2020-07-08 12:45:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:42,471 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:45:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:45:42,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:42,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:42,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:42,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:45:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-08 12:45:42,474 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2020-07-08 12:45:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:42,474 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-08 12:45:42,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-08 12:45:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:45:42,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:42,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:42,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:42,677 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2020-07-08 12:45:42,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:42,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287547916] [2020-07-08 12:45:42,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:42,687 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:42,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069690417] [2020-07-08 12:45:42,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:45:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:42,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:42,847 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-08 12:45:42,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {326#true} is VALID [2020-07-08 12:45:42,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-08 12:45:42,848 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #52#return; {326#true} is VALID [2020-07-08 12:45:42,849 INFO L263 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret7 := main(); {326#true} is VALID [2020-07-08 12:45:42,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {346#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:42,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {350#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:42,852 INFO L280 TraceCheckUtils]: 7: Hoare triple {350#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {327#false} is VALID [2020-07-08 12:45:42,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {327#false} is VALID [2020-07-08 12:45:42,853 INFO L280 TraceCheckUtils]: 9: Hoare triple {327#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {327#false} is VALID [2020-07-08 12:45:42,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {327#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {327#false} is VALID [2020-07-08 12:45:42,854 INFO L263 TraceCheckUtils]: 11: Hoare triple {327#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {327#false} is VALID [2020-07-08 12:45:42,854 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2020-07-08 12:45:42,854 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2020-07-08 12:45:42,855 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-08 12:45:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:42,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287547916] [2020-07-08 12:45:42,861 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:42,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069690417] [2020-07-08 12:45:42,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:42,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:45:42,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588978331] [2020-07-08 12:45:42,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-08 12:45:42,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:42,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:45:42,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:42,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:45:42,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:45:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:45:42,886 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-08 12:45:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,008 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:45:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:45:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-08 12:45:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-08 12:45:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:45:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-08 12:45:43,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-08 12:45:43,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:43,068 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:45:43,068 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:45:43,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:45:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-08 12:45:43,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:43,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-08 12:45:43,088 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-08 12:45:43,088 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-08 12:45:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,090 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-08 12:45:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-08 12:45:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,091 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-08 12:45:43,092 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-08 12:45:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:43,093 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-08 12:45:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-08 12:45:43,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:43,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:43,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:43,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:45:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-08 12:45:43,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2020-07-08 12:45:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:43,096 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-08 12:45:43,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:45:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:45:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:45:43,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:43,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:43,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:43,311 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2020-07-08 12:45:43,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:43,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35274007] [2020-07-08 12:45:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:43,336 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:43,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840918309] [2020-07-08 12:45:43,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:45:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:43,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:45,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:45:45,636 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:45,946 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 29 [2020-07-08 12:45:45,947 INFO L624 ElimStorePlain]: treesize reduction 395, result has 8.4 percent of original size [2020-07-08 12:45:45,947 INFO L512 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2020-07-08 12:45:45,948 INFO L512 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2020-07-08 12:45:45,948 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2020-07-08 12:45:45,948 INFO L512 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2020-07-08 12:45:45,948 INFO L512 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2020-07-08 12:45:45,980 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2020-07-08 12:45:45,981 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:46,001 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:46,001 INFO L512 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2020-07-08 12:45:46,002 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:46,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:497, output treesize:10 [2020-07-08 12:45:47,316 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:47,317 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_11, v_prenex_12, v_prenex_13, v_prenex_14, v_prenex_5, v_prenex_6, v_prenex_7, v_prenex_8, |v_#memory_int_7|, |v_main_#t~nondet3_3|, v_prenex_3, v_prenex_4, v_prenex_9, v_prenex_10, v_prenex_1, v_prenex_2]. (let ((.cse9 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse2 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse11 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse16 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse17 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse19 (mod main_~j~0 4294967296)) (.cse18 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse3 (* .cse19 .cse18)) (.cse12 (* .cse19 .cse17)) (.cse10 (* (mod main_~k~0 4294967296) 4)) (.cse13 (* .cse16 .cse18)) (.cse7 (not .cse11)) (.cse0 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse1 (= 0 main_~k~0)) (.cse14 (not .cse2)) (.cse5 (= 0 main_~j~0)) (.cse6 (= 1 main_~N_LIN~0)) (.cse8 (not .cse9)) (.cse15 (* .cse16 .cse17)) (.cse4 (* (mod main_~k~0 4294967296) 4))) (or (and .cse0 .cse1 .cse2 (= (store v_prenex_11 |main_~#matriz~0.base| (store (select v_prenex_11 |main_~#matriz~0.base|) (+ .cse3 |main_~#matriz~0.offset| .cse4 (- 17179869184)) v_prenex_12)) |#memory_int|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse9 (= (store v_prenex_13 |main_~#matriz~0.base| (store (select v_prenex_13 |main_~#matriz~0.base|) (+ .cse3 .cse10 |main_~#matriz~0.offset|) v_prenex_14)) |#memory_int|)) (and .cse0 .cse1 .cse11 .cse2 (= (store v_prenex_5 |main_~#matriz~0.base| (store (select v_prenex_5 |main_~#matriz~0.base|) (+ .cse12 .cse10 |main_~#matriz~0.offset|) v_prenex_6)) |#memory_int|) .cse5 .cse6 .cse9) (and .cse0 .cse1 (= |#memory_int| (store v_prenex_7 |main_~#matriz~0.base| (store (select v_prenex_7 |main_~#matriz~0.base|) (+ .cse13 .cse10 |main_~#matriz~0.offset|) v_prenex_8))) .cse14 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 (= (store |v_#memory_int_7| |main_~#matriz~0.base| (store (select |v_#memory_int_7| |main_~#matriz~0.base|) (+ .cse12 |main_~#matriz~0.offset| .cse4 (- 17179869184)) |v_main_#t~nondet3_3|)) |#memory_int|) .cse11 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse11 .cse14 .cse5 .cse6 .cse9 (= (store v_prenex_3 |main_~#matriz~0.base| (store (select v_prenex_3 |main_~#matriz~0.base|) (+ .cse15 .cse10 |main_~#matriz~0.offset|) v_prenex_4)) |#memory_int|)) (and .cse0 .cse1 .cse14 .cse5 .cse6 (= (store v_prenex_9 |main_~#matriz~0.base| (store (select v_prenex_9 |main_~#matriz~0.base|) (+ .cse13 |main_~#matriz~0.offset| .cse4 (- 17179869184)) v_prenex_10)) |#memory_int|) .cse7 .cse8) (and .cse0 .cse1 .cse11 .cse14 .cse5 .cse6 .cse8 (= |#memory_int| (store v_prenex_1 |main_~#matriz~0.base| (store (select v_prenex_1 |main_~#matriz~0.base|) (+ .cse15 |main_~#matriz~0.offset| .cse4 (- 17179869184)) v_prenex_2))))))) [2020-07-08 12:45:47,317 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0)) [2020-07-08 12:45:47,386 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-08 12:45:47,392 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:47,395 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:47,395 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:47,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:45:47,398 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:47,399 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= .cse0 main_~maior~0) (<= |main_#t~mem6| .cse0))) [2020-07-08 12:45:47,399 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-08 12:45:47,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:47,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2020-07-08 12:45:47,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {493#true} is VALID [2020-07-08 12:45:47,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-08 12:45:47,465 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #52#return; {493#true} is VALID [2020-07-08 12:45:47,465 INFO L263 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2020-07-08 12:45:47,467 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {513#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:47,468 INFO L280 TraceCheckUtils]: 6: Hoare triple {513#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:47,471 INFO L280 TraceCheckUtils]: 7: Hoare triple {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:47,474 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-08 12:45:47,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-08 12:45:47,480 INFO L280 TraceCheckUtils]: 10: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-08 12:45:47,481 INFO L280 TraceCheckUtils]: 11: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-08 12:45:47,482 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-08 12:45:47,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {540#(<= |main_#t~mem6| main_~maior~0)} is VALID [2020-07-08 12:45:47,485 INFO L263 TraceCheckUtils]: 14: Hoare triple {540#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:47,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:47,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {494#false} is VALID [2020-07-08 12:45:47,487 INFO L280 TraceCheckUtils]: 17: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-08 12:45:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:47,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35274007] [2020-07-08 12:45:47,490 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:47,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840918309] [2020-07-08 12:45:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:45:47,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:45:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668699443] [2020-07-08 12:45:47,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:47,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:47,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:45:47,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:47,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:45:47,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:45:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:47,528 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2020-07-08 12:45:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:47,990 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-08 12:45:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:45:47,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 12:45:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 12:45:47,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-08 12:45:48,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:48,079 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:45:48,080 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 12:45:48,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:45:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 12:45:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-07-08 12:45:48,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:48,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2020-07-08 12:45:48,117 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2020-07-08 12:45:48,117 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2020-07-08 12:45:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:48,120 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-08 12:45:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-08 12:45:48,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:48,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:48,121 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2020-07-08 12:45:48,121 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2020-07-08 12:45:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:48,124 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-08 12:45:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-08 12:45:48,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:48,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:48,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:48,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:45:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-08 12:45:48,127 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-07-08 12:45:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:48,127 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-08 12:45:48,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:45:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-08 12:45:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:45:48,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:48,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:48,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:48,338 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2020-07-08 12:45:48,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:48,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41018302] [2020-07-08 12:45:48,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:48,349 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:48,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835870034] [2020-07-08 12:45:48,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:48,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-08 12:45:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:48,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:48,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:45:48,507 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:48,514 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:48,515 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:48,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2020-07-08 12:45:48,519 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:48,519 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, |v_main_#t~nondet3_4|]. (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|) (= (store |v_#memory_int_8| |main_~#matriz~0.base| (store (select |v_#memory_int_8| |main_~#matriz~0.base|) |main_~#matriz~0.offset| |v_main_#t~nondet3_4|)) |#memory_int|)) [2020-07-08 12:45:48,520 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|) [2020-07-08 12:45:48,573 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-08 12:45:48,578 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:48,582 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:48,582 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:48,582 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-07-08 12:45:48,585 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:48,585 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= (+ .cse0 1) main_~maior~0) (<= |main_#t~mem6| .cse0))) [2020-07-08 12:45:48,586 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem6| 1) main_~maior~0) [2020-07-08 12:45:48,617 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:48,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2020-07-08 12:45:48,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {718#true} is VALID [2020-07-08 12:45:48,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2020-07-08 12:45:48,673 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #52#return; {718#true} is VALID [2020-07-08 12:45:48,673 INFO L263 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret7 := main(); {718#true} is VALID [2020-07-08 12:45:48,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {718#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {738#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:48,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {742#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:48,680 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {746#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|)} is VALID [2020-07-08 12:45:48,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {746#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|)} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,685 INFO L280 TraceCheckUtils]: 12: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {766#(<= (+ |main_#t~mem6| 1) main_~maior~0)} is VALID [2020-07-08 12:45:48,687 INFO L263 TraceCheckUtils]: 14: Hoare triple {766#(<= (+ |main_#t~mem6| 1) main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {770#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:48,688 INFO L280 TraceCheckUtils]: 15: Hoare triple {770#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {774#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:48,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {719#false} is VALID [2020-07-08 12:45:48,690 INFO L280 TraceCheckUtils]: 17: Hoare triple {719#false} assume !false; {719#false} is VALID [2020-07-08 12:45:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:48,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41018302] [2020-07-08 12:45:48,692 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:48,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835870034] [2020-07-08 12:45:48,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:45:48,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 12:45:48,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227995821] [2020-07-08 12:45:48,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-08 12:45:48,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:48,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:45:48,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:48,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:45:48,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:45:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:45:48,725 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 9 states. [2020-07-08 12:45:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:49,436 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-08 12:45:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:45:49,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-08 12:45:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:45:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-08 12:45:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:45:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-08 12:45:49,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2020-07-08 12:45:49,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:49,531 INFO L225 Difference]: With dead ends: 41 [2020-07-08 12:45:49,532 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:45:49,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:45:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:45:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-07-08 12:45:49,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:49,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2020-07-08 12:45:49,555 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2020-07-08 12:45:49,555 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2020-07-08 12:45:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:49,558 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-08 12:45:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-08 12:45:49,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:49,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:49,559 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2020-07-08 12:45:49,559 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2020-07-08 12:45:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:49,561 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-08 12:45:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-08 12:45:49,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:49,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:49,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:49,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:45:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-08 12:45:49,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2020-07-08 12:45:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:49,564 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-08 12:45:49,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:45:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-08 12:45:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:45:49,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:49,566 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:49,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:49,780 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash -422232267, now seen corresponding path program 2 times [2020-07-08 12:45:49,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:49,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711418514] [2020-07-08 12:45:49,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:49,791 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:49,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185269793] [2020-07-08 12:45:49,792 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:49,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:45:49,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:49,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:45:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:49,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:49,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-08 12:45:49,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {966#true} is VALID [2020-07-08 12:45:49,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-08 12:45:49,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #52#return; {966#true} is VALID [2020-07-08 12:45:49,908 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret7 := main(); {966#true} is VALID [2020-07-08 12:45:49,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {986#(= 1 main_~N_LIN~0)} is VALID [2020-07-08 12:45:49,911 INFO L280 TraceCheckUtils]: 6: Hoare triple {986#(= 1 main_~N_LIN~0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:49,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:49,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:49,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1000#(and (= 1 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:45:49,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {1000#(and (= 1 main_~k~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {967#false} is VALID [2020-07-08 12:45:49,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {967#false} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {967#false} is VALID [2020-07-08 12:45:49,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {967#false} is VALID [2020-07-08 12:45:49,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {967#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {967#false} is VALID [2020-07-08 12:45:49,918 INFO L280 TraceCheckUtils]: 14: Hoare triple {967#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#false} is VALID [2020-07-08 12:45:49,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {967#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {967#false} is VALID [2020-07-08 12:45:49,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {967#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {967#false} is VALID [2020-07-08 12:45:49,919 INFO L263 TraceCheckUtils]: 17: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {967#false} is VALID [2020-07-08 12:45:49,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2020-07-08 12:45:49,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2020-07-08 12:45:49,920 INFO L280 TraceCheckUtils]: 20: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-08 12:45:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:49,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711418514] [2020-07-08 12:45:49,922 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:45:49,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185269793] [2020-07-08 12:45:49,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:45:49,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 12:45:49,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910392154] [2020-07-08 12:45:49,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:49,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:49,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:49,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:49,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:49,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:49,958 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2020-07-08 12:45:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:50,062 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-08 12:45:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:45:50,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-08 12:45:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-08 12:45:50,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-08 12:45:50,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:50,120 INFO L225 Difference]: With dead ends: 44 [2020-07-08 12:45:50,121 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:45:50,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:45:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 12:45:50,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:50,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:50,147 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:50,147 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:50,149 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:50,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:50,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:50,150 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:50,150 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:50,152 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:50,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:50,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:50,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:50,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:45:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 12:45:50,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-08 12:45:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:50,155 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 12:45:50,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:45:50,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:50,156 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:50,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:50,367 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 239488911, now seen corresponding path program 3 times [2020-07-08 12:45:50,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:50,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346365061] [2020-07-08 12:45:50,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:50,377 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:45:50,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186821439] [2020-07-08 12:45:50,377 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-07-08 12:45:50,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:45:50,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:50,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:45:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:50,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:52,599 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:45:52,600 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:52,834 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 34 [2020-07-08 12:45:52,837 INFO L624 ElimStorePlain]: treesize reduction 385, result has 9.8 percent of original size [2020-07-08 12:45:52,837 INFO L512 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2020-07-08 12:45:52,837 INFO L512 ElimStorePlain]: Eliminatee v_prenex_25 vanished before elimination [2020-07-08 12:45:52,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2020-07-08 12:45:52,852 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:52,866 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:52,866 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2020-07-08 12:45:52,867 INFO L512 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2020-07-08 12:45:52,867 INFO L512 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2020-07-08 12:45:52,867 INFO L512 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2020-07-08 12:45:52,868 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:52,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:489, output treesize:16 [2020-07-08 12:45:52,998 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:52,999 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_21, v_prenex_22, |v_#memory_int_9|, |v_main_#t~nondet3_5|, v_prenex_17, v_prenex_18, v_prenex_25, v_prenex_26, v_prenex_15, v_prenex_16, v_prenex_27, v_prenex_28, v_prenex_19, v_prenex_20, v_prenex_23, v_prenex_24]. (let ((.cse7 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse6 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse16 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse17 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse11 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse15 (mod main_~j~0 4294967296)) (.cse18 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse1 (* .cse15 .cse18)) (.cse2 (not .cse11)) (.cse14 (* .cse17 .cse18)) (.cse8 (* (mod main_~k~0 4294967296) 4)) (.cse12 (* .cse17 .cse16)) (.cse13 (not .cse6)) (.cse9 (not .cse7)) (.cse3 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse4 (< (mod main_~j~0 4294967296) 1)) (.cse0 (* (mod main_~k~0 4294967296) 4)) (.cse10 (* .cse15 .cse16)) (.cse5 (= 1 main_~N_LIN~0))) (or (and (= (store v_prenex_21 |main_~#matriz~0.base| (store (select v_prenex_21 |main_~#matriz~0.base|) (+ .cse0 |main_~#matriz~0.offset| .cse1) v_prenex_22)) |#memory_int|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (= |#memory_int| (store |v_#memory_int_9| |main_~#matriz~0.base| (store (select |v_#memory_int_9| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse1 .cse8 (- 17179869184)) |v_main_#t~nondet3_5|))) .cse5 .cse9 .cse6) (and .cse3 .cse4 (= (store v_prenex_17 |main_~#matriz~0.base| (store (select v_prenex_17 |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse10 .cse8 (- 17179869184)) v_prenex_18)) |#memory_int|) .cse5 .cse11 .cse9 .cse6) (and (= |#memory_int| (store v_prenex_25 |main_~#matriz~0.base| (store (select v_prenex_25 |main_~#matriz~0.base|) (+ .cse0 |main_~#matriz~0.offset| .cse12) v_prenex_26))) .cse3 .cse4 .cse13 .cse5 .cse11 .cse7) (and .cse2 .cse3 .cse4 (= (store v_prenex_15 |main_~#matriz~0.base| (store (select v_prenex_15 |main_~#matriz~0.base|) (+ .cse14 |main_~#matriz~0.offset| .cse8 (- 17179869184)) v_prenex_16)) |#memory_int|) .cse13 .cse5 .cse9) (and .cse2 .cse3 .cse4 (= |#memory_int| (store v_prenex_27 |main_~#matriz~0.base| (store (select v_prenex_27 |main_~#matriz~0.base|) (+ .cse0 .cse14 |main_~#matriz~0.offset|) v_prenex_28))) .cse13 .cse5 .cse7) (and (= |#memory_int| (store v_prenex_19 |main_~#matriz~0.base| (store (select v_prenex_19 |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse8 .cse12 (- 17179869184)) v_prenex_20))) .cse3 .cse4 .cse13 .cse11 .cse5 .cse9) (and .cse3 .cse4 (= |#memory_int| (store v_prenex_23 |main_~#matriz~0.base| (store (select v_prenex_23 |main_~#matriz~0.base|) (+ .cse0 |main_~#matriz~0.offset| .cse10) v_prenex_24))) .cse11 .cse5 .cse6 .cse7)))) [2020-07-08 12:45:52,999 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< (mod main_~j~0 4294967296) 1) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (= 1 main_~N_LIN~0)) [2020-07-08 12:45:55,077 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,078 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,078 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,080 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,082 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,082 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:55,083 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,543 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,545 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,546 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,561 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:45:59,834 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:45:59,834 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:00,041 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:00,042 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:00,281 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:00,281 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:00,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:00,440 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:00,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:00,601 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:00,816 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:00,817 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,047 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,047 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,269 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,270 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,415 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,415 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,588 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,588 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,762 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:01,950 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:01,951 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:02,143 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:02,143 INFO L544 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:02,485 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-07-08 12:46:02,486 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:46:02,487 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 139 [2020-07-08 12:46:02,501 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:02,513 INFO L544 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:02,645 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:02,646 INFO L544 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:02,778 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:02,778 INFO L544 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:02,930 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:02,930 INFO L544 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,110 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,111 INFO L544 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,299 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,299 INFO L544 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,498 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,498 INFO L544 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,606 INFO L544 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,725 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,726 INFO L544 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,850 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,850 INFO L544 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:03,981 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:03,981 INFO L544 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:04,151 INFO L544 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,287 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:04,288 INFO L544 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,448 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:04,449 INFO L544 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,722 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-07-08 12:46:04,722 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:46:04,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 142 [2020-07-08 12:46:04,730 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:04,733 INFO L544 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,826 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:04,826 INFO L544 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:04,925 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:04,925 INFO L544 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,036 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:05,036 INFO L544 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:05,165 INFO L544 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,292 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:05,293 INFO L544 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,530 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:46:05,531 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 145 [2020-07-08 12:46:05,536 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:05,538 INFO L544 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:46:05,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2020-07-08 12:46:05,711 INFO L544 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,887 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:05,888 INFO L544 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:05,975 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:05,975 INFO L544 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,074 INFO L544 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,167 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,167 INFO L544 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,262 INFO L544 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,359 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,360 INFO L544 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,456 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,457 INFO L544 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,561 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,561 INFO L544 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,677 INFO L544 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,776 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,776 INFO L544 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:06,884 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:06,884 INFO L544 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,008 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,009 INFO L544 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,087 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,088 INFO L544 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,147 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,148 INFO L544 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,242 INFO L544 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,326 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,327 INFO L544 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,414 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,415 INFO L544 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,496 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,496 INFO L544 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,568 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,568 INFO L544 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,626 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,627 INFO L544 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,678 INFO L544 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,729 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,730 INFO L544 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,781 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,782 INFO L544 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,836 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,836 INFO L544 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,886 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,887 INFO L544 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,935 INFO L544 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:07,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:07,983 INFO L544 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:08,030 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:08,030 INFO L544 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:08,069 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-08 12:46:08,070 INFO L544 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2020-07-08 12:46:08,943 WARN L193 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 120 [2020-07-08 12:46:08,951 INFO L624 ElimStorePlain]: treesize reduction 298, result has 62.2 percent of original size [2020-07-08 12:46:08,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:08,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:08,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:08,976 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2020-07-08 12:46:08,977 INFO L244 ElimStorePlain]: Needed 65 recursive calls to eliminate 4 variables, input treesize:8577, output treesize:396 [2020-07-08 12:46:09,402 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:46:09,403 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, |v_main_#t~nondet3_6|, v_prenex_29, v_prenex_30]. (let ((.cse48 (mod main_~j~0 4294967296)) (.cse52 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse51 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse54 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse53 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse49 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (.cse50 (mod main_~j~0 4294967296)) (.cse55 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse5 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse11 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse19 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse1 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse17 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse14 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse42 (* .cse50 .cse55)) (.cse43 (* .cse53 .cse49)) (.cse39 (* .cse54 .cse55)) (.cse38 (* (mod main_~k~0 4294967296) 4)) (.cse41 (* .cse54 .cse51)) (.cse36 (* .cse53 .cse52)) (.cse35 (* (mod main_~k~0 4294967296) 4)) (.cse47 (* .cse48 .cse52)) (.cse37 (select |v_#memory_int_10| |main_~#matriz~0.base|)) (.cse44 (* .cse50 .cse51)) (.cse40 (* (mod main_~k~0 4294967296) 4)) (.cse34 (select |#memory_int| |main_~#matriz~0.base|)) (.cse45 (* .cse48 .cse49)) (.cse46 (* (mod main_~k~0 4294967296) 4))) (let ((.cse4 (<= |main_#t~mem4| (select .cse34 (+ .cse45 |main_~#matriz~0.offset| .cse46)))) (.cse15 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse44 |main_~#matriz~0.offset| .cse40) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse18 (<= |main_#t~mem4| (select .cse34 (+ .cse35 .cse47 |main_~#matriz~0.offset| (- 17179869184))))) (.cse33 (<= |main_#t~mem4| (select .cse34 (+ .cse36 |main_~#matriz~0.offset| .cse46)))) (.cse31 (<= |main_#t~mem4| (select .cse34 (+ .cse47 |main_~#matriz~0.offset| .cse46)))) (.cse9 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse38 |main_~#matriz~0.offset| .cse41 (- 17179869184)) |v_main_#t~nondet3_6|)))) (.cse29 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ |main_~#matriz~0.offset| .cse40 .cse39) |v_main_#t~nondet3_6|)))) (.cse27 (<= |main_#t~mem4| (select .cse34 (+ .cse43 |main_~#matriz~0.offset| .cse46)))) (.cse30 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse42 .cse38 |main_~#matriz~0.offset| (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse23 (<= |main_#t~mem4| (select .cse34 (+ .cse35 .cse45 |main_~#matriz~0.offset| (- 17179869184))))) (.cse22 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse44 .cse38 |main_~#matriz~0.offset| (- 17179869184)) |v_main_#t~nondet3_6|)))) (.cse24 (<= |main_#t~mem4| (select .cse34 (+ .cse43 .cse35 |main_~#matriz~0.offset| (- 17179869184))))) (.cse3 (not .cse14)) (.cse21 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse42 |main_~#matriz~0.offset| .cse40) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse25 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ |main_~#matriz~0.offset| .cse40 .cse41) |v_main_#t~nondet3_6|)))) (.cse0 (<= (mod v_prenex_29 4294967296) 2147483647)) (.cse32 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse37 (+ .cse38 |main_~#matriz~0.offset| .cse39 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse2 (<= (select .cse37 (+ (* (mod v_prenex_30 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_29 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0)) (.cse6 (not .cse17)) (.cse20 (not .cse1)) (.cse28 (<= |main_#t~mem4| (select .cse34 (+ .cse35 .cse36 |main_~#matriz~0.offset| (- 17179869184))))) (.cse7 (not .cse19)) (.cse26 (not .cse11)) (.cse8 (< (mod v_prenex_29 4294967296) 1)) (.cse16 (not .cse5)) (.cse10 (<= (mod v_prenex_30 4294967296) 2147483647)) (.cse12 (= 1 main_~N_LIN~0)) (.cse13 (< (mod v_prenex_30 4294967296) (mod main_~N_LIN~0 4294967296)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse8 .cse16 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse20 .cse21 .cse8 .cse16 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse8 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse24 .cse25 .cse3 .cse7 .cse26 .cse8 .cse16 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse15 .cse26 .cse8 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse28 .cse15 .cse26 .cse8 .cse16 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse14 .cse20 .cse7 .cse8 .cse16 .cse17 .cse18 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse21 .cse8 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse24 .cse3 .cse6 .cse20 .cse30 .cse26 .cse8 .cse16 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse3 .cse23 .cse20 .cse7 .cse8 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse31 .cse2 .cse5 .cse14 .cse15 .cse8 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse24 .cse3 .cse20 .cse7 .cse26 .cse8 .cse16 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse6 .cse22 .cse26 .cse8 .cse16 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse3 .cse27 .cse5 .cse20 .cse7 .cse26 .cse8 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse14 .cse6 .cse20 .cse7 .cse8 .cse16 .cse18 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse27 .cse5 .cse20 .cse21 .cse26 .cse8 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse30 .cse8 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse31 .cse32 .cse2 .cse5 .cse14 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse23 .cse7 .cse8 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse31 .cse2 .cse29 .cse5 .cse14 .cse20 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse15 .cse26 .cse8 .cse16 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse5 .cse14 .cse6 .cse20 .cse30 .cse33 .cse26 .cse8 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse6 .cse22 .cse8 .cse16 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse14 .cse15 .cse33 .cse26 .cse8 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse3 .cse27 .cse5 .cse6 .cse20 .cse7 .cse26 .cse8 .cse10 .cse12 .cse13) (and .cse0 .cse31 .cse1 .cse2 .cse25 .cse5 .cse14 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse14 .cse6 .cse33 .cse7 .cse26 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse5 .cse14 .cse33 .cse7 .cse26 .cse8 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse6 .cse28 .cse7 .cse26 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse5 .cse14 .cse6 .cse20 .cse33 .cse7 .cse26 .cse8 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse6 .cse7 .cse8 .cse16 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse3 .cse23 .cse6 .cse20 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse31 .cse2 .cse5 .cse14 .cse6 .cse22 .cse8 .cse10 .cse19 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse22 .cse26 .cse8 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse24 .cse3 .cse6 .cse20 .cse7 .cse26 .cse8 .cse16 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse6 .cse22 .cse28 .cse26 .cse8 .cse16 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse5 .cse14 .cse20 .cse33 .cse7 .cse26 .cse8 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse20 .cse28 .cse21 .cse26 .cse8 .cse16 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse6 .cse20 .cse28 .cse30 .cse26 .cse8 .cse16 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse15 .cse8 .cse16 .cse17 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse23 .cse20 .cse21 .cse8 .cse16 .cse17 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse27 .cse5 .cse7 .cse26 .cse8 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse23 .cse6 .cse20 .cse30 .cse8 .cse16 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse6 .cse7 .cse26 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse14 .cse7 .cse8 .cse16 .cse18 .cse17 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse14 .cse6 .cse22 .cse33 .cse26 .cse8 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse31 .cse2 .cse5 .cse14 .cse6 .cse20 .cse30 .cse8 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse6 .cse20 .cse30 .cse8 .cse16 .cse18 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse31 .cse2 .cse5 .cse14 .cse20 .cse21 .cse8 .cse17 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse5 .cse14 .cse20 .cse33 .cse21 .cse26 .cse8 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse31 .cse2 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse29 .cse14 .cse20 .cse28 .cse7 .cse26 .cse8 .cse16 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse27 .cse5 .cse6 .cse20 .cse30 .cse26 .cse8 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse6 .cse22 .cse8 .cse16 .cse10 .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse2 .cse24 .cse3 .cse20 .cse21 .cse26 .cse8 .cse16 .cse17 .cse10 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse25 .cse14 .cse28 .cse7 .cse26 .cse8 .cse16 .cse17 .cse10 .cse12 .cse13) (and .cse0 .cse32 .cse2 .cse14 .cse6 .cse20 .cse28 .cse7 .cse26 .cse8 .cse16 .cse10 .cse12 .cse13))))) [2020-07-08 12:46:09,404 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_33, v_prenex_34, v_prenex_29, v_prenex_30, v_prenex_31, v_prenex_32, v_prenex_35, v_prenex_36]. (let ((.cse16 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse14 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse18 (* (mod main_~N_LIN~0 4294967296) 4))) (let ((.cse8 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse13 (* (mod main_~k~0 4294967296) 4)) (.cse1 (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse18)) (.cse10 (* (mod main_~k~0 4294967296) 4)) (.cse7 (not .cse14)) (.cse9 (* (mod main_~j~0 4294967296) .cse18)) (.cse2 (* (mod main_~k~0 4294967296) 4)) (.cse0 (select |#memory_int| |main_~#matriz~0.base|)) (.cse12 (* (mod main_~j~0 4294967296) .cse16)) (.cse3 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse4 (not (<= (mod main_~k~0 4294967296) 2147483647))) (.cse5 (= 1 main_~N_LIN~0)) (.cse6 (mod main_~N_LIN~0 4294967296))) (or (and (< (mod v_prenex_33 4294967296) 1) (<= |main_#t~mem4| (select .cse0 (+ .cse1 |main_~#matriz~0.offset| .cse2 (- 17179869184)))) (<= (select .cse0 (+ (* (mod v_prenex_34 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_33 4294967296) .cse3))) main_~maior~0) .cse4 .cse5 (< (mod v_prenex_34 4294967296) .cse6) .cse7) (and (< (mod v_prenex_29 4294967296) 1) .cse8 (<= |main_#t~mem4| (select .cse0 (+ .cse9 .cse10 |main_~#matriz~0.offset|))) (let ((.cse11 (+ (* (mod v_prenex_30 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_29 4294967296) .cse3)))) (or (<= (select .cse0 .cse11) main_~maior~0) (= (+ .cse12 |main_~#matriz~0.offset| .cse13) .cse11))) .cse14 .cse5 (< (mod v_prenex_30 4294967296) .cse6)) (and (< (mod v_prenex_31 4294967296) 1) .cse8 .cse5 (let ((.cse15 (+ (* (mod v_prenex_32 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_31 4294967296) .cse3)))) (or (<= (select .cse0 .cse15) main_~maior~0) (= .cse15 (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse16) |main_~#matriz~0.offset| .cse13)))) (< (mod v_prenex_32 4294967296) .cse6) (<= |main_#t~mem4| (select .cse0 (+ .cse1 .cse10 |main_~#matriz~0.offset|))) .cse7) (and (< (mod v_prenex_35 4294967296) 1) (<= |main_#t~mem4| (select .cse0 (+ .cse9 |main_~#matriz~0.offset| .cse2 (- 17179869184)))) (let ((.cse17 (+ (* (mod v_prenex_36 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_35 4294967296) .cse3)))) (or (<= (select .cse0 .cse17) main_~maior~0) (= .cse17 (+ .cse12 (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))))) .cse4 .cse14 .cse5 (< (mod v_prenex_36 4294967296) .cse6))))) [2020-07-08 12:46:09,407 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:09,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:09,414 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:09,771 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-07-08 12:46:13,901 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-08 12:46:13,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,914 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,922 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,930 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,936 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,951 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,960 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,962 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,987 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:13,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,000 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 2, 2, 2, 2, 1] term [2020-07-08 12:46:14,000 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-08 12:46:14,001 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,026 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,027 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,030 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,032 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,034 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,039 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,041 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,044 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,050 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,051 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,054 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,055 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,057 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,059 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,061 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,065 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,068 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,069 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,073 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,076 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,077 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,079 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,081 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,083 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,084 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,091 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,103 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,105 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,106 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,109 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,110 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,110 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,113 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,115 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,117 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,118 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,120 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,122 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,124 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,126 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,129 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,131 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,133 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,135 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,136 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,137 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,139 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,143 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,144 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,146 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,148 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,150 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,151 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,154 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,155 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,157 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,159 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,161 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,162 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,167 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,178 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,182 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,183 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,189 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,189 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,194 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,195 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,199 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,200 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,204 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,206 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,215 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,226 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,236 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,238 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,242 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,243 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,248 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,252 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,258 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,261 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:14,278 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,280 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:14,292 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:46:15,682 WARN L193 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 58 [2020-07-08 12:46:15,822 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:46:15,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2020-07-08 12:46:15,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:15,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:15,844 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-08 12:46:15,900 INFO L624 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2020-07-08 12:46:15,909 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:46:15,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:81, output treesize:3 [2020-07-08 12:46:15,923 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:46:15,923 WARN L407 uantifierElimination]: Input elimination task: ∃ [main_~j~0, |main_~#matriz~0.offset|, main_~k~0, |#memory_int|, |main_~#matriz~0.base|, v_prenex_31, v_prenex_32]. (let ((.cse0 (select |#memory_int| |main_~#matriz~0.base|))) (and (< (mod v_prenex_31 4294967296) 1) (<= (select .cse0 (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (<= |main_#t~mem6| (select .cse0 |main_~#matriz~0.offset|)) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296)))) [2020-07-08 12:46:15,924 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-08 12:46:15,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:16,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2020-07-08 12:46:16,089 INFO L280 TraceCheckUtils]: 1: Hoare triple {1186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1186#true} is VALID [2020-07-08 12:46:16,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2020-07-08 12:46:16,090 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #52#return; {1186#true} is VALID [2020-07-08 12:46:16,090 INFO L263 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2020-07-08 12:46:16,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {1186#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {1206#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,093 INFO L280 TraceCheckUtils]: 6: Hoare triple {1206#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1210#(and (< (mod main_~j~0 4294967296) 1) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#(and (< (mod main_~j~0 4294967296) 1) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1214#(and (< (mod main_~j~0 4294967296) 1) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {1214#(and (< (mod main_~j~0 4294967296) 1) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,103 INFO L280 TraceCheckUtils]: 9: Hoare triple {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} is VALID [2020-07-08 12:46:16,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {1218#(and (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod main_~j~0 4294967296) 1))) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1234#(or (and (exists ((v_prenex_32 Int) (v_prenex_31 Int)) (and (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 4 (* (mod v_prenex_31 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod v_prenex_32 4294967296))) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296))))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_32 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_31 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0)) (< (mod v_prenex_31 4294967296) 1) (< (mod v_prenex_32 4294967296) (mod main_~N_LIN~0 4294967296)))) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184)))) (<= (mod main_~j~0 4294967296) 2147483647) (= 1 main_~N_LIN~0) (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (and (< (mod v_prenex_35 4294967296) 1) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_36 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_35 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (= (+ (* 4 (mod v_prenex_36 4294967296)) (* 4 (* (mod v_prenex_35 4294967296) (mod main_~N_LIN~0 4294967296))) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))))) (< (mod v_prenex_36 4294967296) (mod main_~N_LIN~0 4294967296)))) (< 2147483647 (mod main_~k~0 4294967296))) (and (<= (mod main_~k~0 4294967296) 2147483647) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (and (< (mod v_prenex_29 4294967296) 1) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_30 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_29 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) (+ (* 4 (* (mod v_prenex_29 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod v_prenex_30 4294967296))))) (< (mod v_prenex_30 4294967296) (mod main_~N_LIN~0 4294967296)))) (<= (mod main_~j~0 4294967296) 2147483647) (= 1 main_~N_LIN~0)) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184)))) (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_33 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod v_prenex_33 4294967296) 1) (< (mod v_prenex_34 4294967296) (mod main_~N_LIN~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (< 2147483647 (mod main_~k~0 4294967296))))} is VALID [2020-07-08 12:46:16,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {1234#(or (and (exists ((v_prenex_32 Int) (v_prenex_31 Int)) (and (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 4 (* (mod v_prenex_31 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod v_prenex_32 4294967296))) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296))))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_32 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_31 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0)) (< (mod v_prenex_31 4294967296) 1) (< (mod v_prenex_32 4294967296) (mod main_~N_LIN~0 4294967296)))) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184)))) (<= (mod main_~j~0 4294967296) 2147483647) (= 1 main_~N_LIN~0) (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (and (< (mod v_prenex_35 4294967296) 1) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_36 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_35 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (= (+ (* 4 (mod v_prenex_36 4294967296)) (* 4 (* (mod v_prenex_35 4294967296) (mod main_~N_LIN~0 4294967296))) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))))) (< (mod v_prenex_36 4294967296) (mod main_~N_LIN~0 4294967296)))) (< 2147483647 (mod main_~k~0 4294967296))) (and (<= (mod main_~k~0 4294967296) 2147483647) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (and (< (mod v_prenex_29 4294967296) 1) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_30 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_29 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) (+ (* 4 (* (mod v_prenex_29 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod v_prenex_30 4294967296))))) (< (mod v_prenex_30 4294967296) (mod main_~N_LIN~0 4294967296)))) (<= (mod main_~j~0 4294967296) 2147483647) (= 1 main_~N_LIN~0)) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184)))) (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) |main_~#matriz~0.offset| (* (mod v_prenex_33 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (< (mod v_prenex_33 4294967296) 1) (< (mod v_prenex_34 4294967296) (mod main_~N_LIN~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (< 2147483647 (mod main_~k~0 4294967296))))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} is VALID [2020-07-08 12:46:16,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} is VALID [2020-07-08 12:46:16,231 INFO L280 TraceCheckUtils]: 16: Hoare triple {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} is VALID [2020-07-08 12:46:16,232 INFO L280 TraceCheckUtils]: 17: Hoare triple {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} is VALID [2020-07-08 12:46:16,233 INFO L280 TraceCheckUtils]: 18: Hoare triple {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} is VALID [2020-07-08 12:46:16,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {1238#(exists ((main_~j~0 Int) (main_~k~0 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (and (< (mod v_prenex_31 4294967296) 1) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod v_prenex_32 4294967296) 1) (= (+ (* 4 (mod v_prenex_31 4294967296)) (* 4 (mod v_prenex_32 4294967296)) 17179869184) (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (mod main_~j~0 4294967296)))) (< 2147483647 (mod main_~j~0 4294967296))))} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1254#(<= |main_#t~mem6| main_~maior~0)} is VALID [2020-07-08 12:46:16,240 INFO L263 TraceCheckUtils]: 20: Hoare triple {1254#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:46:16,241 INFO L280 TraceCheckUtils]: 21: Hoare triple {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:46:16,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {1262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1187#false} is VALID [2020-07-08 12:46:16,242 INFO L280 TraceCheckUtils]: 23: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2020-07-08 12:46:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:46:16,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346365061] [2020-07-08 12:46:16,250 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:46:16,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186821439] [2020-07-08 12:46:16,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:16,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 12:46:16,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974858862] [2020-07-08 12:46:16,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-08 12:46:16,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:16,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:46:16,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:16,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:46:16,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:16,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:46:16,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:46:16,528 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2020-07-08 12:46:17,235 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 34 [2020-07-08 12:46:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,457 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 12:46:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:46:18,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-08 12:46:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:46:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-08 12:46:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:46:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-08 12:46:18,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2020-07-08 12:46:18,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:18,567 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:46:18,567 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:46:18,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:46:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:46:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2020-07-08 12:46:18,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:18,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 25 states. [2020-07-08 12:46:18,602 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 25 states. [2020-07-08 12:46:18,602 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 25 states. [2020-07-08 12:46:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,603 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-08 12:46:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-08 12:46:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:18,604 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 34 states. [2020-07-08 12:46:18,604 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 34 states. [2020-07-08 12:46:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,610 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-08 12:46:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-08 12:46:18,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:18,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:18,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:18,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:46:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 12:46:18,616 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 24 [2020-07-08 12:46:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:18,616 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 12:46:18,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:46:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:46:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:46:18,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:18,618 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:18,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:18,830 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash -153538099, now seen corresponding path program 1 times [2020-07-08 12:46:18,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:18,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344311533] [2020-07-08 12:46:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:18,840 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:46:18,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703815859] [2020-07-08 12:46:18,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:46:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:18,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2020-07-08 12:46:18,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1450#true} is VALID [2020-07-08 12:46:18,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-08 12:46:18,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #52#return; {1450#true} is VALID [2020-07-08 12:46:18,948 INFO L263 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret7 := main(); {1450#true} is VALID [2020-07-08 12:46:18,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {1450#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,969 INFO L280 TraceCheckUtils]: 7: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,975 INFO L280 TraceCheckUtils]: 9: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-08 12:46:18,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {1470#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1489#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} is VALID [2020-07-08 12:46:18,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {1489#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1451#false} is VALID [2020-07-08 12:46:18,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {1451#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1451#false} is VALID [2020-07-08 12:46:18,978 INFO L280 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {1451#false} is VALID [2020-07-08 12:46:18,978 INFO L280 TraceCheckUtils]: 15: Hoare triple {1451#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1451#false} is VALID [2020-07-08 12:46:18,979 INFO L280 TraceCheckUtils]: 16: Hoare triple {1451#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1451#false} is VALID [2020-07-08 12:46:18,979 INFO L280 TraceCheckUtils]: 17: Hoare triple {1451#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1451#false} is VALID [2020-07-08 12:46:18,979 INFO L280 TraceCheckUtils]: 18: Hoare triple {1451#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1451#false} is VALID [2020-07-08 12:46:18,979 INFO L280 TraceCheckUtils]: 19: Hoare triple {1451#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1451#false} is VALID [2020-07-08 12:46:18,980 INFO L263 TraceCheckUtils]: 20: Hoare triple {1451#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1451#false} is VALID [2020-07-08 12:46:18,980 INFO L280 TraceCheckUtils]: 21: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2020-07-08 12:46:18,980 INFO L280 TraceCheckUtils]: 22: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2020-07-08 12:46:18,980 INFO L280 TraceCheckUtils]: 23: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2020-07-08 12:46:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:46:18,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344311533] [2020-07-08 12:46:18,982 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:46:18,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703815859] [2020-07-08 12:46:18,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:18,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-08 12:46:18,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744256242] [2020-07-08 12:46:18,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 12:46:18,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:18,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:46:19,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:19,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:46:19,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:46:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:19,045 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-08 12:46:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,133 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-08 12:46:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:46:19,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 12:46:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-08 12:46:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-08 12:46:19,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2020-07-08 12:46:19,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:19,188 INFO L225 Difference]: With dead ends: 29 [2020-07-08 12:46:19,188 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:46:19,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:46:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:46:19,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:19,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,189 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,189 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,190 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,190 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,191 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:19,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:46:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:46:19,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-08 12:46:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:19,195 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:46:19,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:46:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-08 12:46:19,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:46:19,668 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-08 12:46:19,834 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-07-08 12:46:19,839 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:19,840 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,840 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,840 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:46:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:19,840 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,840 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2020-07-08 12:46:19,840 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2020-07-08 12:46:19,841 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 1 main_~N_LIN~0))) (or (and .cse0 (= 0 main_~j~0) .cse1) (and .cse0 (= 1 main_~k~0) (= 1 main_~j~0) .cse1 (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)))) main_~maior~0) (<= (mod main_~k~0 4294967296) 2147483647) (< (mod main_~j~0 4294967296) 1) (<= (mod main_~j~0 4294967296) 2147483647)))))) [2020-07-08 12:46:19,841 INFO L268 CegarLoopResult]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2020-07-08 12:46:19,841 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2020-07-08 12:46:19,841 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2020-07-08 12:46:19,841 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= |main_#t~mem6| main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0)) [2020-07-08 12:46:19,841 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-08 12:46:19,841 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-08 12:46:19,841 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2020-07-08 12:46:19,842 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 0 main_~j~0)) (.cse2 (= 1 main_~N_LIN~0))) (or (and .cse0 (= 1 main_~k~0) .cse1 .cse2 (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~k~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< (mod main_~j~0 4294967296) 1) (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (mod main_~j~0 4294967296) 2147483647)))) (and (= 0 main_~k~0) .cse0 .cse1 .cse2))) [2020-07-08 12:46:19,842 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-08 12:46:19,843 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:19,843 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:46:19,843 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:19,843 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-08 12:46:19,843 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:19,848 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:19,856 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,856 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:19,856 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:19,856 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-08 12:46:19,856 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-08 12:46:19,860 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,860 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,860 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:19,860 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:46:19,861 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:19,862 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-08 12:46:19,862 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:46:19,862 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:19,862 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:19,862 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:19,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:19 BoogieIcfgContainer [2020-07-08 12:46:19,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:19,888 INFO L168 Benchmark]: Toolchain (without parser) took 39584.03 ms. Allocated memory was 142.1 MB in the beginning and 347.6 MB in the end (delta: 205.5 MB). Free memory was 105.5 MB in the beginning and 156.5 MB in the end (delta: -51.0 MB). Peak memory consumption was 154.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,889 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.78 ms. Allocated memory is still 142.1 MB. Free memory was 105.3 MB in the beginning and 94.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,890 INFO L168 Benchmark]: Boogie Preprocessor took 134.28 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 94.7 MB in the beginning and 181.4 MB in the end (delta: -86.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,890 INFO L168 Benchmark]: RCFGBuilder took 446.64 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 158.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,891 INFO L168 Benchmark]: TraceAbstraction took 38731.07 ms. Allocated memory was 203.9 MB in the beginning and 347.6 MB in the end (delta: 143.7 MB). Free memory was 158.4 MB in the beginning and 156.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 145.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,893 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.78 ms. Allocated memory is still 142.1 MB. Free memory was 105.3 MB in the beginning and 94.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.28 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 94.7 MB in the beginning and 181.4 MB in the end (delta: -86.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 446.64 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 158.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38731.07 ms. Allocated memory was 203.9 MB in the beginning and 347.6 MB in the end (delta: 143.7 MB). Free memory was 158.4 MB in the beginning and 156.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 145.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2020-07-08 12:46:19,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((1 == N_COL && 1 == k) && 0 == j) && 1 == N_LIN) && (\exists main_~j~0 : int, main_~k~0 : int :: (((main_~k~0 % 4294967296 <= 2147483647 && unknown-#memory_int-unknown[matriz][main_~j~0 % 4294967296 * (N_LIN % 4294967296 * 4) + main_~k~0 % 4294967296 * 4 + matriz] <= maior) && main_~j~0 % 4294967296 < 1) && main_~k~0 % 4294967296 < N_LIN % 4294967296) && main_~j~0 % 4294967296 <= 2147483647)) || (((0 == k && 1 == N_COL) && 0 == j) && 1 == N_LIN) - InvariantResult [Line: 19]: Loop Invariant [2020-07-08 12:46:19,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-08 12:46:19,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~j~0,QUANTIFIED] [2020-07-08 12:46:19,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((1 == N_COL && 0 == j) && 1 == N_LIN) || ((((1 == N_COL && 1 == k) && 1 == j) && 1 == N_LIN) && (\exists main_~j~0 : int, main_~k~0 : int :: (((main_~k~0 % 4294967296 < N_LIN % 4294967296 && unknown-#memory_int-unknown[matriz][main_~k~0 % 4294967296 * 4 + matriz + main_~j~0 % 4294967296 * (N_LIN % 4294967296 * 4)] <= maior) && main_~k~0 % 4294967296 <= 2147483647) && main_~j~0 % 4294967296 < 1) && main_~j~0 % 4294967296 <= 2147483647)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 38.1s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 72 SDslu, 254 SDs, 0 SdLazy, 316 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 165 HoareAnnotationTreeSize, 15 FomulaSimplifications, 271 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 144 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 11 QuantifiedInterpolants, 30547 SizeOfPredicates, 40 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 18/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...