java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:25,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:25,439 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:25,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:25,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:25,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:25,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:25,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:25,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:25,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:25,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:25,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:25,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:25,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:25,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:25,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:25,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:25,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:25,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:25,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:25,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:25,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:25,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:25,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:25,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:25,506 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:25,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:25,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:25,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:25,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:25,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:25,512 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:25,512 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:25,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:25,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:25,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:25,516 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:34:25,540 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:25,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:25,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:25,542 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:25,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:25,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:25,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:25,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:25,543 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:25,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:25,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:25,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:25,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:25,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:25,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:25,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:25,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:25,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:25,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:25,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:25,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:25,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:25,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:25,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:25,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:25,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:25,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:25,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:25,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:25,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:25,552 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:25,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:25,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:25,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:25,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:25,629 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:25,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i [2018-11-23 12:34:25,700 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2417d64cb/247e6f48ba9a4298a7cdddd089729106/FLAG5c28115c1 [2018-11-23 12:34:26,130 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:26,131 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i [2018-11-23 12:34:26,137 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2417d64cb/247e6f48ba9a4298a7cdddd089729106/FLAG5c28115c1 [2018-11-23 12:34:26,505 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2417d64cb/247e6f48ba9a4298a7cdddd089729106 [2018-11-23 12:34:26,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:26,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:26,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:26,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:26,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:26,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3ebbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26, skipping insertion in model container [2018-11-23 12:34:26,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:26,567 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:26,839 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:26,844 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:26,878 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:26,906 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:26,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26 WrapperNode [2018-11-23 12:34:26,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:26,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:26,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:26,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:26,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:26,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:26,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:26,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:26,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (1/1) ... [2018-11-23 12:34:26,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:26,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:26,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:26,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:26,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (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 [2018-11-23 12:34:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:27,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:27,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:27,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:27,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:27,822 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:27,822 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:34:27,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:27 BoogieIcfgContainer [2018-11-23 12:34:27,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:27,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:27,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:27,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:27,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:26" (1/3) ... [2018-11-23 12:34:27,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ef0525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:27, skipping insertion in model container [2018-11-23 12:34:27,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:26" (2/3) ... [2018-11-23 12:34:27,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ef0525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:27, skipping insertion in model container [2018-11-23 12:34:27,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:27" (3/3) ... [2018-11-23 12:34:27,834 INFO L112 eAbstractionObserver]: Analyzing ICFG max-2-u_true-unreach-call.i [2018-11-23 12:34:27,846 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:27,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:27,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:27,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:27,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:27,908 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:27,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:27,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:27,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:27,908 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:27,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:27,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:34:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:34:27,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:27,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:27,938 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:27,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 659715076, now seen corresponding path program 1 times [2018-11-23 12:34:27,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:27,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:28,036 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:28,036 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:28,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:28,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:28,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:34:28,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:34:28,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:34:28,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #106#return; {35#true} is VALID [2018-11-23 12:34:28,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret5 := main(); {35#true} is VALID [2018-11-23 12:34:28,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {55#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:28,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {36#false} is VALID [2018-11-23 12:34:28,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {36#false} is VALID [2018-11-23 12:34:28,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(~i~0 < ~n~0); {36#false} is VALID [2018-11-23 12:34:28,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0;~j~0 := 0; {36#false} is VALID [2018-11-23 12:34:28,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {36#false} is VALID [2018-11-23 12:34:28,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {36#false} is VALID [2018-11-23 12:34:28,483 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {36#false} is VALID [2018-11-23 12:34:28,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:34:28,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:34:28,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:34:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:28,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:28,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:28,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:28,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:28,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:28,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:28,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:28,591 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 12:34:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,219 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2018-11-23 12:34:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:29,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:34:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:34:29,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-23 12:34:29,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:29,805 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:34:29,805 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:34:29,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:34:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 12:34:29,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:29,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:29,864 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:29,864 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,873 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:29,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:29,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:29,874 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 12:34:29,875 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 12:34:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,881 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:29,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:29,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:29,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:29,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:34:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 12:34:29,888 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-11-23 12:34:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:29,888 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 12:34:29,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:34:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:34:29,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:29,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:29,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:29,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -528988062, now seen corresponding path program 1 times [2018-11-23 12:34:29,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:29,903 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:29,905 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:29,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:29,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:30,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2018-11-23 12:34:30,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {269#true} is VALID [2018-11-23 12:34:30,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2018-11-23 12:34:30,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #106#return; {269#true} is VALID [2018-11-23 12:34:30,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret5 := main(); {269#true} is VALID [2018-11-23 12:34:30,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {269#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {289#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:30,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {289#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {293#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:30,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {270#false} is VALID [2018-11-23 12:34:30,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {270#false} ~i~0 := 1 + ~i~0; {270#false} is VALID [2018-11-23 12:34:30,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {270#false} assume !(~i~0 < ~m~0); {270#false} is VALID [2018-11-23 12:34:30,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {270#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {270#false} is VALID [2018-11-23 12:34:30,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {270#false} assume !(~i~0 < ~n~0); {270#false} is VALID [2018-11-23 12:34:30,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {270#false} ~i~0 := 0;~j~0 := 0; {270#false} is VALID [2018-11-23 12:34:30,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {270#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {270#false} is VALID [2018-11-23 12:34:30,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {270#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {270#false} is VALID [2018-11-23 12:34:30,126 INFO L256 TraceCheckUtils]: 15: Hoare triple {270#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {270#false} is VALID [2018-11-23 12:34:30,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2018-11-23 12:34:30,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2018-11-23 12:34:30,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {270#false} assume !false; {270#false} is VALID [2018-11-23 12:34:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:30,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:30,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:30,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:30,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:30,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:30,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:30,202 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2018-11-23 12:34:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:30,630 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2018-11-23 12:34:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:30,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:34:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:34:30,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 12:34:30,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:30,837 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:34:30,837 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:34:30,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:34:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-23 12:34:30,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:30,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:30,879 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:30,879 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:30,884 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 12:34:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 12:34:30,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:30,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:30,886 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states. [2018-11-23 12:34:30,886 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states. [2018-11-23 12:34:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:30,890 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 12:34:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 12:34:30,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:30,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:30,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:30,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:34:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 12:34:30,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 19 [2018-11-23 12:34:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:30,895 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 12:34:30,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:34:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:34:30,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:30,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:30,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:30,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash -306641421, now seen corresponding path program 1 times [2018-11-23 12:34:30,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:30,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:30,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:30,906 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:30,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:30,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:31,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-23 12:34:31,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {538#true} is VALID [2018-11-23 12:34:31,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-23 12:34:31,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #106#return; {538#true} is VALID [2018-11-23 12:34:31,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2018-11-23 12:34:31,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {558#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:31,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {562#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:31,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {566#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:31,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {566#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {539#false} is VALID [2018-11-23 12:34:31,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {539#false} ~i~0 := 1 + ~i~0; {539#false} is VALID [2018-11-23 12:34:31,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#false} assume !(~i~0 < ~m~0); {539#false} is VALID [2018-11-23 12:34:31,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {539#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {539#false} is VALID [2018-11-23 12:34:31,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {539#false} assume !(~i~0 < ~n~0); {539#false} is VALID [2018-11-23 12:34:31,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#false} ~i~0 := 0;~j~0 := 0; {539#false} is VALID [2018-11-23 12:34:31,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {539#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {539#false} is VALID [2018-11-23 12:34:31,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {539#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {539#false} is VALID [2018-11-23 12:34:31,133 INFO L256 TraceCheckUtils]: 16: Hoare triple {539#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {539#false} is VALID [2018-11-23 12:34:31,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-23 12:34:31,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2018-11-23 12:34:31,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-23 12:34:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:31,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:31,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:31,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:34:31,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:31,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:31,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:31,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:31,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:31,196 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2018-11-23 12:34:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,694 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2018-11-23 12:34:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:31,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:34:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-23 12:34:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-23 12:34:31,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2018-11-23 12:34:31,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:31,830 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:34:31,831 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:34:31,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:34:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-23 12:34:31,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:31,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:31,898 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:31,898 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,902 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:34:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 12:34:31,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,904 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-23 12:34:31,904 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-23 12:34:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,908 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:34:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 12:34:31,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:31,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:34:31,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 20 [2018-11-23 12:34:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:31,913 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:34:31,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:34:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:34:31,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:31,915 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:31,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:31,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:31,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2003830142, now seen corresponding path program 2 times [2018-11-23 12:34:31,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,924 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:31,924 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:31,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:31,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:34:31,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:31,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:32,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2018-11-23 12:34:32,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {853#true} is VALID [2018-11-23 12:34:32,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2018-11-23 12:34:32,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #106#return; {853#true} is VALID [2018-11-23 12:34:32,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret5 := main(); {853#true} is VALID [2018-11-23 12:34:32,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {853#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {873#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {873#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {873#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {873#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {873#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:32,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {873#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {895#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:32,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {895#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {854#false} is VALID [2018-11-23 12:34:32,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#false} ~i~0 := 0;~j~0 := 0; {854#false} is VALID [2018-11-23 12:34:32,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {854#false} is VALID [2018-11-23 12:34:32,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {854#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {854#false} is VALID [2018-11-23 12:34:32,069 INFO L256 TraceCheckUtils]: 17: Hoare triple {854#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {854#false} is VALID [2018-11-23 12:34:32,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#false} ~cond := #in~cond; {854#false} is VALID [2018-11-23 12:34:32,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#false} assume 0 == ~cond; {854#false} is VALID [2018-11-23 12:34:32,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {854#false} assume !false; {854#false} is VALID [2018-11-23 12:34:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:34:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:32,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:32,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:32,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:32,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:32,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:32,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:32,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:32,115 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 12:34:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:32,606 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 12:34:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:32,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:32,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2018-11-23 12:34:32,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:32,700 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:34:32,700 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:34:32,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:34:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2018-11-23 12:34:32,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:32,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:32,811 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:32,811 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:32,816 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:32,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:32,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:32,817 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 60 states. [2018-11-23 12:34:32,817 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 60 states. [2018-11-23 12:34:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:32,822 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:32,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:32,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:32,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:32,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:34:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:34:32,827 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 21 [2018-11-23 12:34:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:32,827 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:34:32,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:34:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:34:32,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:32,829 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:32,829 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:32,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash -851590433, now seen corresponding path program 1 times [2018-11-23 12:34:32,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:32,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:32,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:32,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:32,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:32,837 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:32,838 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:32,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:32,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:32,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:33,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {1215#true} call ULTIMATE.init(); {1215#true} is VALID [2018-11-23 12:34:33,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {1215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1215#true} is VALID [2018-11-23 12:34:33,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {1215#true} assume true; {1215#true} is VALID [2018-11-23 12:34:33,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1215#true} {1215#true} #106#return; {1215#true} is VALID [2018-11-23 12:34:33,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {1215#true} call #t~ret5 := main(); {1215#true} is VALID [2018-11-23 12:34:33,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {1215#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {1235#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:33,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {1235#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1239#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:33,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {1239#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1243#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:33,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1247#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:33,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {1247#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:33,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {1216#false} ~i~0 := 1 + ~i~0; {1216#false} is VALID [2018-11-23 12:34:33,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {1216#false} assume !(~i~0 < ~m~0); {1216#false} is VALID [2018-11-23 12:34:33,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {1216#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {1216#false} is VALID [2018-11-23 12:34:33,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {1216#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:33,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:33,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {1216#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {1216#false} is VALID [2018-11-23 12:34:33,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {1216#false} ~j~0 := 1 + ~j~0; {1216#false} is VALID [2018-11-23 12:34:33,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:33,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {1216#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {1216#false} is VALID [2018-11-23 12:34:33,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {1216#false} ~j~0 := 1 + ~j~0; {1216#false} is VALID [2018-11-23 12:34:33,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {1216#false} assume !(~j~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:33,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {1216#false} ~i~0 := 1 + ~i~0; {1216#false} is VALID [2018-11-23 12:34:33,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#false} assume !(~i~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:33,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {1216#false} ~i~0 := 0;~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:33,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {1216#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:33,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:33,066 INFO L256 TraceCheckUtils]: 26: Hoare triple {1216#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1216#false} is VALID [2018-11-23 12:34:33,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {1216#false} ~cond := #in~cond; {1216#false} is VALID [2018-11-23 12:34:33,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {1216#false} assume 0 == ~cond; {1216#false} is VALID [2018-11-23 12:34:33,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {1216#false} assume !false; {1216#false} is VALID [2018-11-23 12:34:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:34:33,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:33,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:33,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:34:33,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:33,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:33,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:33,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:33,136 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-11-23 12:34:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,458 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:34:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:33,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:34:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:34:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:34:33,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:34:33,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:33,709 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:34:33,709 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:34:33,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:34:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-23 12:34:33,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:33,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:33,790 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:33,791 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,794 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:34:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:34:33,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,795 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 51 states. [2018-11-23 12:34:33,796 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 51 states. [2018-11-23 12:34:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,799 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:34:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:34:33,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:33,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:34:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 12:34:33,805 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 30 [2018-11-23 12:34:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:33,806 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 12:34:33,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 12:34:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:34:33,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:33,807 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:33,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:33,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash -241858451, now seen corresponding path program 2 times [2018-11-23 12:34:33,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:33,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:33,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:33,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,827 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:33,827 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:33,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:33,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:33,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:33,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:34,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {1609#true} call ULTIMATE.init(); {1609#true} is VALID [2018-11-23 12:34:34,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {1609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1609#true} is VALID [2018-11-23 12:34:34,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {1609#true} assume true; {1609#true} is VALID [2018-11-23 12:34:34,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1609#true} {1609#true} #106#return; {1609#true} is VALID [2018-11-23 12:34:34,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {1609#true} call #t~ret5 := main(); {1609#true} is VALID [2018-11-23 12:34:34,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {1609#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {1629#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:34,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {1629#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1633#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:34,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {1633#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1637#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:34,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1637#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1641#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:34,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1641#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:34,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:34,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {1610#false} ~i~0 := 1 + ~i~0; {1610#false} is VALID [2018-11-23 12:34:34,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {1610#false} assume !(~i~0 < ~m~0); {1610#false} is VALID [2018-11-23 12:34:34,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {1610#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {1610#false} is VALID [2018-11-23 12:34:34,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {1610#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:34,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:34,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {1610#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:34,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:34,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:34,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {1610#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:34,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:34,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:34,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {1610#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:34,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:34,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {1610#false} assume !(~j~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:34,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {1610#false} ~i~0 := 1 + ~i~0; {1610#false} is VALID [2018-11-23 12:34:34,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {1610#false} assume !(~i~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:34,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {1610#false} ~i~0 := 0;~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:34,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {1610#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:34,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:34,494 INFO L256 TraceCheckUtils]: 30: Hoare triple {1610#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1610#false} is VALID [2018-11-23 12:34:34,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {1610#false} ~cond := #in~cond; {1610#false} is VALID [2018-11-23 12:34:34,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {1610#false} assume 0 == ~cond; {1610#false} is VALID [2018-11-23 12:34:34,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {1610#false} assume !false; {1610#false} is VALID [2018-11-23 12:34:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:34:34,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:34,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:34,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 12:34:34,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:34,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:34,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:34,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:34,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:34,563 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 7 states. [2018-11-23 12:34:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,088 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2018-11-23 12:34:35,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:35,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 12:34:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-11-23 12:34:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-11-23 12:34:35,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2018-11-23 12:34:35,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:35,239 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:34:35,239 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:34:35,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:34:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-11-23 12:34:35,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:35,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:35,354 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:35,354 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,357 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 12:34:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 12:34:35,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,358 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 58 states. [2018-11-23 12:34:35,358 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 58 states. [2018-11-23 12:34:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,380 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 12:34:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 12:34:35,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:35,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:34:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 12:34:35,384 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 34 [2018-11-23 12:34:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:35,385 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 12:34:35,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 12:34:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:34:35,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:35,386 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:35,386 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:35,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash -123740257, now seen corresponding path program 3 times [2018-11-23 12:34:35,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:35,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,412 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:35,412 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:35,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:35,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:35,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:35,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:35,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:35,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2018-11-23 12:34:35,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {2063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2063#true} is VALID [2018-11-23 12:34:35,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2018-11-23 12:34:35,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #106#return; {2063#true} is VALID [2018-11-23 12:34:35,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret5 := main(); {2063#true} is VALID [2018-11-23 12:34:35,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2105#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:35,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {2105#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2064#false} is VALID [2018-11-23 12:34:35,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {2064#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {2064#false} is VALID [2018-11-23 12:34:35,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {2064#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:35,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:35,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {2064#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:35,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:35,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:35,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {2064#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:35,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:35,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:35,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {2064#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:35,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:35,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:35,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {2064#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:35,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:35,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {2064#false} assume !(~j~0 < ~n~0); {2064#false} is VALID [2018-11-23 12:34:35,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {2064#false} ~i~0 := 1 + ~i~0; {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {2064#false} assume !(~i~0 < ~n~0); {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {2064#false} ~i~0 := 0;~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {2064#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L256 TraceCheckUtils]: 34: Hoare triple {2064#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2064#false} is VALID [2018-11-23 12:34:35,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {2064#false} ~cond := #in~cond; {2064#false} is VALID [2018-11-23 12:34:35,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {2064#false} assume 0 == ~cond; {2064#false} is VALID [2018-11-23 12:34:35,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2018-11-23 12:34:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 12:34:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:35,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:35,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:34:35,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:35,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:35,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:35,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:35,670 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 4 states. [2018-11-23 12:34:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,377 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2018-11-23 12:34:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:36,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:34:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:34:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:34:36,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2018-11-23 12:34:36,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:36,466 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:34:36,466 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:34:36,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:34:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-11-23 12:34:36,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:36,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:36,545 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:36,545 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,549 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 12:34:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 12:34:36,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:36,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:36,550 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 66 states. [2018-11-23 12:34:36,550 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 66 states. [2018-11-23 12:34:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,553 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 12:34:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 12:34:36,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:36,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:36,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:34:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-23 12:34:36,556 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2018-11-23 12:34:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:36,557 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-23 12:34:36,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 12:34:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:34:36,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:36,558 INFO L402 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:36,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:36,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1198106045, now seen corresponding path program 4 times [2018-11-23 12:34:36,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:36,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:36,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:36,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:36,565 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:36,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:36,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-23 12:34:36,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:36,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:36,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:36,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:37,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {2570#true} call ULTIMATE.init(); {2570#true} is VALID [2018-11-23 12:34:37,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {2570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2570#true} is VALID [2018-11-23 12:34:37,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {2570#true} assume true; {2570#true} is VALID [2018-11-23 12:34:37,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2570#true} {2570#true} #106#return; {2570#true} is VALID [2018-11-23 12:34:37,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {2570#true} call #t~ret5 := main(); {2570#true} is VALID [2018-11-23 12:34:37,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {2570#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:37,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {2570#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:37,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {2570#true} assume !(~j~0 < ~n~0); {2570#true} is VALID [2018-11-23 12:34:37,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#true} ~i~0 := 1 + ~i~0; {2570#true} is VALID [2018-11-23 12:34:37,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:37,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {2570#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:37,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {2570#true} assume !(~j~0 < ~n~0); {2570#true} is VALID [2018-11-23 12:34:37,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {2570#true} ~i~0 := 1 + ~i~0; {2570#true} is VALID [2018-11-23 12:34:37,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {2570#true} assume !(~i~0 < ~m~0); {2570#true} is VALID [2018-11-23 12:34:37,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {2570#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {2638#(<= main_~i~0 0)} is VALID [2018-11-23 12:34:37,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {2638#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,361 INFO L273 TraceCheckUtils]: 25: Hoare triple {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2672#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {2672#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:37,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {2689#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-23 12:34:37,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {2689#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume !(~i~0 < ~n~0); {2571#false} is VALID [2018-11-23 12:34:37,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {2571#false} ~i~0 := 0;~j~0 := 0; {2571#false} is VALID [2018-11-23 12:34:37,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {2571#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2571#false} is VALID [2018-11-23 12:34:37,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {2571#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2571#false} is VALID [2018-11-23 12:34:37,376 INFO L256 TraceCheckUtils]: 41: Hoare triple {2571#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2571#false} is VALID [2018-11-23 12:34:37,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {2571#false} ~cond := #in~cond; {2571#false} is VALID [2018-11-23 12:34:37,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {2571#false} assume 0 == ~cond; {2571#false} is VALID [2018-11-23 12:34:37,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {2571#false} assume !false; {2571#false} is VALID [2018-11-23 12:34:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 12:34:37,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:37,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:37,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:37,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:37,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:37,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:37,449 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 9 states. [2018-11-23 12:34:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:38,699 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2018-11-23 12:34:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:34:38,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-23 12:34:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-23 12:34:38,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-23 12:34:38,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:38,919 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:34:38,919 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:34:38,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:34:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:34:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 75. [2018-11-23 12:34:39,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:39,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:39,095 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:39,095 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,101 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-23 12:34:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2018-11-23 12:34:39,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:39,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:39,102 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 125 states. [2018-11-23 12:34:39,103 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 125 states. [2018-11-23 12:34:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,107 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-23 12:34:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2018-11-23 12:34:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:39,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:39,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:34:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2018-11-23 12:34:39,111 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2018-11-23 12:34:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:39,111 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-23 12:34:39,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2018-11-23 12:34:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:34:39,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:39,112 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:39,113 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:39,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1312433444, now seen corresponding path program 5 times [2018-11-23 12:34:39,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:39,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:39,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:39,120 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:39,120 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:39,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:34:46,070 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:34:46,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:46,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:46,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2018-11-23 12:34:46,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3317#true} is VALID [2018-11-23 12:34:46,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2018-11-23 12:34:46,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #106#return; {3317#true} is VALID [2018-11-23 12:34:46,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret5 := main(); {3317#true} is VALID [2018-11-23 12:34:46,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {3317#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:46,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:46,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:46,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:46,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:46,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:46,312 INFO L273 TraceCheckUtils]: 27: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:46,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} ~j~0 := 1 + ~j~0; {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:46,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:46,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:46,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} ~j~0 := 1 + ~j~0; {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:46,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:46,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:46,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} ~j~0 := 1 + ~j~0; {3429#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {3429#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {3318#false} ~i~0 := 1 + ~i~0; {3318#false} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {3318#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3318#false} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {3318#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:34:46,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:34:46,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:34:46,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {3318#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:34:46,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:34:46,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:34:46,327 INFO L273 TraceCheckUtils]: 45: Hoare triple {3318#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:34:46,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:34:46,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:34:46,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {3318#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:34:46,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:34:46,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {3318#false} assume !(~j~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:34:46,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {3318#false} ~i~0 := 1 + ~i~0; {3318#false} is VALID [2018-11-23 12:34:46,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {3318#false} assume !(~i~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:34:46,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {3318#false} ~i~0 := 0;~j~0 := 0; {3318#false} is VALID [2018-11-23 12:34:46,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {3318#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3318#false} is VALID [2018-11-23 12:34:46,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:34:46,330 INFO L256 TraceCheckUtils]: 56: Hoare triple {3318#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {3318#false} is VALID [2018-11-23 12:34:46,330 INFO L273 TraceCheckUtils]: 57: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2018-11-23 12:34:46,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2018-11-23 12:34:46,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2018-11-23 12:34:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-23 12:34:46,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:46,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:34:46,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:46,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:46,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:46,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:46,404 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 8 states. [2018-11-23 12:34:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:46,910 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2018-11-23 12:34:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:46,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:34:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:46,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 111 transitions. [2018-11-23 12:34:47,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:47,066 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:34:47,066 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:34:47,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:34:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-11-23 12:34:47,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:47,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 86 states. [2018-11-23 12:34:47,283 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 86 states. [2018-11-23 12:34:47,283 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 86 states. [2018-11-23 12:34:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:47,286 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-23 12:34:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2018-11-23 12:34:47,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:47,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:47,287 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 93 states. [2018-11-23 12:34:47,287 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 93 states. [2018-11-23 12:34:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:47,290 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-23 12:34:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2018-11-23 12:34:47,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:47,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:47,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:47,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:34:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2018-11-23 12:34:47,293 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 60 [2018-11-23 12:34:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2018-11-23 12:34:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2018-11-23 12:34:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:34:47,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:47,295 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:47,295 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1510466474, now seen corresponding path program 6 times [2018-11-23 12:34:47,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:47,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:47,302 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:47,302 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:47,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:47,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:34:47,345 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:34:47,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:47,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:47,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {4059#true} call ULTIMATE.init(); {4059#true} is VALID [2018-11-23 12:34:47,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {4059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4059#true} is VALID [2018-11-23 12:34:47,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {4059#true} assume true; {4059#true} is VALID [2018-11-23 12:34:47,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4059#true} {4059#true} #106#return; {4059#true} is VALID [2018-11-23 12:34:47,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {4059#true} call #t~ret5 := main(); {4059#true} is VALID [2018-11-23 12:34:47,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {4059#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:47,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,593 INFO L273 TraceCheckUtils]: 39: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:47,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);~j~0 := 0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,613 INFO L273 TraceCheckUtils]: 53: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,622 INFO L273 TraceCheckUtils]: 55: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,622 INFO L273 TraceCheckUtils]: 56: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,623 INFO L273 TraceCheckUtils]: 57: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !(~j~0 < ~n~0); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:47,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~i~0 := 1 + ~i~0; {4244#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:34:47,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {4244#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} assume !(~i~0 < ~n~0); {4060#false} is VALID [2018-11-23 12:34:47,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {4060#false} ~i~0 := 0;~j~0 := 0; {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {4060#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {4060#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L256 TraceCheckUtils]: 64: Hoare triple {4060#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {4060#false} ~cond := #in~cond; {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {4060#false} assume 0 == ~cond; {4060#false} is VALID [2018-11-23 12:34:47,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {4060#false} assume !false; {4060#false} is VALID [2018-11-23 12:34:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 12:34:47,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:47,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:47,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:34:47,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:47,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:47,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:47,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:47,684 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 6 states. [2018-11-23 12:34:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:48,840 INFO L93 Difference]: Finished difference Result 216 states and 276 transitions. [2018-11-23 12:34:48,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:48,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:34:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2018-11-23 12:34:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2018-11-23 12:34:48,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 103 transitions. [2018-11-23 12:34:49,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:49,449 INFO L225 Difference]: With dead ends: 216 [2018-11-23 12:34:49,450 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 12:34:49,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 12:34:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 104. [2018-11-23 12:34:49,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:49,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 104 states. [2018-11-23 12:34:49,790 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 104 states. [2018-11-23 12:34:49,791 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 104 states. [2018-11-23 12:34:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:49,797 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2018-11-23 12:34:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 245 transitions. [2018-11-23 12:34:49,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:49,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:49,799 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 191 states. [2018-11-23 12:34:49,799 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 191 states. [2018-11-23 12:34:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:49,805 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2018-11-23 12:34:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 245 transitions. [2018-11-23 12:34:49,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:49,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:49,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:49,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:34:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2018-11-23 12:34:49,809 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 68 [2018-11-23 12:34:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:49,809 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2018-11-23 12:34:49,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-23 12:34:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:34:49,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:49,811 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 10, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:49,811 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:49,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash -155354480, now seen corresponding path program 7 times [2018-11-23 12:34:49,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:49,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:49,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:49,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:49,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:49,818 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:49,818 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:49,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:49,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:50,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {5146#true} call ULTIMATE.init(); {5146#true} is VALID [2018-11-23 12:34:50,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {5146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5146#true} is VALID [2018-11-23 12:34:50,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {5146#true} assume true; {5146#true} is VALID [2018-11-23 12:34:50,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5146#true} {5146#true} #106#return; {5146#true} is VALID [2018-11-23 12:34:50,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {5146#true} call #t~ret5 := main(); {5146#true} is VALID [2018-11-23 12:34:50,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {5146#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {5166#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {5166#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5170#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:50,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {5170#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5174#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:50,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {5174#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5178#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:50,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {5178#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5182#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:50,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {5182#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5186#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:50,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {5186#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5190#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:50,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {5190#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:34:50,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {5147#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:34:50,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {5147#false} assume !(~i~0 < ~m~0); {5147#false} is VALID [2018-11-23 12:34:50,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {5147#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {5147#false} is VALID [2018-11-23 12:34:50,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,470 INFO L273 TraceCheckUtils]: 26: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,471 INFO L273 TraceCheckUtils]: 27: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:34:50,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 49: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 58: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 62: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 64: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 66: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 70: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 71: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {5147#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:34:50,478 INFO L273 TraceCheckUtils]: 75: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {5147#false} assume !(~i~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {5147#false} ~i~0 := 0;~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:34:50,479 INFO L256 TraceCheckUtils]: 82: Hoare triple {5147#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {5147#false} is VALID [2018-11-23 12:34:50,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {5147#false} ~cond := #in~cond; {5147#false} is VALID [2018-11-23 12:34:50,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {5147#false} assume 0 == ~cond; {5147#false} is VALID [2018-11-23 12:34:50,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {5147#false} assume !false; {5147#false} is VALID [2018-11-23 12:34:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-23 12:34:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:50,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:50,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 12:34:50,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:50,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:50,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:50,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:50,535 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 9 states. [2018-11-23 12:34:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,085 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-11-23 12:34:51,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:51,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 12:34:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2018-11-23 12:34:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2018-11-23 12:34:51,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2018-11-23 12:34:51,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:51,544 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:34:51,544 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:34:51,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:34:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-11-23 12:34:51,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:51,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 118 states. [2018-11-23 12:34:51,752 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 118 states. [2018-11-23 12:34:51,752 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 118 states. [2018-11-23 12:34:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,755 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:34:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-23 12:34:51,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,756 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 127 states. [2018-11-23 12:34:51,756 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 127 states. [2018-11-23 12:34:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,760 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:34:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-23 12:34:51,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:51,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 12:34:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-11-23 12:34:51,764 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 86 [2018-11-23 12:34:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:51,764 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-11-23 12:34:51,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-23 12:34:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:34:51,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:51,766 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 12, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:51,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:51,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1646989565, now seen corresponding path program 8 times [2018-11-23 12:34:51,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:51,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:51,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:51,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,774 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:51,774 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:51,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:51,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:51,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:51,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:51,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:52,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {6169#true} call ULTIMATE.init(); {6169#true} is VALID [2018-11-23 12:34:52,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {6169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6169#true} is VALID [2018-11-23 12:34:52,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {6169#true} assume true; {6169#true} is VALID [2018-11-23 12:34:52,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6169#true} {6169#true} #106#return; {6169#true} is VALID [2018-11-23 12:34:52,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {6169#true} call #t~ret5 := main(); {6169#true} is VALID [2018-11-23 12:34:52,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {6169#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {6189#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:52,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {6189#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {6193#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:52,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {6193#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6197#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:52,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {6197#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6201#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:52,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {6201#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6205#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:52,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {6205#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6209#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:52,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {6209#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6213#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:52,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {6213#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6217#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:34:52,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:34:52,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {6170#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:34:52,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {6170#false} assume !(~i~0 < ~m~0); {6170#false} is VALID [2018-11-23 12:34:52,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {6170#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {6170#false} is VALID [2018-11-23 12:34:52,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,275 INFO L273 TraceCheckUtils]: 56: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,276 INFO L273 TraceCheckUtils]: 61: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,276 INFO L273 TraceCheckUtils]: 63: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,276 INFO L273 TraceCheckUtils]: 64: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,277 INFO L273 TraceCheckUtils]: 66: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:34:52,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,277 INFO L273 TraceCheckUtils]: 69: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,277 INFO L273 TraceCheckUtils]: 70: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,278 INFO L273 TraceCheckUtils]: 71: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,278 INFO L273 TraceCheckUtils]: 72: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,278 INFO L273 TraceCheckUtils]: 73: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,278 INFO L273 TraceCheckUtils]: 75: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,279 INFO L273 TraceCheckUtils]: 76: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,279 INFO L273 TraceCheckUtils]: 79: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,279 INFO L273 TraceCheckUtils]: 80: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 81: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 82: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 84: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 85: Hoare triple {6170#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:34:52,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:34:52,281 INFO L273 TraceCheckUtils]: 87: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,281 INFO L273 TraceCheckUtils]: 88: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:34:52,281 INFO L273 TraceCheckUtils]: 89: Hoare triple {6170#false} assume !(~i~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:34:52,281 INFO L273 TraceCheckUtils]: 90: Hoare triple {6170#false} ~i~0 := 0;~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,281 INFO L273 TraceCheckUtils]: 91: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:34:52,282 INFO L273 TraceCheckUtils]: 92: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:34:52,282 INFO L256 TraceCheckUtils]: 93: Hoare triple {6170#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {6170#false} is VALID [2018-11-23 12:34:52,282 INFO L273 TraceCheckUtils]: 94: Hoare triple {6170#false} ~cond := #in~cond; {6170#false} is VALID [2018-11-23 12:34:52,282 INFO L273 TraceCheckUtils]: 95: Hoare triple {6170#false} assume 0 == ~cond; {6170#false} is VALID [2018-11-23 12:34:52,282 INFO L273 TraceCheckUtils]: 96: Hoare triple {6170#false} assume !false; {6170#false} is VALID [2018-11-23 12:34:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2018-11-23 12:34:52,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:52,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:34:52,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-23 12:34:52,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:52,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:34:52,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:52,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:34:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:34:52,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:52,372 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 10 states. [2018-11-23 12:34:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,158 INFO L93 Difference]: Finished difference Result 245 states and 320 transitions. [2018-11-23 12:34:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:34:53,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-23 12:34:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:34:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:34:53,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2018-11-23 12:34:53,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:53,698 INFO L225 Difference]: With dead ends: 245 [2018-11-23 12:34:53,698 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:34:53,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:34:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-23 12:34:53,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:53,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 132 states. [2018-11-23 12:34:53,923 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 132 states. [2018-11-23 12:34:53,923 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 132 states. [2018-11-23 12:34:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,928 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-11-23 12:34:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2018-11-23 12:34:53,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:53,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:53,929 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 141 states. [2018-11-23 12:34:53,929 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 141 states. [2018-11-23 12:34:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,933 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-11-23 12:34:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2018-11-23 12:34:53,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:53,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:53,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:53,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:34:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2018-11-23 12:34:53,937 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 97 [2018-11-23 12:34:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:53,937 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2018-11-23 12:34:53,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:34:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2018-11-23 12:34:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:34:53,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:53,939 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 14, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:53,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:53,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1261139824, now seen corresponding path program 9 times [2018-11-23 12:34:53,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:53,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:53,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:53,947 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:53,947 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:53,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:53,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:34:53,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:54,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:54,197 INFO L478 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 11 [2018-11-23 12:34:54,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:34:54,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:34:54,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:34:54,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:34:54,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:34:54,277 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:34:54,277 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#A~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#A~0.base|) 0))) (and (<= |main_#t~mem2| .cse0) (<= .cse0 main_~max~0))) [2018-11-23 12:34:54,277 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem2| main_~max~0) [2018-11-23 12:34:54,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2018-11-23 12:34:54,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7315#true} is VALID [2018-11-23 12:34:54,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2018-11-23 12:34:54,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #106#return; {7315#true} is VALID [2018-11-23 12:34:54,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret5 := main(); {7315#true} is VALID [2018-11-23 12:34:54,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {7315#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~j~0 < ~n~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 1 + ~i~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~j~0 < ~n~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 1 + ~i~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~i~0 < ~m~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:34:54,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {7402#(and (<= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) main_~max~0) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:34:54,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {7402#(and (<= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) main_~max~0) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {7406#(and (<= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) main_~max~0) (= main_~j~0 0) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:34:54,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {7406#(and (<= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) main_~max~0) (= main_~j~0 0) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7410#(<= |main_#t~mem2| main_~max~0)} is VALID [2018-11-23 12:34:54,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {7410#(<= |main_#t~mem2| main_~max~0)} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,372 INFO L273 TraceCheckUtils]: 36: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,372 INFO L273 TraceCheckUtils]: 37: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,375 INFO L273 TraceCheckUtils]: 48: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,375 INFO L273 TraceCheckUtils]: 49: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:34:54,375 INFO L273 TraceCheckUtils]: 51: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:34:54,375 INFO L273 TraceCheckUtils]: 52: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 53: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 54: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 55: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 56: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 60: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 61: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 62: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 69: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 70: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 74: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:34:54,378 INFO L273 TraceCheckUtils]: 75: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 78: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 80: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 81: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,379 INFO L273 TraceCheckUtils]: 82: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 83: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 84: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 85: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 86: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 87: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,380 INFO L273 TraceCheckUtils]: 88: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 89: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 90: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 91: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 92: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 93: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 94: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,381 INFO L273 TraceCheckUtils]: 96: Hoare triple {7316#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 97: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 98: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 99: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 100: Hoare triple {7316#false} assume !(~i~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 101: Hoare triple {7316#false} ~i~0 := 0;~j~0 := 0; {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 102: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L273 TraceCheckUtils]: 103: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:34:54,382 INFO L256 TraceCheckUtils]: 104: Hoare triple {7316#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {7316#false} is VALID [2018-11-23 12:34:54,383 INFO L273 TraceCheckUtils]: 105: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2018-11-23 12:34:54,383 INFO L273 TraceCheckUtils]: 106: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2018-11-23 12:34:54,383 INFO L273 TraceCheckUtils]: 107: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2018-11-23 12:34:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-11-23 12:34:54,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:54,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:34:54,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-23 12:34:54,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:54,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:54,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:54,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:54,434 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 6 states. [2018-11-23 12:34:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:55,159 INFO L93 Difference]: Finished difference Result 251 states and 323 transitions. [2018-11-23 12:34:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:55,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-23 12:34:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 12:34:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 12:34:55,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 12:34:55,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:55,238 INFO L225 Difference]: With dead ends: 251 [2018-11-23 12:34:55,239 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:34:55,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:34:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2018-11-23 12:34:55,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:55,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 132 states. [2018-11-23 12:34:55,940 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 132 states. [2018-11-23 12:34:55,940 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 132 states. [2018-11-23 12:34:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:55,944 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2018-11-23 12:34:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2018-11-23 12:34:55,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:55,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:55,945 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 150 states. [2018-11-23 12:34:55,945 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 150 states. [2018-11-23 12:34:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:55,948 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2018-11-23 12:34:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2018-11-23 12:34:55,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:55,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:55,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:55,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:34:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2018-11-23 12:34:55,953 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 108 [2018-11-23 12:34:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:55,953 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2018-11-23 12:34:55,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2018-11-23 12:34:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:34:55,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:55,955 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 14, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:55,955 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2100173486, now seen corresponding path program 1 times [2018-11-23 12:34:55,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:55,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:55,963 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:55,963 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:55,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:55,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:56,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:56,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {8514#true} call ULTIMATE.init(); {8514#true} is VALID [2018-11-23 12:34:56,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {8514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8514#true} is VALID [2018-11-23 12:34:56,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {8514#true} assume true; {8514#true} is VALID [2018-11-23 12:34:56,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8514#true} {8514#true} #106#return; {8514#true} is VALID [2018-11-23 12:34:56,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {8514#true} call #t~ret5 := main(); {8514#true} is VALID [2018-11-23 12:34:56,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {8514#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {8534#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:56,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {8534#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8538#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:56,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {8538#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8542#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:56,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {8542#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8546#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:56,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {8546#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8550#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:56,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {8550#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8554#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:56,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {8554#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8558#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:56,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {8558#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8562#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:34:56,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {8562#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8566#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:34:56,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {8566#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:34:56,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {8515#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:34:56,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {8515#false} assume !(~i~0 < ~m~0); {8515#false} is VALID [2018-11-23 12:34:56,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {8515#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {8515#false} is VALID [2018-11-23 12:34:56,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {8515#false} assume !(#t~mem2 > ~max~0);havoc #t~mem2; {8515#false} is VALID [2018-11-23 12:34:56,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 47: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 48: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 49: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 50: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 52: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 53: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 54: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 55: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 58: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 60: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 61: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 62: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,444 INFO L273 TraceCheckUtils]: 63: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 64: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 65: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 66: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 67: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 68: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,445 INFO L273 TraceCheckUtils]: 69: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 72: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 73: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 74: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,446 INFO L273 TraceCheckUtils]: 75: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:34:56,447 INFO L273 TraceCheckUtils]: 76: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,447 INFO L273 TraceCheckUtils]: 77: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,447 INFO L273 TraceCheckUtils]: 78: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,447 INFO L273 TraceCheckUtils]: 80: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,448 INFO L273 TraceCheckUtils]: 81: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,448 INFO L273 TraceCheckUtils]: 82: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,448 INFO L273 TraceCheckUtils]: 83: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,448 INFO L273 TraceCheckUtils]: 84: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,448 INFO L273 TraceCheckUtils]: 85: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 86: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 87: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 88: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 90: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,449 INFO L273 TraceCheckUtils]: 91: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,450 INFO L273 TraceCheckUtils]: 92: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,450 INFO L273 TraceCheckUtils]: 93: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,450 INFO L273 TraceCheckUtils]: 94: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,450 INFO L273 TraceCheckUtils]: 95: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,450 INFO L273 TraceCheckUtils]: 96: Hoare triple {8515#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 97: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 98: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 99: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 100: Hoare triple {8515#false} assume !(~i~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 101: Hoare triple {8515#false} ~i~0 := 0;~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,451 INFO L273 TraceCheckUtils]: 102: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:34:56,452 INFO L273 TraceCheckUtils]: 103: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:34:56,452 INFO L256 TraceCheckUtils]: 104: Hoare triple {8515#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {8515#false} is VALID [2018-11-23 12:34:56,452 INFO L273 TraceCheckUtils]: 105: Hoare triple {8515#false} ~cond := #in~cond; {8515#false} is VALID [2018-11-23 12:34:56,452 INFO L273 TraceCheckUtils]: 106: Hoare triple {8515#false} assume 0 == ~cond; {8515#false} is VALID [2018-11-23 12:34:56,452 INFO L273 TraceCheckUtils]: 107: Hoare triple {8515#false} assume !false; {8515#false} is VALID [2018-11-23 12:34:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 12:34:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:56,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:34:56,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-23 12:34:56,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:56,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:34:56,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:56,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:34:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:34:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:56,524 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 11 states. [2018-11-23 12:34:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:57,663 INFO L93 Difference]: Finished difference Result 272 states and 353 transitions. [2018-11-23 12:34:57,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:34:57,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-23 12:34:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:34:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2018-11-23 12:34:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:34:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2018-11-23 12:34:57,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 138 transitions. [2018-11-23 12:34:57,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:57,972 INFO L225 Difference]: With dead ends: 272 [2018-11-23 12:34:57,972 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:34:57,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:34:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2018-11-23 12:34:58,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:58,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 146 states. [2018-11-23 12:34:58,370 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 146 states. [2018-11-23 12:34:58,370 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 146 states. [2018-11-23 12:34:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:58,375 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-23 12:34:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2018-11-23 12:34:58,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:58,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:58,376 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 155 states. [2018-11-23 12:34:58,376 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 155 states. [2018-11-23 12:34:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:58,379 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-23 12:34:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2018-11-23 12:34:58,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:58,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:58,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:58,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:34:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2018-11-23 12:34:58,384 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 108 [2018-11-23 12:34:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:58,384 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2018-11-23 12:34:58,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:34:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2018-11-23 12:34:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:34:58,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:58,386 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 16, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:58,386 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:58,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 225026463, now seen corresponding path program 2 times [2018-11-23 12:34:58,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:58,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:58,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:58,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:58,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:58,394 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:58,394 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:58,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:58,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:58,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:58,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:58,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {9783#true} call ULTIMATE.init(); {9783#true} is VALID [2018-11-23 12:34:58,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {9783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9783#true} is VALID [2018-11-23 12:34:58,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {9783#true} assume true; {9783#true} is VALID [2018-11-23 12:34:58,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9783#true} {9783#true} #106#return; {9783#true} is VALID [2018-11-23 12:34:58,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {9783#true} call #t~ret5 := main(); {9783#true} is VALID [2018-11-23 12:34:58,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {9783#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {9803#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:58,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {9803#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {9807#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:58,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {9807#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9811#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:58,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {9811#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9815#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:58,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {9815#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9819#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:58,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {9819#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9823#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:58,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {9823#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9827#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:58,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {9827#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9831#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:34:58,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {9831#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9835#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:34:58,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {9835#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9839#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:34:58,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {9839#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:34:58,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {9784#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,947 INFO L273 TraceCheckUtils]: 27: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:34:58,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {9784#false} assume !(~i~0 < ~m~0); {9784#false} is VALID [2018-11-23 12:34:58,948 INFO L273 TraceCheckUtils]: 29: Hoare triple {9784#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {9784#false} is VALID [2018-11-23 12:34:58,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {9784#false} assume !(#t~mem2 > ~max~0);havoc #t~mem2; {9784#false} is VALID [2018-11-23 12:34:58,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 38: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 39: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 40: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,951 INFO L273 TraceCheckUtils]: 46: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 48: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 49: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,953 INFO L273 TraceCheckUtils]: 58: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,954 INFO L273 TraceCheckUtils]: 59: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,954 INFO L273 TraceCheckUtils]: 60: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,954 INFO L273 TraceCheckUtils]: 61: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,954 INFO L273 TraceCheckUtils]: 62: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,954 INFO L273 TraceCheckUtils]: 63: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,955 INFO L273 TraceCheckUtils]: 64: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,955 INFO L273 TraceCheckUtils]: 65: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,955 INFO L273 TraceCheckUtils]: 66: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,955 INFO L273 TraceCheckUtils]: 67: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,955 INFO L273 TraceCheckUtils]: 68: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 69: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,956 INFO L273 TraceCheckUtils]: 74: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 75: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 76: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 77: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 78: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 79: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,957 INFO L273 TraceCheckUtils]: 80: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 81: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 82: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 83: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 84: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 85: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,958 INFO L273 TraceCheckUtils]: 86: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 87: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 88: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 89: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 90: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 91: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,959 INFO L273 TraceCheckUtils]: 92: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,960 INFO L273 TraceCheckUtils]: 93: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,960 INFO L273 TraceCheckUtils]: 94: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,960 INFO L273 TraceCheckUtils]: 95: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,960 INFO L273 TraceCheckUtils]: 96: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,960 INFO L273 TraceCheckUtils]: 97: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 98: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 99: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 100: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 101: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 102: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,961 INFO L273 TraceCheckUtils]: 103: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 104: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 105: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 106: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 107: Hoare triple {9784#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 108: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:34:58,962 INFO L273 TraceCheckUtils]: 109: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L273 TraceCheckUtils]: 110: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L273 TraceCheckUtils]: 111: Hoare triple {9784#false} assume !(~i~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {9784#false} ~i~0 := 0;~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L273 TraceCheckUtils]: 113: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L273 TraceCheckUtils]: 114: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:34:58,963 INFO L256 TraceCheckUtils]: 115: Hoare triple {9784#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {9784#false} is VALID [2018-11-23 12:34:58,964 INFO L273 TraceCheckUtils]: 116: Hoare triple {9784#false} ~cond := #in~cond; {9784#false} is VALID [2018-11-23 12:34:58,964 INFO L273 TraceCheckUtils]: 117: Hoare triple {9784#false} assume 0 == ~cond; {9784#false} is VALID [2018-11-23 12:34:58,964 INFO L273 TraceCheckUtils]: 118: Hoare triple {9784#false} assume !false; {9784#false} is VALID [2018-11-23 12:34:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-23 12:34:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:34:59,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 12:34:59,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:59,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:34:59,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:59,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:34:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:34:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:34:59,077 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand 12 states. [2018-11-23 12:35:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:00,344 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2018-11-23 12:35:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:35:00,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 12:35:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:35:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2018-11-23 12:35:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:35:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2018-11-23 12:35:00,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 147 transitions. [2018-11-23 12:35:00,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:00,556 INFO L225 Difference]: With dead ends: 299 [2018-11-23 12:35:00,556 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 12:35:00,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:35:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 12:35:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2018-11-23 12:35:00,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:00,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 160 states. [2018-11-23 12:35:00,930 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 160 states. [2018-11-23 12:35:00,930 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 160 states. [2018-11-23 12:35:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:00,934 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2018-11-23 12:35:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2018-11-23 12:35:00,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:00,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:00,935 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 169 states. [2018-11-23 12:35:00,935 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 169 states. [2018-11-23 12:35:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:00,939 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2018-11-23 12:35:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2018-11-23 12:35:00,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:00,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:00,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:00,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:35:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2018-11-23 12:35:00,944 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 119 [2018-11-23 12:35:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:00,944 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2018-11-23 12:35:00,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:35:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2018-11-23 12:35:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:35:00,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:00,946 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 18, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:00,946 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:00,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1333730318, now seen corresponding path program 3 times [2018-11-23 12:35:00,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:00,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:00,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:00,954 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:00,954 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:00,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:00,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:35:02,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:35:02,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:02,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:02,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {11175#true} call ULTIMATE.init(); {11175#true} is VALID [2018-11-23 12:35:02,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {11175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11175#true} is VALID [2018-11-23 12:35:02,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {11175#true} assume true; {11175#true} is VALID [2018-11-23 12:35:02,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11175#true} {11175#true} #106#return; {11175#true} is VALID [2018-11-23 12:35:02,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {11175#true} call #t~ret5 := main(); {11175#true} is VALID [2018-11-23 12:35:02,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {11175#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {11195#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {11195#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:02,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {11235#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:02,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {11235#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:02,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {11239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11243#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:02,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {11243#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11247#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:02,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {11247#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11251#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:02,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {11251#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11255#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:02,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {11255#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11259#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:02,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {11259#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11263#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:02,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {11263#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11267#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:02,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {11267#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11271#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:35:02,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {11271#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:35:02,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:35:02,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {11176#false} assume !(~i~0 < ~m~0); {11176#false} is VALID [2018-11-23 12:35:02,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {11176#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {11176#false} is VALID [2018-11-23 12:35:02,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:35:02,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {11176#false} assume !(#t~mem2 > ~max~0);havoc #t~mem2; {11176#false} is VALID [2018-11-23 12:35:02,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 50: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 51: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 52: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 53: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 56: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 57: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 58: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 60: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 61: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:35:02,372 INFO L273 TraceCheckUtils]: 62: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 63: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 67: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 68: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 69: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,373 INFO L273 TraceCheckUtils]: 70: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 72: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 73: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 74: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 75: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 76: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 77: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,374 INFO L273 TraceCheckUtils]: 78: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 79: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 80: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 81: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 82: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 85: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 86: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,375 INFO L273 TraceCheckUtils]: 87: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 88: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 89: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 90: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 91: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 92: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:35:02,376 INFO L273 TraceCheckUtils]: 93: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,377 INFO L273 TraceCheckUtils]: 94: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,377 INFO L273 TraceCheckUtils]: 95: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,377 INFO L273 TraceCheckUtils]: 96: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,377 INFO L273 TraceCheckUtils]: 97: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,377 INFO L273 TraceCheckUtils]: 98: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 99: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 100: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 101: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 102: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 103: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,378 INFO L273 TraceCheckUtils]: 104: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,379 INFO L273 TraceCheckUtils]: 105: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,379 INFO L273 TraceCheckUtils]: 106: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,379 INFO L273 TraceCheckUtils]: 107: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,379 INFO L273 TraceCheckUtils]: 108: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,379 INFO L273 TraceCheckUtils]: 109: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 110: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 111: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 112: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 113: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 114: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,380 INFO L273 TraceCheckUtils]: 115: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 116: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 117: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 118: Hoare triple {11176#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 119: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 120: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:35:02,381 INFO L273 TraceCheckUtils]: 121: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L273 TraceCheckUtils]: 122: Hoare triple {11176#false} assume !(~i~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L273 TraceCheckUtils]: 123: Hoare triple {11176#false} ~i~0 := 0;~j~0 := 0; {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L273 TraceCheckUtils]: 124: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L273 TraceCheckUtils]: 125: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L256 TraceCheckUtils]: 126: Hoare triple {11176#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {11176#false} is VALID [2018-11-23 12:35:02,382 INFO L273 TraceCheckUtils]: 127: Hoare triple {11176#false} ~cond := #in~cond; {11176#false} is VALID [2018-11-23 12:35:02,383 INFO L273 TraceCheckUtils]: 128: Hoare triple {11176#false} assume 0 == ~cond; {11176#false} is VALID [2018-11-23 12:35:02,383 INFO L273 TraceCheckUtils]: 129: Hoare triple {11176#false} assume !false; {11176#false} is VALID [2018-11-23 12:35:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 103 proven. 45 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [2018-11-23 12:35:02,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:02,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:35:02,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:35:02,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:02,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:35:02,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:02,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:35:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:35:02,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:35:02,499 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand 13 states. [2018-11-23 12:35:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:03,409 INFO L93 Difference]: Finished difference Result 326 states and 423 transitions. [2018-11-23 12:35:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:35:03,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:35:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:35:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2018-11-23 12:35:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:35:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2018-11-23 12:35:03,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2018-11-23 12:35:03,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:03,653 INFO L225 Difference]: With dead ends: 326 [2018-11-23 12:35:03,653 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 12:35:03,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:35:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 12:35:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2018-11-23 12:35:04,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:04,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 174 states. [2018-11-23 12:35:04,128 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 174 states. [2018-11-23 12:35:04,129 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 174 states. [2018-11-23 12:35:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:04,133 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2018-11-23 12:35:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2018-11-23 12:35:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:04,134 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 183 states. [2018-11-23 12:35:04,134 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 183 states. [2018-11-23 12:35:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:04,138 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2018-11-23 12:35:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2018-11-23 12:35:04,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:04,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:04,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:04,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:35:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2018-11-23 12:35:04,143 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 130 [2018-11-23 12:35:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:04,143 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2018-11-23 12:35:04,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:35:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2018-11-23 12:35:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:35:04,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:04,145 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 20, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:04,145 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:04,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash -135881921, now seen corresponding path program 4 times [2018-11-23 12:35:04,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:04,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:04,153 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:04,153 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:04,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:35:04,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:35:04,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:04,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:04,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2018-11-23 12:35:04,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {12690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12690#true} is VALID [2018-11-23 12:35:04,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2018-11-23 12:35:04,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #106#return; {12690#true} is VALID [2018-11-23 12:35:04,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret5 := main(); {12690#true} is VALID [2018-11-23 12:35:04,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {12690#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {12690#true} is VALID [2018-11-23 12:35:04,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {12690#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {12690#true} is VALID [2018-11-23 12:35:04,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {12690#true} assume !(~j~0 < ~n~0); {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {12690#true} ~i~0 := 1 + ~i~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {12690#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {12690#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:35:04,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {12690#true} assume !(~j~0 < ~n~0); {12690#true} is VALID [2018-11-23 12:35:04,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {12690#true} ~i~0 := 1 + ~i~0; {12690#true} is VALID [2018-11-23 12:35:04,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {12690#true} assume !(~i~0 < ~m~0); {12690#true} is VALID [2018-11-23 12:35:04,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {12690#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {12794#(<= main_~i~0 0)} is VALID [2018-11-23 12:35:04,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {12794#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !(#t~mem2 > ~max~0);havoc #t~mem2; {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,751 INFO L273 TraceCheckUtils]: 42: Hoare triple {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,752 INFO L273 TraceCheckUtils]: 43: Hoare triple {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,766 INFO L273 TraceCheckUtils]: 57: Hoare triple {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,766 INFO L273 TraceCheckUtils]: 58: Hoare triple {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,767 INFO L273 TraceCheckUtils]: 59: Hoare triple {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,768 INFO L273 TraceCheckUtils]: 60: Hoare triple {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,769 INFO L273 TraceCheckUtils]: 61: Hoare triple {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12888#(and (<= 9 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:04,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {12888#(and (<= 9 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,774 INFO L273 TraceCheckUtils]: 68: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,777 INFO L273 TraceCheckUtils]: 71: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,778 INFO L273 TraceCheckUtils]: 73: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,779 INFO L273 TraceCheckUtils]: 74: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,779 INFO L273 TraceCheckUtils]: 75: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,780 INFO L273 TraceCheckUtils]: 76: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,781 INFO L273 TraceCheckUtils]: 77: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,782 INFO L273 TraceCheckUtils]: 78: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,782 INFO L273 TraceCheckUtils]: 79: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,783 INFO L273 TraceCheckUtils]: 80: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,784 INFO L273 TraceCheckUtils]: 81: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,785 INFO L273 TraceCheckUtils]: 82: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,785 INFO L273 TraceCheckUtils]: 83: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,786 INFO L273 TraceCheckUtils]: 84: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,787 INFO L273 TraceCheckUtils]: 85: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,790 INFO L273 TraceCheckUtils]: 89: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,791 INFO L273 TraceCheckUtils]: 90: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,791 INFO L273 TraceCheckUtils]: 91: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,792 INFO L273 TraceCheckUtils]: 92: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,793 INFO L273 TraceCheckUtils]: 93: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,794 INFO L273 TraceCheckUtils]: 94: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,794 INFO L273 TraceCheckUtils]: 95: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,795 INFO L273 TraceCheckUtils]: 96: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,796 INFO L273 TraceCheckUtils]: 97: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,796 INFO L273 TraceCheckUtils]: 98: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,797 INFO L273 TraceCheckUtils]: 99: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,798 INFO L273 TraceCheckUtils]: 100: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,799 INFO L273 TraceCheckUtils]: 101: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,800 INFO L273 TraceCheckUtils]: 102: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,800 INFO L273 TraceCheckUtils]: 103: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,801 INFO L273 TraceCheckUtils]: 104: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,802 INFO L273 TraceCheckUtils]: 105: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,802 INFO L273 TraceCheckUtils]: 106: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,803 INFO L273 TraceCheckUtils]: 107: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,804 INFO L273 TraceCheckUtils]: 108: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,805 INFO L273 TraceCheckUtils]: 109: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,805 INFO L273 TraceCheckUtils]: 110: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,806 INFO L273 TraceCheckUtils]: 111: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,807 INFO L273 TraceCheckUtils]: 112: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,808 INFO L273 TraceCheckUtils]: 113: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,808 INFO L273 TraceCheckUtils]: 114: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,809 INFO L273 TraceCheckUtils]: 115: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,810 INFO L273 TraceCheckUtils]: 116: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,811 INFO L273 TraceCheckUtils]: 117: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,811 INFO L273 TraceCheckUtils]: 118: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,812 INFO L273 TraceCheckUtils]: 119: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,813 INFO L273 TraceCheckUtils]: 120: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,814 INFO L273 TraceCheckUtils]: 121: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,814 INFO L273 TraceCheckUtils]: 122: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,815 INFO L273 TraceCheckUtils]: 123: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,816 INFO L273 TraceCheckUtils]: 124: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,817 INFO L273 TraceCheckUtils]: 125: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,817 INFO L273 TraceCheckUtils]: 126: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,818 INFO L273 TraceCheckUtils]: 127: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,840 INFO L273 TraceCheckUtils]: 128: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,853 INFO L273 TraceCheckUtils]: 129: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,854 INFO L273 TraceCheckUtils]: 130: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,854 INFO L273 TraceCheckUtils]: 131: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,857 INFO L273 TraceCheckUtils]: 132: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {13105#(and (<= main_~i~0 3) (<= 10 main_~n~0))} is VALID [2018-11-23 12:35:04,857 INFO L273 TraceCheckUtils]: 133: Hoare triple {13105#(and (<= main_~i~0 3) (<= 10 main_~n~0))} assume !(~i~0 < ~n~0); {12691#false} is VALID [2018-11-23 12:35:04,857 INFO L273 TraceCheckUtils]: 134: Hoare triple {12691#false} ~i~0 := 0;~j~0 := 0; {12691#false} is VALID [2018-11-23 12:35:04,857 INFO L273 TraceCheckUtils]: 135: Hoare triple {12691#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {12691#false} is VALID [2018-11-23 12:35:04,857 INFO L273 TraceCheckUtils]: 136: Hoare triple {12691#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12691#false} is VALID [2018-11-23 12:35:04,858 INFO L256 TraceCheckUtils]: 137: Hoare triple {12691#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {12691#false} is VALID [2018-11-23 12:35:04,858 INFO L273 TraceCheckUtils]: 138: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2018-11-23 12:35:04,858 INFO L273 TraceCheckUtils]: 139: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2018-11-23 12:35:04,858 INFO L273 TraceCheckUtils]: 140: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2018-11-23 12:35:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 117 proven. 1000 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 12:35:04,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:04,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-23 12:35:04,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:35:04,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:04,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:35:04,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:04,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:35:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:35:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:35:04,969 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand 17 states. [2018-11-23 12:35:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:08,393 INFO L93 Difference]: Finished difference Result 480 states and 616 transitions. [2018-11-23 12:35:08,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:35:08,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:35:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:35:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 12:35:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:35:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 12:35:08,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 241 transitions. [2018-11-23 12:35:08,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:08,801 INFO L225 Difference]: With dead ends: 480 [2018-11-23 12:35:08,801 INFO L226 Difference]: Without dead ends: 440 [2018-11-23 12:35:08,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:35:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-23 12:35:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 207. [2018-11-23 12:35:09,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:09,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand 207 states. [2018-11-23 12:35:09,423 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand 207 states. [2018-11-23 12:35:09,423 INFO L87 Difference]: Start difference. First operand 440 states. Second operand 207 states. [2018-11-23 12:35:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:09,439 INFO L93 Difference]: Finished difference Result 440 states and 565 transitions. [2018-11-23 12:35:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2018-11-23 12:35:09,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:09,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:09,440 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 440 states. [2018-11-23 12:35:09,440 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 440 states. [2018-11-23 12:35:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:09,462 INFO L93 Difference]: Finished difference Result 440 states and 565 transitions. [2018-11-23 12:35:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2018-11-23 12:35:09,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:09,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:09,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:09,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 12:35:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 264 transitions. [2018-11-23 12:35:09,469 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 264 transitions. Word has length 141 [2018-11-23 12:35:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:09,469 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 264 transitions. [2018-11-23 12:35:09,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:35:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 264 transitions. [2018-11-23 12:35:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:35:09,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:09,471 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:09,471 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:09,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:09,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1725028030, now seen corresponding path program 5 times [2018-11-23 12:35:09,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:09,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:09,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:09,488 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:09,488 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:09,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:09,504 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1