/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-267fbe0 [2020-07-17 22:50:14,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:14,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:14,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:14,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:14,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:14,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:14,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:14,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:14,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:14,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:14,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:14,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:14,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:14,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:14,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:14,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:14,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:14,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:14,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:14,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:14,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:14,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:14,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:14,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:14,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:14,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:14,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:14,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:14,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:14,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:14,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:14,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:14,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:14,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:14,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:14,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:14,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:14,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:14,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:14,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:14,579 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-17 22:50:14,617 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:14,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:14,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:14,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:14,622 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:14,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:14,624 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:14,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:14,626 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:14,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:14,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:14,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:14,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:14,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:14,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:14,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:14,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:14,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:14,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:14,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:14,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:14,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:14,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:14,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:14,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:14,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:14,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:14,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:14,919 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:14,920 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:14,921 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-17 22:50:14,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d47786a/10f5597c94ae439e926b8ed3f65f807b/FLAG8c1a22b20 [2020-07-17 22:50:15,423 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:15,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2020-07-17 22:50:15,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d47786a/10f5597c94ae439e926b8ed3f65f807b/FLAG8c1a22b20 [2020-07-17 22:50:15,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d47786a/10f5597c94ae439e926b8ed3f65f807b [2020-07-17 22:50:15,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:15,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:15,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:15,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:15,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:15,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:15" (1/1) ... [2020-07-17 22:50:15,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350b76b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:15, skipping insertion in model container [2020-07-17 22:50:15,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:15" (1/1) ... [2020-07-17 22:50:15,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:15,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:15,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:15,988 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:16,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:16,033 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:16,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16 WrapperNode [2020-07-17 22:50:16,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:16,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:16,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:16,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:16,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (1/1) ... [2020-07-17 22:50:16,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:16,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:16,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:16,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:16,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (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-17 22:50:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:50:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:16,622 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:16,622 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:50:16,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:16 BoogieIcfgContainer [2020-07-17 22:50:16,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:16,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:16,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:16,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:16,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:15" (1/3) ... [2020-07-17 22:50:16,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a256334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:16, skipping insertion in model container [2020-07-17 22:50:16,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:16" (2/3) ... [2020-07-17 22:50:16,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a256334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:16, skipping insertion in model container [2020-07-17 22:50:16,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:16" (3/3) ... [2020-07-17 22:50:16,638 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2020-07-17 22:50:16,650 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:16,658 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:16,673 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:16,695 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:16,695 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:16,695 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:16,695 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:16,695 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:16,696 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:16,696 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:16,696 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-17 22:50:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:50:16,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:16,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:16,717 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2020-07-17 22:50:16,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:16,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245863074] [2020-07-17 22:50:16,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:16,819 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:16,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558161325] [2020-07-17 22:50:16,820 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-17 22:50:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-17 22:50:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:16,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-17 22:50:16,958 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-17 22:50:16,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-17 22:50:16,959 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #52#return; {27#true} is VALID [2020-07-17 22:50:16,960 INFO L263 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2020-07-17 22:50:16,960 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-17 22:50:16,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-17 22:50:16,963 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-17 22:50:16,964 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-17 22:50:16,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-17 22:50:16,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-17 22:50:16,965 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-17 22:50:16,968 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-17 22:50:16,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245863074] [2020-07-17 22:50:16,969 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:16,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558161325] [2020-07-17 22:50:16,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:16,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:16,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606072344] [2020-07-17 22:50:16,978 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-17 22:50:16,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:16,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:17,015 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-17 22:50:17,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:17,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:17,028 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-17 22:50:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,105 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-17 22:50:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:17,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-17 22:50:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-17 22:50:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-17 22:50:17,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2020-07-17 22:50:17,232 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-17 22:50:17,254 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:50:17,254 INFO L226 Difference]: Without dead ends: 17 [2020-07-17 22:50:17,259 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-17 22:50:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-17 22:50:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-17 22:50:17,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:17,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-17 22:50:17,308 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-17 22:50:17,308 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-17 22:50:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,312 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-17 22:50:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-17 22:50:17,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:17,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:17,313 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-17 22:50:17,314 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-17 22:50:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,317 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-17 22:50:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-17 22:50:17,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:17,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:17,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:17,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:50:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-17 22:50:17,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-07-17 22:50:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:17,324 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-17 22:50:17,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-17 22:50:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:50:17,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:17,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:17,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-17 22:50:17,539 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2020-07-17 22:50:17,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:17,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274565545] [2020-07-17 22:50:17,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:17,555 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:17,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245241029] [2020-07-17 22:50:17,556 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-17 22:50:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:17,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:17,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:17,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2020-07-17 22:50:17,678 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-17 22:50:17,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2020-07-17 22:50:17,679 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #52#return; {177#true} is VALID [2020-07-17 22:50:17,679 INFO L263 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret7 := main(); {177#true} is VALID [2020-07-17 22:50:17,682 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-17 22:50:17,684 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-17 22:50:17,685 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-17 22:50:17,686 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-17 22:50:17,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2020-07-17 22:50:17,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {178#false} assume 0 == ~cond; {178#false} is VALID [2020-07-17 22:50:17,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {178#false} assume !false; {178#false} is VALID [2020-07-17 22:50:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:17,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274565545] [2020-07-17 22:50:17,689 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:17,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245241029] [2020-07-17 22:50:17,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:17,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:17,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229801970] [2020-07-17 22:50:17,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-17 22:50:17,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:17,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:17,729 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-17 22:50:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:17,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:17,731 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2020-07-17 22:50:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,823 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-17 22:50:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:17,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-17 22:50:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-17 22:50:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-17 22:50:17,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2020-07-17 22:50:17,882 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-17 22:50:17,884 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:50:17,884 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:50:17,885 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-17 22:50:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:50:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-17 22:50:17,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:17,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 18 states. [2020-07-17 22:50:17,896 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 18 states. [2020-07-17 22:50:17,896 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 18 states. [2020-07-17 22:50:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,899 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:50:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:50:17,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:17,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:17,900 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states. [2020-07-17 22:50:17,900 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states. [2020-07-17 22:50:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:17,902 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:50:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:50:17,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:17,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:17,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:17,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:50:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-17 22:50:17,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2020-07-17 22:50:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:17,906 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-17 22:50:17,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:50:17,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:17,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:18,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:18,108 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2020-07-17 22:50:18,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:18,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281686386] [2020-07-17 22:50:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:18,123 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:18,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989333904] [2020-07-17 22:50:18,124 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-17 22:50:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:18,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:50:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:18,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:18,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-17 22:50:18,250 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-17 22:50:18,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-17 22:50:18,251 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #52#return; {326#true} is VALID [2020-07-17 22:50:18,252 INFO L263 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret7 := main(); {326#true} is VALID [2020-07-17 22:50:18,254 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-17 22:50:18,256 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-17 22:50:18,257 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-17 22:50:18,258 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-17 22:50:18,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {327#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {327#false} is VALID [2020-07-17 22:50:18,258 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-17 22:50:18,259 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-17 22:50:18,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2020-07-17 22:50:18,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2020-07-17 22:50:18,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-17 22:50:18,262 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-17 22:50:18,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281686386] [2020-07-17 22:50:18,262 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:18,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989333904] [2020-07-17 22:50:18,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:18,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:18,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969498045] [2020-07-17 22:50:18,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-17 22:50:18,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:18,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:18,289 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-17 22:50:18,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:18,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:18,291 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-17 22:50:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:18,421 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-17 22:50:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:18,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-17 22:50:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-17 22:50:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-17 22:50:18,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-17 22:50:18,484 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-17 22:50:18,485 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:50:18,485 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:50:18,486 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-17 22:50:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:50:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-17 22:50:18,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:18,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-17 22:50:18,512 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-17 22:50:18,512 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-17 22:50:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:18,514 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-17 22:50:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:50:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:18,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:18,515 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-17 22:50:18,515 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-17 22:50:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:18,517 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-17 22:50:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-17 22:50:18,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:18,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:18,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:18,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:50:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-17 22:50:18,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2020-07-17 22:50:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:18,520 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-17 22:50:18,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:50:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:18,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:18,522 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-17 22:50:18,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:18,736 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2020-07-17 22:50:18,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:18,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509696255] [2020-07-17 22:50:18,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:18,753 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:18,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291138091] [2020-07-17 22:50:18,754 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-17 22:50:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:18,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:50:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:18,826 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:21,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:21,062 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:21,587 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 29 [2020-07-17 22:50:21,588 INFO L624 ElimStorePlain]: treesize reduction 398, result has 8.3 percent of original size [2020-07-17 22:50:21,589 INFO L512 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2020-07-17 22:50:21,589 INFO L512 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2020-07-17 22:50:21,589 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2020-07-17 22:50:21,589 INFO L512 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2020-07-17 22:50:21,590 INFO L512 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2020-07-17 22:50:21,590 INFO L512 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2020-07-17 22:50:21,604 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-17 22:50:21,605 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:21,667 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:21,669 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-17 22:50:21,669 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:497, output treesize:10 [2020-07-17 22:50:22,080 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:22,081 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, v_prenex_4, v_prenex_5, v_prenex_6, v_prenex_9, v_prenex_10, v_prenex_11, v_prenex_12, v_prenex_13, v_prenex_14, |v_#memory_int_7|, |v_main_#t~nondet3_3|, v_prenex_1, v_prenex_2, v_prenex_7, v_prenex_8]. (let ((.cse12 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse1 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse10 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse16 (mod main_~j~0 4294967296)) (.cse19 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (.cse18 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse17 (* (mod main_~N_LIN~0 4294967296) 4))) (let ((.cse13 (* .cse18 .cse17)) (.cse9 (* .cse16 .cse19)) (.cse4 (not .cse10)) (.cse11 (not .cse1)) (.cse2 (* .cse18 .cse19)) (.cse14 (* (mod main_~k~0 4294967296) 4)) (.cse8 (not .cse12)) (.cse0 (= 0 main_~k~0)) (.cse5 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse6 (= 0 main_~j~0)) (.cse7 (= 1 main_~N_LIN~0)) (.cse15 (* .cse16 .cse17)) (.cse3 (* (mod main_~k~0 4294967296) 4))) (or (and .cse0 .cse1 (= |#memory_int| (store v_prenex_3 |main_~#matriz~0.base| (store (select v_prenex_3 |main_~#matriz~0.base|) (+ .cse2 |main_~#matriz~0.offset| .cse3) v_prenex_4))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse6 (= (store v_prenex_5 |main_~#matriz~0.base| (store (select v_prenex_5 |main_~#matriz~0.base|) (+ .cse9 |main_~#matriz~0.offset| .cse3) v_prenex_6)) |#memory_int|) .cse7 .cse8 .cse10) (and .cse0 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 (= |#memory_int| (store v_prenex_9 |main_~#matriz~0.base| (store (select v_prenex_9 |main_~#matriz~0.base|) (+ .cse13 |main_~#matriz~0.offset| .cse14 (- 17179869184)) v_prenex_10)))) (and .cse0 .cse11 .cse5 .cse12 .cse6 .cse7 (= (store v_prenex_11 |main_~#matriz~0.base| (store (select v_prenex_11 |main_~#matriz~0.base|) (+ .cse15 |main_~#matriz~0.offset| .cse14 (- 17179869184)) v_prenex_12)) |#memory_int|) .cse10) (and .cse0 .cse1 (= (store v_prenex_13 |main_~#matriz~0.base| (store (select v_prenex_13 |main_~#matriz~0.base|) (+ .cse13 |main_~#matriz~0.offset| .cse3) v_prenex_14)) |#memory_int|) .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse11 .cse5 (= |#memory_int| (store |v_#memory_int_7| |main_~#matriz~0.base| (store (select |v_#memory_int_7| |main_~#matriz~0.base|) (+ .cse9 |main_~#matriz~0.offset| .cse14 (- 17179869184)) |v_main_#t~nondet3_3|))) .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse4 .cse11 .cse5 (= |#memory_int| (store v_prenex_1 |main_~#matriz~0.base| (store (select v_prenex_1 |main_~#matriz~0.base|) (+ .cse2 |main_~#matriz~0.offset| .cse14 (- 17179869184)) v_prenex_2))) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse12 .cse6 .cse7 (= (store v_prenex_7 |main_~#matriz~0.base| (store (select v_prenex_7 |main_~#matriz~0.base|) (+ .cse15 |main_~#matriz~0.offset| .cse3) v_prenex_8)) |#memory_int|) .cse10)))) [2020-07-17 22:50:22,081 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0)) [2020-07-17 22:50:22,189 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-17 22:50:22,199 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:22,203 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:22,203 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-17 22:50:22,203 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 22:50:22,207 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:22,207 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-17 22:50:22,208 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-17 22:50:22,243 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:22,291 INFO L263 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2020-07-17 22:50:22,292 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-17 22:50:22,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-17 22:50:22,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #52#return; {493#true} is VALID [2020-07-17 22:50:22,293 INFO L263 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2020-07-17 22:50:22,294 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-17 22:50:22,296 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-17 22:50:22,298 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-17 22:50:22,300 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-17 22:50:22,301 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-17 22:50:22,301 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-17 22:50:22,302 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-17 22:50:22,303 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-17 22:50:22,304 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-17 22:50:22,305 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-17 22:50:22,306 INFO L280 TraceCheckUtils]: 15: Hoare triple {544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:22,307 INFO L280 TraceCheckUtils]: 16: Hoare triple {548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {494#false} is VALID [2020-07-17 22:50:22,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-17 22:50:22,309 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-17 22:50:22,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509696255] [2020-07-17 22:50:22,309 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:22,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291138091] [2020-07-17 22:50:22,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:22,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:50:22,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5132137] [2020-07-17 22:50:22,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-17 22:50:22,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:22,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:22,349 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-17 22:50:22,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:22,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:22,351 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2020-07-17 22:50:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:22,873 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-17 22:50:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:22,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-17 22:50:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:50:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:50:22,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-17 22:50:22,960 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-17 22:50:22,963 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:50:22,963 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:50:22,964 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-17 22:50:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:50:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-07-17 22:50:23,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:23,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2020-07-17 22:50:23,009 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2020-07-17 22:50:23,009 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2020-07-17 22:50:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:23,013 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-17 22:50:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-17 22:50:23,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:23,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:23,014 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2020-07-17 22:50:23,014 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2020-07-17 22:50:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:23,020 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-17 22:50:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-17 22:50:23,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:23,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:23,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:23,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:50:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-17 22:50:23,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-07-17 22:50:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:23,028 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-17 22:50:23,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-17 22:50:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:23,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:23,033 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-17 22:50:23,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:23,235 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2020-07-17 22:50:23,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:23,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753845742] [2020-07-17 22:50:23,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:23,246 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:23,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996285062] [2020-07-17 22:50:23,247 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-17 22:50:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:23,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:50:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:23,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:23,387 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-17 22:50:23,388 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:23,393 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:23,394 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-17 22:50:23,394 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2020-07-17 22:50:23,398 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:23,398 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-17 22:50:23,399 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|) [2020-07-17 22:50:23,453 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-17 22:50:23,467 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:23,470 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:23,470 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-17 22:50:23,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-07-17 22:50:23,473 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:23,473 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-17 22:50:23,473 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem6| 1) main_~maior~0) [2020-07-17 22:50:23,503 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:23,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2020-07-17 22:50:23,560 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-17 22:50:23,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2020-07-17 22:50:23,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #52#return; {718#true} is VALID [2020-07-17 22:50:23,561 INFO L263 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret7 := main(); {718#true} is VALID [2020-07-17 22:50:23,563 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-17 22:50:23,563 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-17 22:50:23,565 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-17 22:50:23,566 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-17 22:50:23,567 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-17 22:50:23,567 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-17 22:50:23,568 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-17 22:50:23,568 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-17 22:50:23,569 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-17 22:50:23,570 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-17 22:50:23,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {770#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {774#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:23,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {719#false} is VALID [2020-07-17 22:50:23,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {719#false} assume !false; {719#false} is VALID [2020-07-17 22:50:23,572 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-17 22:50:23,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753845742] [2020-07-17 22:50:23,573 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:23,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996285062] [2020-07-17 22:50:23,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:23,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:50:23,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492786240] [2020-07-17 22:50:23,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-17 22:50:23,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:23,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:50:23,602 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-17 22:50:23,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:50:23,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:50:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:23,604 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 9 states. [2020-07-17 22:50:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,293 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:50:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:50:24,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-17 22:50:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-17 22:50:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-17 22:50:24,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2020-07-17 22:50:24,386 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-17 22:50:24,388 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:50:24,388 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:50:24,389 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-17 22:50:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:50:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-07-17 22:50:24,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:24,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2020-07-17 22:50:24,412 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2020-07-17 22:50:24,412 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2020-07-17 22:50:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,416 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-17 22:50:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-17 22:50:24,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,417 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2020-07-17 22:50:24,417 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2020-07-17 22:50:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,419 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-17 22:50:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-17 22:50:24,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:24,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:50:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-17 22:50:24,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2020-07-17 22:50:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:24,423 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-17 22:50:24,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:50:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-17 22:50:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:50:24,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:24,424 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-17 22:50:24,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:24,639 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -422232267, now seen corresponding path program 2 times [2020-07-17 22:50:24,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:24,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897918974] [2020-07-17 22:50:24,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:24,651 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:24,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341716635] [2020-07-17 22:50:24,652 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-17 22:50:24,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:24,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:24,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:24,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-17 22:50:24,785 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-17 22:50:24,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:50:24,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #52#return; {966#true} is VALID [2020-07-17 22:50:24,786 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret7 := main(); {966#true} is VALID [2020-07-17 22:50:24,788 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-17 22:50:24,789 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-17 22:50:24,790 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-17 22:50:24,792 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-17 22:50:24,793 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-17 22:50:24,796 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-17 22:50:24,796 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-17 22:50:24,797 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-17 22:50:24,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {967#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {967#false} is VALID [2020-07-17 22:50:24,797 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-17 22:50:24,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {967#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {967#false} is VALID [2020-07-17 22:50:24,798 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-17 22:50:24,798 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-17 22:50:24,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2020-07-17 22:50:24,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2020-07-17 22:50:24,799 INFO L280 TraceCheckUtils]: 20: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-17 22:50:24,800 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-17 22:50:24,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897918974] [2020-07-17 22:50:24,800 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:24,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341716635] [2020-07-17 22:50:24,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:50:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752629358] [2020-07-17 22:50:24,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-17 22:50:24,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:24,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:24,836 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-17 22:50:24,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:24,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:24,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:24,838 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2020-07-17 22:50:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,942 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:50:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:24,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-17 22:50:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-17 22:50:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-17 22:50:24,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-17 22:50:25,011 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-17 22:50:25,012 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:50:25,012 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:50:25,013 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-17 22:50:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:50:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 22:50:25,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:25,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-17 22:50:25,039 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:50:25,039 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:50:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,041 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:50:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:25,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,042 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:50:25,042 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:50:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,044 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:50:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:25,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:25,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:50:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:50:25,046 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-17 22:50:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:25,047 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:50:25,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:50:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:50:25,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:25,048 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-17 22:50:25,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:25,257 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 239488911, now seen corresponding path program 3 times [2020-07-17 22:50:25,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:25,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117096290] [2020-07-17 22:50:25,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:25,268 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:25,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812379861] [2020-07-17 22:50:25,268 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-17 22:50:25,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:50:25,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:25,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:50:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:27,484 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:27,485 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:27,821 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 29 [2020-07-17 22:50:27,823 INFO L624 ElimStorePlain]: treesize reduction 400, result has 8.3 percent of original size [2020-07-17 22:50:27,823 INFO L512 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2020-07-17 22:50:27,823 INFO L512 ElimStorePlain]: Eliminatee v_prenex_25 vanished before elimination [2020-07-17 22:50:27,823 INFO L512 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2020-07-17 22:50:27,823 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2020-07-17 22:50:27,826 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-17 22:50:27,827 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:27,838 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:27,838 INFO L512 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2020-07-17 22:50:27,839 INFO L512 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2020-07-17 22:50:27,840 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-17 22:50:27,840 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:497, output treesize:10 [2020-07-17 22:50:28,704 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:28,705 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_15, v_prenex_16, v_prenex_21, v_prenex_22, v_prenex_23, v_prenex_24, v_prenex_17, v_prenex_18, v_prenex_25, v_prenex_26, v_prenex_19, v_prenex_20, |v_#memory_int_9|, |v_main_#t~nondet3_5|, v_prenex_27, v_prenex_28]. (let ((.cse12 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse9 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse2 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse16 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse19 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse18 (mod main_~j~0 4294967296)) (.cse17 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse11 (* .cse18 .cse17)) (.cse13 (* (mod main_~k~0 4294967296) 4)) (.cse8 (* .cse16 .cse19)) (.cse15 (* .cse18 .cse19)) (.cse0 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse1 (= 0 main_~k~0)) (.cse10 (not .cse2)) (.cse3 (not .cse9)) (.cse4 (not .cse12)) (.cse7 (* (mod main_~k~0 4294967296) 4)) (.cse14 (* .cse16 .cse17)) (.cse5 (= 0 main_~j~0)) (.cse6 (= 1 main_~N_LIN~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (store v_prenex_15 |main_~#matriz~0.base| (store (select v_prenex_15 |main_~#matriz~0.base|) (+ .cse7 .cse8 |main_~#matriz~0.offset| (- 17179869184)) v_prenex_16)) |#memory_int|)) (and .cse0 .cse1 .cse9 .cse10 .cse4 (= |#memory_int| (store v_prenex_21 |main_~#matriz~0.base| (store (select v_prenex_21 |main_~#matriz~0.base|) (+ .cse7 |main_~#matriz~0.offset| .cse11 (- 17179869184)) v_prenex_22))) .cse5 .cse6) (and .cse0 .cse1 .cse10 .cse3 .cse12 .cse5 (= (store v_prenex_23 |main_~#matriz~0.base| (store (select v_prenex_23 |main_~#matriz~0.base|) (+ .cse13 .cse14 |main_~#matriz~0.offset|) v_prenex_24)) |#memory_int|) .cse6) (and .cse0 .cse1 .cse9 .cse2 .cse12 .cse5 (= |#memory_int| (store v_prenex_17 |main_~#matriz~0.base| (store (select v_prenex_17 |main_~#matriz~0.base|) (+ .cse13 |main_~#matriz~0.offset| .cse15) v_prenex_18))) .cse6) (and .cse0 .cse1 .cse9 .cse10 .cse12 .cse5 .cse6 (= |#memory_int| (store v_prenex_25 |main_~#matriz~0.base| (store (select v_prenex_25 |main_~#matriz~0.base|) (+ .cse13 |main_~#matriz~0.offset| .cse11) v_prenex_26)))) (and .cse0 .cse1 .cse2 .cse3 (= (store v_prenex_19 |main_~#matriz~0.base| (store (select v_prenex_19 |main_~#matriz~0.base|) (+ .cse13 .cse8 |main_~#matriz~0.offset|) v_prenex_20)) |#memory_int|) .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse2 .cse4 (= (store |v_#memory_int_9| |main_~#matriz~0.base| (store (select |v_#memory_int_9| |main_~#matriz~0.base|) (+ .cse7 |main_~#matriz~0.offset| .cse15 (- 17179869184)) |v_main_#t~nondet3_5|)) |#memory_int|) .cse5 .cse6) (and .cse0 .cse1 .cse10 .cse3 .cse4 (= (store v_prenex_27 |main_~#matriz~0.base| (store (select v_prenex_27 |main_~#matriz~0.base|) (+ .cse7 .cse14 |main_~#matriz~0.offset| (- 17179869184)) v_prenex_28)) |#memory_int|) .cse5 .cse6)))) [2020-07-17 22:50:28,705 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0)) [2020-07-17 22:50:32,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,842 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,848 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,849 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:32,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:33,105 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:33,106 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:33,261 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:33,261 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:33,415 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:33,416 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:33,607 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:33,608 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:33,801 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:33,802 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:34,036 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:34,037 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:34,295 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:34,296 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:34,591 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-17 22:50:34,592 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:34,592 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 36 treesize of output 85 [2020-07-17 22:50:34,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:34,604 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:34,753 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:34,754 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:34,924 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:34,925 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:35,082 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:35,083 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:35,295 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:35,295 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:35,489 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:35,490 INFO L544 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:35,698 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:35,699 INFO L544 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:35,972 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-07-17 22:50:35,975 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:35,976 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 35 treesize of output 82 [2020-07-17 22:50:35,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:35,994 INFO L544 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,161 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:36,162 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 34 treesize of output 79 [2020-07-17 22:50:36,166 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:36,173 INFO L544 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,302 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:36,303 INFO L544 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:36,423 INFO L544 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:36,544 INFO L544 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,693 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:36,693 INFO L544 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:36,834 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:36,834 INFO L544 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,039 INFO L544 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,138 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,139 INFO L544 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,246 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,247 INFO L544 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,371 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,371 INFO L544 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,508 INFO L544 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,626 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,626 INFO L544 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,755 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,756 INFO L544 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:37,899 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:37,900 INFO L544 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,054 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,054 INFO L544 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,212 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,212 INFO L544 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,389 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,389 INFO L544 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,507 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,508 INFO L544 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,591 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,592 INFO L544 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,686 INFO L544 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,771 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,772 INFO L544 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,863 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,863 INFO L544 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:38,959 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:38,959 INFO L544 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,075 INFO L544 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,186 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,187 INFO L544 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,301 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,302 INFO L544 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,411 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,411 INFO L544 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,531 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,531 INFO L544 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,630 INFO L544 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:39,731 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 37 treesize of output 36 [2020-07-17 22:50:39,733 INFO L544 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,818 INFO L544 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,875 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,875 INFO L544 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:39,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:39,939 INFO L544 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,005 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,006 INFO L544 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,070 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,071 INFO L544 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,136 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,136 INFO L544 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,211 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,211 INFO L544 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,273 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,274 INFO L544 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,339 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,339 INFO L544 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,400 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,401 INFO L544 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,465 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,466 INFO L544 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,525 INFO L544 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,581 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,582 INFO L544 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,637 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,637 INFO L544 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,689 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,690 INFO L544 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,738 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,738 INFO L544 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,785 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,786 INFO L544 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,827 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,827 INFO L544 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:40,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-17 22:50:40,870 INFO L544 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:41,358 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2020-07-17 22:50:41,361 INFO L624 ElimStorePlain]: treesize reduction 168, result has 66.7 percent of original size [2020-07-17 22:50:41,363 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-07-17 22:50:41,364 INFO L244 ElimStorePlain]: Needed 65 recursive calls to eliminate 2 variables, input treesize:6209, output treesize:243 [2020-07-17 22:50:41,503 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:41,504 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, |v_main_#t~nondet3_6|]. (let ((.cse47 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (.cse46 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse48 (mod main_~j~0 4294967296)) (.cse49 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse44 (mod main_~j~0 4294967296)) (.cse45 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse51 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse50 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse11 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse3 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse0 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse10 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse21 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse32 (* (mod main_~k~0 4294967296) 4)) (.cse31 (* .cse51 .cse50)) (.cse35 (* (mod main_~k~0 4294967296) 4)) (.cse37 (* .cse51 .cse45)) (.cse16 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse40 (* .cse44 .cse50)) (.cse39 (* .cse48 .cse49)) (.cse42 (* .cse46 .cse49)) (.cse34 (* .cse48 .cse47)) (.cse33 (select |#memory_int| |main_~#matriz~0.base|)) (.cse43 (* (mod main_~k~0 4294967296) 4)) (.cse36 (* .cse46 .cse47)) (.cse30 (select |v_#memory_int_10| |main_~#matriz~0.base|)) (.cse38 (* .cse44 .cse45)) (.cse41 (* (mod main_~k~0 4294967296) 4))) (let ((.cse12 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse38 .cse41 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)))) (.cse14 (<= |main_#t~mem4| (select .cse33 (+ .cse43 .cse36 |main_~#matriz~0.offset| (- 17179869184))))) (.cse25 (<= |main_#t~mem4| (select .cse33 (+ .cse43 |main_~#matriz~0.offset| .cse34 (- 17179869184))))) (.cse1 (<= |main_#t~mem4| (select .cse33 (+ .cse43 |main_~#matriz~0.offset| .cse42 (- 17179869184))))) (.cse28 (<= |main_#t~mem4| (select .cse33 (+ .cse43 |main_~#matriz~0.offset| .cse39 (- 17179869184))))) (.cse15 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse41 .cse40 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse9 (not .cse16)) (.cse23 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse41 .cse37 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse22 (<= |main_#t~mem4| (select .cse33 (+ |main_~#matriz~0.offset| .cse35 .cse42)))) (.cse24 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse31 .cse41 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse4 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse40 |main_~#matriz~0.offset| .cse32 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse29 (<= |main_#t~mem4| (select .cse33 (+ |main_~#matriz~0.offset| .cse35 .cse39)))) (.cse27 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse38 |main_~#matriz~0.offset| .cse32 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse19 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse37 |main_~#matriz~0.offset| .cse32 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse17 (<= |main_#t~mem4| (select .cse33 (+ .cse36 |main_~#matriz~0.offset| .cse35)))) (.cse8 (not .cse21)) (.cse2 (not .cse10)) (.cse18 (not .cse0)) (.cse13 (not .cse3)) (.cse20 (<= |main_#t~mem4| (select .cse33 (+ |main_~#matriz~0.offset| .cse34 .cse35)))) (.cse5 (<= (select .cse30 |main_~#matriz~0.offset|) main_~maior~0)) (.cse26 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse30 (+ .cse31 |main_~#matriz~0.offset| .cse32 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse6 (= 1 main_~N_LIN~0)) (.cse7 (not .cse11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse11 .cse3 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse10 .cse0 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse16 .cse13 .cse5 .cse17 .cse6 .cse12 .cse8) (and .cse11 .cse2 .cse18 .cse13 .cse14 .cse19 .cse5 .cse6 .cse8 .cse9) (and .cse11 .cse2 .cse16 .cse18 .cse13 .cse19 .cse20 .cse5 .cse6 .cse21) (and .cse0 .cse2 .cse16 .cse13 .cse4 .cse20 .cse5 .cse6 .cse7 .cse21) (and .cse10 .cse11 .cse16 .cse3 .cse18 .cse22 .cse5 .cse23 .cse6 .cse8) (and .cse10 .cse11 .cse16 .cse18 .cse13 .cse5 .cse17 .cse23 .cse6 .cse8) (and .cse10 .cse24 .cse16 .cse18 .cse13 .cse5 .cse17 .cse6 .cse7 .cse8) (and .cse0 .cse25 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse2 .cse18 .cse13 .cse14 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse27 .cse5 .cse6 .cse8 .cse9) (and .cse28 .cse10 .cse0 .cse11 .cse3 .cse5 .cse6 .cse12 .cse21 .cse9) (and .cse0 .cse28 .cse11 .cse2 .cse3 .cse27 .cse5 .cse6 .cse21 .cse9) (and .cse10 .cse0 .cse11 .cse16 .cse3 .cse5 .cse29 .cse6 .cse12 .cse21) (and .cse11 .cse25 .cse2 .cse18 .cse13 .cse19 .cse5 .cse6 .cse21 .cse9) (and .cse28 .cse2 .cse3 .cse18 .cse5 .cse26 .cse6 .cse7 .cse21 .cse9) (and .cse0 .cse11 .cse2 .cse16 .cse3 .cse27 .cse22 .cse5 .cse6 .cse8) (and .cse0 .cse11 .cse2 .cse16 .cse27 .cse13 .cse5 .cse17 .cse6 .cse8) (and .cse10 .cse0 .cse25 .cse11 .cse13 .cse5 .cse6 .cse12 .cse21 .cse9) (and .cse2 .cse16 .cse3 .cse18 .cse5 .cse29 .cse26 .cse6 .cse7 .cse21) (and .cse10 .cse0 .cse16 .cse13 .cse15 .cse20 .cse5 .cse6 .cse7 .cse21) (and .cse10 .cse0 .cse11 .cse13 .cse14 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse28 .cse11 .cse2 .cse3 .cse18 .cse19 .cse5 .cse6 .cse21 .cse9) (and .cse10 .cse0 .cse11 .cse16 .cse3 .cse22 .cse5 .cse6 .cse12 .cse8) (and .cse10 .cse11 .cse18 .cse13 .cse14 .cse5 .cse23 .cse6 .cse8 .cse9) (and .cse10 .cse0 .cse16 .cse3 .cse15 .cse5 .cse29 .cse6 .cse7 .cse21) (and .cse10 .cse0 .cse16 .cse13 .cse15 .cse5 .cse17 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse16 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse28 .cse10 .cse24 .cse3 .cse18 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse0 .cse11 .cse2 .cse27 .cse13 .cse14 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse16 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse21) (and .cse0 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse0 .cse2 .cse13 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse25 .cse11 .cse18 .cse13 .cse5 .cse23 .cse6 .cse21 .cse9) (and .cse0 .cse11 .cse25 .cse2 .cse27 .cse13 .cse5 .cse6 .cse21 .cse9) (and .cse10 .cse0 .cse11 .cse16 .cse13 .cse20 .cse5 .cse6 .cse12 .cse21) (and .cse10 .cse0 .cse25 .cse13 .cse15 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse25 .cse2 .cse18 .cse13 .cse5 .cse26 .cse6 .cse7 .cse21 .cse9) (and .cse10 .cse0 .cse1 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse16 .cse18 .cse13 .cse20 .cse5 .cse23 .cse6 .cse21) (and .cse10 .cse24 .cse18 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse24 .cse16 .cse3 .cse18 .cse22 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse11 .cse2 .cse3 .cse18 .cse19 .cse5 .cse6 .cse8 .cse9) (and .cse10 .cse24 .cse25 .cse18 .cse13 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse11 .cse2 .cse16 .cse3 .cse18 .cse19 .cse5 .cse29 .cse6 .cse21) (and .cse10 .cse0 .cse16 .cse3 .cse22 .cse15 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse18 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse24 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse11 .cse3 .cse18 .cse5 .cse23 .cse6 .cse8 .cse9) (and .cse28 .cse10 .cse11 .cse3 .cse18 .cse5 .cse23 .cse6 .cse21 .cse9) (and .cse10 .cse24 .cse16 .cse3 .cse18 .cse5 .cse29 .cse6 .cse7 .cse21) (and .cse10 .cse0 .cse28 .cse3 .cse15 .cse5 .cse6 .cse7 .cse21 .cse9) (and .cse10 .cse11 .cse16 .cse3 .cse18 .cse5 .cse23 .cse29 .cse6 .cse21) (and .cse2 .cse16 .cse3 .cse18 .cse22 .cse5 .cse26 .cse6 .cse7 .cse8) (and .cse11 .cse2 .cse16 .cse3 .cse18 .cse22 .cse19 .cse5 .cse6 .cse8) (and .cse2 .cse16 .cse18 .cse13 .cse5 .cse17 .cse26 .cse6 .cse7 .cse8) (and .cse10 .cse24 .cse16 .cse18 .cse13 .cse20 .cse5 .cse6 .cse7 .cse21) (and .cse0 .cse2 .cse16 .cse13 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse16 .cse3 .cse27 .cse5 .cse29 .cse6 .cse21) (and .cse0 .cse11 .cse2 .cse16 .cse27 .cse13 .cse20 .cse5 .cse6 .cse21) (and .cse11 .cse2 .cse16 .cse18 .cse13 .cse19 .cse5 .cse17 .cse6 .cse8) (and .cse2 .cse16 .cse18 .cse13 .cse20 .cse5 .cse26 .cse6 .cse7 .cse21))))) [2020-07-17 22:50:41,504 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse9 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse2 (select |#memory_int| |main_~#matriz~0.base|)) (.cse13 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse7 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse14 (* (mod main_~N_LIN~0 4294967296) 4))) (let ((.cse3 (* (mod main_~k~0 4294967296) 4)) (.cse12 (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse14)) (.cse10 (not .cse7)) (.cse5 (not .cse13)) (.cse11 (* (mod main_~k~0 4294967296) 4)) (.cse4 (* (mod main_~j~0 4294967296) .cse14)) (.cse0 (<= (select .cse2 |main_~#matriz~0.offset|) main_~maior~0)) (.cse1 (* (mod main_~j~0 4294967296) .cse9)) (.cse8 (* (mod main_~k~0 4294967296) 4)) (.cse6 (= 1 main_~N_LIN~0))) (or (and (or .cse0 (= (+ .cse1 (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)) |main_~#matriz~0.offset|)) (<= |main_#t~mem4| (select .cse2 (+ .cse3 |main_~#matriz~0.offset| .cse4 (- 17179869184)))) .cse5 .cse6 .cse7) (and (or .cse0 (= (+ .cse8 (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse9) |main_~#matriz~0.offset|) |main_~#matriz~0.offset|)) .cse10 .cse6 (<= |main_#t~mem4| (select .cse2 (+ .cse11 |main_~#matriz~0.offset| .cse12))) .cse13) (and .cse0 (<= |main_#t~mem4| (select .cse2 (+ .cse3 |main_~#matriz~0.offset| .cse12 (- 17179869184)))) .cse10 .cse5 .cse6) (and (<= |main_#t~mem4| (select .cse2 (+ .cse11 |main_~#matriz~0.offset| .cse4))) (or .cse0 (= (+ .cse1 .cse8 |main_~#matriz~0.offset|) |main_~#matriz~0.offset|)) .cse6 .cse7 .cse13)))) [2020-07-17 22:50:41,678 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-07-17 22:50:43,753 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-17 22:50:43,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:43,791 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:43,807 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:43,821 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 2, 2, 2, 2, 1] term [2020-07-17 22:50:43,822 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-17 22:50:43,832 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,835 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,836 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:43,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:43,841 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:43,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:43,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,883 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,885 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,890 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,913 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,914 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,917 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:43,922 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:44,685 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 44 [2020-07-17 22:50:44,966 INFO L350 Elim1Store]: treesize reduction 49, result has 32.9 percent of original size [2020-07-17 22:50:44,967 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 33 [2020-07-17 22:50:44,981 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:44,988 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:44,992 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:50:45,031 INFO L624 ElimStorePlain]: treesize reduction 31, result has 31.1 percent of original size [2020-07-17 22:50:45,037 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:50:45,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:3 [2020-07-17 22:50:45,045 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:45,045 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_34, v_prenex_33, |main_~#matriz~0.offset|, |#memory_int|, |main_~#matriz~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#matriz~0.base|))) (let ((.cse1 (select .cse0 |main_~#matriz~0.offset|))) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select .cse0 (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= .cse1 (select .cse0 (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= |main_#t~mem6| .cse1) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))) [2020-07-17 22:50:45,045 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-17 22:50:45,086 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:45,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2020-07-17 22:50:45,366 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-17 22:50:45,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2020-07-17 22:50:45,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #52#return; {1186#true} is VALID [2020-07-17 22:50:45,367 INFO L263 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2020-07-17 22:50:45,368 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) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {1206#(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; {1210#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#(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); {1210#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(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; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-17 22:50:45,388 INFO L280 TraceCheckUtils]: 13: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~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); {1233#(or (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) (* 17179869184 (mod main_~N_LIN~0 4294967296)))) (= 1 main_~N_LIN~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4))))) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647)) (and (<= |main_#t~mem4| (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))))) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) 0)) (<= (mod main_~k~0 4294967296) 2147483647)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) (- 17179869184)))) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (< 2147483647 (mod main_~j~0 4294967296))) (and (<= |main_#t~mem4| (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)) (- 17179869184)))) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647) (or (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) 17179869184) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0))))} is VALID [2020-07-17 22:50:45,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#(or (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) (* 17179869184 (mod main_~N_LIN~0 4294967296)))) (= 1 main_~N_LIN~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4))))) (< 2147483647 (mod main_~j~0 4294967296)) (<= (mod main_~k~0 4294967296) 2147483647)) (and (<= |main_#t~mem4| (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))))) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) 0)) (<= (mod main_~k~0 4294967296) 2147483647)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) (- 17179869184)))) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (< 2147483647 (mod main_~j~0 4294967296))) (and (<= |main_#t~mem4| (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)) (- 17179869184)))) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647) (or (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) 17179869184) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~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; {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} is VALID [2020-07-17 22:50:45,421 INFO L280 TraceCheckUtils]: 15: Hoare triple {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} is VALID [2020-07-17 22:50:45,426 INFO L280 TraceCheckUtils]: 16: Hoare triple {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} is VALID [2020-07-17 22:50:45,427 INFO L280 TraceCheckUtils]: 17: Hoare triple {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} is VALID [2020-07-17 22:50:45,428 INFO L280 TraceCheckUtils]: 18: Hoare triple {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} is VALID [2020-07-17 22:50:45,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {1237#(exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (<= (mod v_prenex_33 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184))) main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod v_prenex_34 4294967296) 4) (* (mod v_prenex_33 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (< 2147483647 (mod v_prenex_34 4294967296)) (<= (mod v_prenex_33 4294967296) 2147483647) (< 2147483647 (mod v_prenex_34 4294967296))))} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1253#(<= |main_#t~mem6| main_~maior~0)} is VALID [2020-07-17 22:50:45,431 INFO L263 TraceCheckUtils]: 20: Hoare triple {1253#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:45,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:45,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1187#false} is VALID [2020-07-17 22:50:45,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2020-07-17 22:50:45,436 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-17 22:50:45,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117096290] [2020-07-17 22:50:45,436 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:45,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812379861] [2020-07-17 22:50:45,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:45,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:50:45,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103808435] [2020-07-17 22:50:45,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:50:45,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:45,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:50:45,539 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-17 22:50:45,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:50:45,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:50:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:45,540 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2020-07-17 22:50:46,004 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 30 [2020-07-17 22:50:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,042 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-17 22:50:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:50:47,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:50:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2020-07-17 22:50:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2020-07-17 22:50:47,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2020-07-17 22:50:47,175 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-17 22:50:47,176 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:50:47,177 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:50:47,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:50:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-17 22:50:47,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:47,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-17 22:50:47,225 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-17 22:50:47,225 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-17 22:50:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,227 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-17 22:50:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:50:47,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:47,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:47,228 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-17 22:50:47,228 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-17 22:50:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,233 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-17 22:50:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:50:47,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:47,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:47,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:47,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:50:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-17 22:50:47,239 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2020-07-17 22:50:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:47,240 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-17 22:50:47,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:50:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-17 22:50:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:50:47,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:47,241 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-17 22:50:47,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:47,456 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -153538099, now seen corresponding path program 1 times [2020-07-17 22:50:47,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:47,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484025331] [2020-07-17 22:50:47,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:47,466 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:47,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802860987] [2020-07-17 22:50:47,467 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-17 22:50:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:47,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:47,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:47,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2020-07-17 22:50:47,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-17 22:50:47,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-17 22:50:47,573 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #52#return; {1457#true} is VALID [2020-07-17 22:50:47,574 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret7 := main(); {1457#true} is VALID [2020-07-17 22:50:47,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#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; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,576 INFO L280 TraceCheckUtils]: 6: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {1477#(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); {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {1477#(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; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-17 22:50:47,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} is VALID [2020-07-17 22:50:47,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1458#false} is VALID [2020-07-17 22:50:47,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#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); {1458#false} is VALID [2020-07-17 22:50:47,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {1458#false} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {1458#false} is VALID [2020-07-17 22:50:47,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {1458#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1458#false} is VALID [2020-07-17 22:50:47,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {1458#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1458#false} is VALID [2020-07-17 22:50:47,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {1458#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1458#false} is VALID [2020-07-17 22:50:47,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {1458#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1458#false} is VALID [2020-07-17 22:50:47,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {1458#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1458#false} is VALID [2020-07-17 22:50:47,586 INFO L263 TraceCheckUtils]: 20: Hoare triple {1458#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1458#false} is VALID [2020-07-17 22:50:47,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {1458#false} ~cond := #in~cond; {1458#false} is VALID [2020-07-17 22:50:47,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {1458#false} assume 0 == ~cond; {1458#false} is VALID [2020-07-17 22:50:47,587 INFO L280 TraceCheckUtils]: 23: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-17 22:50:47,589 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-17 22:50:47,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484025331] [2020-07-17 22:50:47,589 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:47,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802860987] [2020-07-17 22:50:47,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:47,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-17 22:50:47,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593683409] [2020-07-17 22:50:47,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:50:47,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:47,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:47,657 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-17 22:50:47,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:47,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:47,658 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2020-07-17 22:50:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,781 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-17 22:50:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:47,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:50:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-17 22:50:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-17 22:50:47,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2020-07-17 22:50:47,856 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-17 22:50:47,857 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:50:47,857 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:50:47,857 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-17 22:50:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:50:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:50:47,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:47,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:47,858 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:47,858 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,859 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:47,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:47,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:47,861 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:47,862 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:47,862 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:47,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:47,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:47,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:47,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:50:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:50:47,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-17 22:50:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:47,863 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:50:47,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:47,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:48,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-17 22:50:48,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:50:48,329 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:50:48,329 INFO L271 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:50:48,329 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:48,329 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:48,329 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:50:48,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:50:48,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:50:48,330 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2020-07-17 22:50:48,330 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2020-07-17 22:50:48,330 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 (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 (= 1 main_~k~0) (= 1 main_~j~0) .cse1) (and .cse0 (= 0 main_~j~0) .cse1))) [2020-07-17 22:50:48,330 INFO L268 CegarLoopResult]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2020-07-17 22:50:48,330 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2020-07-17 22:50:48,331 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2020-07-17 22:50:48,331 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-17 22:50:48,331 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-17 22:50:48,331 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-17 22:50:48,332 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2020-07-17 22:50:48,332 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 (= 0 main_~k~0) .cse0 .cse1 .cse2) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 .cse1 (= 1 main_~k~0) .cse2))) [2020-07-17 22:50:48,332 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-17 22:50:48,333 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:48,333 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:50:48,333 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:50:48,333 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-17 22:50:48,333 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:48,339 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:48,341 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:48,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:48,341 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:48,341 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-17 22:50:48,341 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:50:48,344 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:48,345 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-17 22:50:48,346 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:50:48,346 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:48,346 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:48,346 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-17 22:50:48,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:48 BoogieIcfgContainer [2020-07-17 22:50:48,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:48,363 INFO L168 Benchmark]: Toolchain (without parser) took 32583.59 ms. Allocated memory was 138.4 MB in the beginning and 361.2 MB in the end (delta: 222.8 MB). Free memory was 103.1 MB in the beginning and 161.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 164.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,363 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.20 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 92.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,364 INFO L168 Benchmark]: Boogie Preprocessor took 122.64 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.2 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,365 INFO L168 Benchmark]: RCFGBuilder took 469.58 ms. Allocated memory is still 202.9 MB. Free memory was 181.0 MB in the beginning and 158.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,366 INFO L168 Benchmark]: TraceAbstraction took 31733.03 ms. Allocated memory was 202.9 MB in the beginning and 361.2 MB in the end (delta: 158.3 MB). Free memory was 157.5 MB in the beginning and 161.1 MB in the end (delta: -3.5 MB). Peak memory consumption was 154.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:48,368 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.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.20 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 92.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.64 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.2 MB in the beginning and 181.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.58 ms. Allocated memory is still 202.9 MB. Free memory was 181.0 MB in the beginning and 158.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31733.03 ms. Allocated memory was 202.9 MB in the beginning and 361.2 MB in the end (delta: 158.3 MB). Free memory was 157.5 MB in the beginning and 161.1 MB in the end (delta: -3.5 MB). Peak memory consumption was 154.8 MB. Max. memory is 7.1 GB. * 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-17 22:50:48,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((0 == k && 1 == N_COL) && 0 == j) && 1 == N_LIN) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == N_COL) && 0 == j) && 1 == k) && 1 == N_LIN) - InvariantResult [Line: 19]: Loop Invariant [2020-07-17 22:50:48,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 22:50:48,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == N_COL) && 1 == k) && 1 == j) && 1 == N_LIN) || ((1 == N_COL && 0 == j) && 1 == N_LIN) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 31.3s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 63 SDslu, 263 SDs, 0 SdLazy, 321 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, 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, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 87 HoareAnnotationTreeSize, 15 FomulaSimplifications, 257 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 144 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 5 QuantifiedInterpolants, 21071 SizeOfPredicates, 40 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 83 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...