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/init-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:04,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:04,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:04,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:04,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:04,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:04,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:04,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:04,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:04,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:04,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:04,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:04,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:04,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:04,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:04,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:04,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:04,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:04,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:04,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:04,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:04,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:04,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:04,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:04,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:04,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:04,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:04,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:04,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:04,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:04,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:04,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:04,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:04,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:04,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:04,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:04,540 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:04,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:04,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:04,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:04,561 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:04,562 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:04,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:04,562 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:04,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:04,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:04,565 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:04,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:04,565 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:04,565 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:04,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:04,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:04,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:04,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:04,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:04,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:04,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:04,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:04,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:04,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:04,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:04,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:04,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:04,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:04,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:04,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:04,652 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:04,652 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:04,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i [2018-11-23 12:34:04,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1711a583d/1a52e299084d4c918cb107621892fe79/FLAGc63df23e6 [2018-11-23 12:34:05,243 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:05,245 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i [2018-11-23 12:34:05,253 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1711a583d/1a52e299084d4c918cb107621892fe79/FLAGc63df23e6 [2018-11-23 12:34:05,568 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1711a583d/1a52e299084d4c918cb107621892fe79 [2018-11-23 12:34:05,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:05,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:05,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:05,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:05,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:05,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:05" (1/1) ... [2018-11-23 12:34:05,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f288c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:05, skipping insertion in model container [2018-11-23 12:34:05,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:05" (1/1) ... [2018-11-23 12:34:05,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:05,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:05,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:05,909 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:05,952 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:05,975 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:05,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:05 WrapperNode [2018-11-23 12:34:05,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:05,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:05,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:05,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:05,988 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:05" (1/1) ... [2018-11-23 12:34:05,997 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:05" (1/1) ... [2018-11-23 12:34:06,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:06,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:06,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:06,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:06,016 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:05" (1/1) ... [2018-11-23 12:34:06,016 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:05" (1/1) ... [2018-11-23 12:34:06,018 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:05" (1/1) ... [2018-11-23 12:34:06,018 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:05" (1/1) ... [2018-11-23 12:34:06,028 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:05" (1/1) ... [2018-11-23 12:34:06,036 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:05" (1/1) ... [2018-11-23 12:34:06,038 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:05" (1/1) ... [2018-11-23 12:34:06,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:06,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:06,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:06,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:06,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:05" (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:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:06,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:06,758 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:06,758 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:34:06,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:06 BoogieIcfgContainer [2018-11-23 12:34:06,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:06,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:06,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:06,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:06,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:05" (1/3) ... [2018-11-23 12:34:06,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedbe0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:06, skipping insertion in model container [2018-11-23 12:34:06,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:05" (2/3) ... [2018-11-23 12:34:06,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedbe0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:06, skipping insertion in model container [2018-11-23 12:34:06,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:06" (3/3) ... [2018-11-23 12:34:06,768 INFO L112 eAbstractionObserver]: Analyzing ICFG init-3-u_true-unreach-call.i [2018-11-23 12:34:06,777 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:06,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:06,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:06,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:06,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:06,833 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:06,833 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:06,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:06,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:06,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:06,834 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:06,834 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:34:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:34:06,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:06,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:06,864 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:06,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1375180307, now seen corresponding path program 1 times [2018-11-23 12:34:06,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:06,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:06,954 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:06,954 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:06,955 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:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:07,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:07,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:34:07,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:34:07,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:34:07,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 12:34:07,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2018-11-23 12:34:07,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {33#true} is VALID [2018-11-23 12:34:07,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 12:34:07,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:07,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:07,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {34#false} is VALID [2018-11-23 12:34:07,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {34#false} is VALID [2018-11-23 12:34:07,127 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {34#false} is VALID [2018-11-23 12:34:07,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:34:07,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:34:07,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:34:07,131 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:07,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:07,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:34:07,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:34:07,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:07,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:34:07,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:07,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:34:07,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:34:07,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:07,271 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 12:34:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,674 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2018-11-23 12:34:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:34:07,674 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:34:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 12:34:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 12:34:07,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-23 12:34:07,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:07,998 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:07,999 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:34:08,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:34:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:34:08,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:08,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:08,068 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:08,068 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,072 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 12:34:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:08,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,073 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:08,074 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:34:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,079 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 12:34:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:08,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:08,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:34:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 12:34:08,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 15 [2018-11-23 12:34:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:08,087 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 12:34:08,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:34:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 12:34:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:34:08,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:08,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:08,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:08,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1308846031, now seen corresponding path program 1 times [2018-11-23 12:34:08,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:08,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,100 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:08,100 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:08,100 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:08,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:08,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2018-11-23 12:34:08,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {240#true} is VALID [2018-11-23 12:34:08,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2018-11-23 12:34:08,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #99#return; {240#true} is VALID [2018-11-23 12:34:08,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret2 := main(); {240#true} is VALID [2018-11-23 12:34:08,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {260#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:08,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {241#false} is VALID [2018-11-23 12:34:08,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:08,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {241#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:08,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {241#false} is VALID [2018-11-23 12:34:08,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {241#false} is VALID [2018-11-23 12:34:08,565 INFO L256 TraceCheckUtils]: 11: Hoare triple {241#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {241#false} is VALID [2018-11-23 12:34:08,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {241#false} ~cond := #in~cond; {241#false} is VALID [2018-11-23 12:34:08,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {241#false} assume 0 == ~cond; {241#false} is VALID [2018-11-23 12:34:08,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2018-11-23 12:34:08,567 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:08,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:08,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:08,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:34:08,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:08,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:08,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:08,622 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 3 states. [2018-11-23 12:34:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,819 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:34:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:08,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:34:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:34:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:34:08,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:34:09,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,065 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:34:09,065 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:34:09,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:34:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-23 12:34:09,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:09,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:09,089 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:09,089 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-23 12:34:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,092 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:09,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,094 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-23 12:34:09,094 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-23 12:34:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,097 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:09,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:09,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:34:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:34:09,101 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-11-23 12:34:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:09,102 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:34:09,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:34:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:34:09,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:09,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:09,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:09,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1886649102, now seen corresponding path program 1 times [2018-11-23 12:34:09,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:09,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,113 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:09,113 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:09,113 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:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:09,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 12:34:09,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {450#true} is VALID [2018-11-23 12:34:09,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 12:34:09,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #99#return; {450#true} is VALID [2018-11-23 12:34:09,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2018-11-23 12:34:09,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {470#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:09,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {470#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {474#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:09,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {451#false} is VALID [2018-11-23 12:34:09,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#false} ~i~0 := 1 + ~i~0; {451#false} is VALID [2018-11-23 12:34:09,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#false} assume !(~i~0 < ~n~0); {451#false} is VALID [2018-11-23 12:34:09,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:09,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:09,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {451#false} is VALID [2018-11-23 12:34:09,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {451#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {451#false} is VALID [2018-11-23 12:34:09,268 INFO L256 TraceCheckUtils]: 14: Hoare triple {451#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {451#false} is VALID [2018-11-23 12:34:09,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {451#false} ~cond := #in~cond; {451#false} is VALID [2018-11-23 12:34:09,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {451#false} assume 0 == ~cond; {451#false} is VALID [2018-11-23 12:34:09,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 12:34:09,271 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:09,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:09,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:09,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:34:09,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:09,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:09,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:09,400 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 12:34:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,703 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:34:09,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:09,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:34:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:34:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 12:34:09,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 12:34:09,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,881 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:09,881 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:34:09,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:34:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 12:34:09,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:09,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:09,910 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:09,910 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 12:34:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,915 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 12:34:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:34:09,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,917 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 12:34:09,917 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 12:34:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,921 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 12:34:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:34:09,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:09,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:34:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:34:09,925 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-11-23 12:34:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:09,925 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:34:09,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:34:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:34:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:09,927 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, 1] [2018-11-23 12:34:09,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:09,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -464275123, now seen corresponding path program 1 times [2018-11-23 12:34:09,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:09,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:09,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,946 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:09,946 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:09,946 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:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:10,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 12:34:10,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {701#true} is VALID [2018-11-23 12:34:10,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 12:34:10,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #99#return; {701#true} is VALID [2018-11-23 12:34:10,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret2 := main(); {701#true} is VALID [2018-11-23 12:34:10,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {721#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:10,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {721#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {721#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:10,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {728#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:10,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !(~k~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:10,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#false} ~j~0 := 1 + ~j~0; {702#false} is VALID [2018-11-23 12:34:10,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#false} assume !(~j~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:10,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#false} ~i~0 := 1 + ~i~0; {702#false} is VALID [2018-11-23 12:34:10,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {702#false} assume !(~i~0 < ~n~0); {702#false} is VALID [2018-11-23 12:34:10,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {702#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:10,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:10,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {702#false} is VALID [2018-11-23 12:34:10,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {702#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {702#false} is VALID [2018-11-23 12:34:10,160 INFO L256 TraceCheckUtils]: 17: Hoare triple {702#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {702#false} is VALID [2018-11-23 12:34:10,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} ~cond := #in~cond; {702#false} is VALID [2018-11-23 12:34:10,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#false} assume 0 == ~cond; {702#false} is VALID [2018-11-23 12:34:10,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 12:34:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:10,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:10,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:10,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:10,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:10,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:10,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:10,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:10,215 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:34:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,443 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 12:34:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:10,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:10,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2018-11-23 12:34:10,551 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:10,553 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:34:10,553 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:34:10,555 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:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:34:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 12:34:10,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:10,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:10,601 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:10,601 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 12:34:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,604 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:34:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:34:10,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,606 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 12:34:10,606 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 12:34:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,609 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:34:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:34:10,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:10,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:34:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:34:10,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2018-11-23 12:34:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:10,613 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:34:10,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:34:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:34:10,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:10,614 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, 1, 1] [2018-11-23 12:34:10,615 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:10,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash -727027933, now seen corresponding path program 1 times [2018-11-23 12:34:10,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:10,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:10,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,623 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:10,624 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:10,624 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:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:10,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2018-11-23 12:34:10,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {963#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {963#true} is VALID [2018-11-23 12:34:10,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2018-11-23 12:34:10,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #99#return; {963#true} is VALID [2018-11-23 12:34:10,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret2 := main(); {963#true} is VALID [2018-11-23 12:34:10,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {983#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:10,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {983#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:10,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {990#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:10,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {990#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {994#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:10,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {994#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !(~k~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:10,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {964#false} ~j~0 := 1 + ~j~0; {964#false} is VALID [2018-11-23 12:34:10,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {964#false} assume !(~j~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:10,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#false} ~i~0 := 1 + ~i~0; {964#false} is VALID [2018-11-23 12:34:10,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#false} assume !(~i~0 < ~n~0); {964#false} is VALID [2018-11-23 12:34:10,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {964#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:10,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {964#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:10,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {964#false} is VALID [2018-11-23 12:34:10,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {964#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {964#false} is VALID [2018-11-23 12:34:10,822 INFO L256 TraceCheckUtils]: 18: Hoare triple {964#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {964#false} is VALID [2018-11-23 12:34:10,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {964#false} ~cond := #in~cond; {964#false} is VALID [2018-11-23 12:34:10,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#false} assume 0 == ~cond; {964#false} is VALID [2018-11-23 12:34:10,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {964#false} assume !false; {964#false} is VALID [2018-11-23 12:34:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:10,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:10,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:10,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:34:10,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:10,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:10,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:10,948 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:34:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,218 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 12:34:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:11,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:34:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-23 12:34:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-23 12:34:11,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-23 12:34:11,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:11,313 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:34:11,313 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:34:11,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:34:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 12:34:11,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:11,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:11,378 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:11,378 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-23 12:34:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,381 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:34:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:34:11,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,383 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-23 12:34:11,383 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-23 12:34:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,386 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:34:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:34:11,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:11,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:34:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 12:34:11,390 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2018-11-23 12:34:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 12:34:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:34:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:34:11,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:11,391 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, 1, 1] [2018-11-23 12:34:11,392 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash -282430451, now seen corresponding path program 2 times [2018-11-23 12:34:11,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:11,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,400 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:11,400 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:11,401 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:11,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:11,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:11,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:11,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:11,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {1255#true} call ULTIMATE.init(); {1255#true} is VALID [2018-11-23 12:34:11,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {1255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1255#true} is VALID [2018-11-23 12:34:11,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {1255#true} assume true; {1255#true} is VALID [2018-11-23 12:34:11,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1255#true} {1255#true} #99#return; {1255#true} is VALID [2018-11-23 12:34:11,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {1255#true} call #t~ret2 := main(); {1255#true} is VALID [2018-11-23 12:34:11,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {1255#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1275#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:11,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {1275#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1275#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:11,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {1275#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1282#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:11,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {1282#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1286#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:11,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1290#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:11,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {1290#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !(~k~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:11,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {1256#false} ~j~0 := 1 + ~j~0; {1256#false} is VALID [2018-11-23 12:34:11,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {1256#false} assume !(~j~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:11,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1256#false} ~i~0 := 1 + ~i~0; {1256#false} is VALID [2018-11-23 12:34:11,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {1256#false} assume !(~i~0 < ~n~0); {1256#false} is VALID [2018-11-23 12:34:11,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {1256#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:11,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1256#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:11,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {1256#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1256#false} is VALID [2018-11-23 12:34:11,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {1256#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1256#false} is VALID [2018-11-23 12:34:11,588 INFO L256 TraceCheckUtils]: 19: Hoare triple {1256#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1256#false} is VALID [2018-11-23 12:34:11,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {1256#false} ~cond := #in~cond; {1256#false} is VALID [2018-11-23 12:34:11,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {1256#false} assume 0 == ~cond; {1256#false} is VALID [2018-11-23 12:34:11,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {1256#false} assume !false; {1256#false} is VALID [2018-11-23 12:34:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:11,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:11,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:34:11,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:11,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:11,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:11,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:11,665 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2018-11-23 12:34:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,011 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-11-23 12:34:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:12,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:34:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 12:34:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 12:34:12,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2018-11-23 12:34:12,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:12,124 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:34:12,124 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:34:12,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:34:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 12:34:12,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:12,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:12,275 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:12,275 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 12:34:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,278 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:34:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:34:12,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:12,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:12,279 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 12:34:12,279 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 12:34:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,282 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:34:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:34:12,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:12,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:12,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:12,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 12:34:12,286 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 23 [2018-11-23 12:34:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:12,286 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 12:34:12,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 12:34:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:34:12,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:12,287 INFO L402 BasicCegarLoop]: trace histogram [3, 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:12,288 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:12,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 615189603, now seen corresponding path program 3 times [2018-11-23 12:34:12,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:12,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:12,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:12,296 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:12,296 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:12,296 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:12,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:12,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:12,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:12,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:12,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2018-11-23 12:34:12,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1580#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1580#true} is VALID [2018-11-23 12:34:12,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2018-11-23 12:34:12,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #99#return; {1580#true} is VALID [2018-11-23 12:34:12,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret2 := main(); {1580#true} is VALID [2018-11-23 12:34:12,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {1580#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~k~0 < ~n~0); {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:12,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {1600#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {1628#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:34:12,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {1581#false} is VALID [2018-11-23 12:34:12,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {1581#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:12,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {1581#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:12,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {1581#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1581#false} is VALID [2018-11-23 12:34:12,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {1581#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1581#false} is VALID [2018-11-23 12:34:12,627 INFO L256 TraceCheckUtils]: 20: Hoare triple {1581#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1581#false} is VALID [2018-11-23 12:34:12,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {1581#false} ~cond := #in~cond; {1581#false} is VALID [2018-11-23 12:34:12,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {1581#false} assume 0 == ~cond; {1581#false} is VALID [2018-11-23 12:34:12,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2018-11-23 12:34:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:34:12,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:12,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:12,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:34:12,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:12,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:12,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:12,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:12,750 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-11-23 12:34:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,123 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 12:34:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:13,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 12:34:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:34:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-23 12:34:13,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-23 12:34:13,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:13,206 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:34:13,206 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:34:13,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:34:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-23 12:34:13,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:13,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:13,293 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:13,293 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 47 states. [2018-11-23 12:34:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,297 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:34:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 12:34:13,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,298 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states. [2018-11-23 12:34:13,298 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states. [2018-11-23 12:34:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,301 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:34:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 12:34:13,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:13,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:34:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-23 12:34:13,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 24 [2018-11-23 12:34:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:13,305 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-23 12:34:13,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-23 12:34:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:34:13,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:13,306 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:13,307 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:13,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 550587983, now seen corresponding path program 4 times [2018-11-23 12:34:13,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:13,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:13,315 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:13,316 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:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:13,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:13,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:13,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:13,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2018-11-23 12:34:13,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {1966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1966#true} is VALID [2018-11-23 12:34:13,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-23 12:34:13,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #99#return; {1966#true} is VALID [2018-11-23 12:34:13,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret2 := main(); {1966#true} is VALID [2018-11-23 12:34:13,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {1966#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1966#true} is VALID [2018-11-23 12:34:13,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {1966#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1989#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:13,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {1989#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1993#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:13,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {1993#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1997#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:13,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {1997#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2001#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:13,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {2001#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:13,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} assume !(~k~0 < ~n~0); {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:13,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {2005#(and (<= 3 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {2012#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:13,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {2012#(and (<= 3 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:13,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1967#false} ~i~0 := 1 + ~i~0; {1967#false} is VALID [2018-11-23 12:34:13,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {1967#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:13,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {1967#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:13,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:13,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:13,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1967#false} is VALID [2018-11-23 12:34:13,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {1967#false} assume !(~k~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:13,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {1967#false} ~j~0 := 1 + ~j~0; {1967#false} is VALID [2018-11-23 12:34:13,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {1967#false} assume !(~j~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:13,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {1967#false} ~i~0 := 1 + ~i~0; {1967#false} is VALID [2018-11-23 12:34:13,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {1967#false} assume !(~i~0 < ~n~0); {1967#false} is VALID [2018-11-23 12:34:13,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {1967#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:13,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {1967#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:13,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {1967#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1967#false} is VALID [2018-11-23 12:34:13,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {1967#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1967#false} is VALID [2018-11-23 12:34:13,878 INFO L256 TraceCheckUtils]: 29: Hoare triple {1967#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1967#false} is VALID [2018-11-23 12:34:13,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {1967#false} ~cond := #in~cond; {1967#false} is VALID [2018-11-23 12:34:13,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {1967#false} assume 0 == ~cond; {1967#false} is VALID [2018-11-23 12:34:13,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2018-11-23 12:34:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:34:13,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:13,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:13,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:34:13,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:13,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:14,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:14,053 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2018-11-23 12:34:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,210 INFO L93 Difference]: Finished difference Result 126 states and 157 transitions. [2018-11-23 12:34:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:15,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 12:34:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 12:34:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 12:34:15,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2018-11-23 12:34:15,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:15,390 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:34:15,390 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:34:15,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:34:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2018-11-23 12:34:15,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:15,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:15,554 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:15,554 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 71 states. [2018-11-23 12:34:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,560 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 12:34:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-11-23 12:34:15,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,561 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 93 states. [2018-11-23 12:34:15,561 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 93 states. [2018-11-23 12:34:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,565 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 12:34:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-11-23 12:34:15,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:15,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:34:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-11-23 12:34:15,570 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 33 [2018-11-23 12:34:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:15,570 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-11-23 12:34:15,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 12:34:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:34:15,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:15,572 INFO L402 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:15,572 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:15,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash -98839249, now seen corresponding path program 5 times [2018-11-23 12:34:15,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:15,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,581 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:15,581 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:15,581 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:15,600 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:34:15,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:34:15,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:15,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:16,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {2593#true} call ULTIMATE.init(); {2593#true} is VALID [2018-11-23 12:34:16,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {2593#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2593#true} is VALID [2018-11-23 12:34:16,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {2593#true} assume true; {2593#true} is VALID [2018-11-23 12:34:16,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2593#true} {2593#true} #99#return; {2593#true} is VALID [2018-11-23 12:34:16,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {2593#true} call #t~ret2 := main(); {2593#true} is VALID [2018-11-23 12:34:16,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {2593#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2593#true} is VALID [2018-11-23 12:34:16,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {2593#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {2616#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {2616#(<= main_~j~0 0)} assume !(~k~0 < ~n~0); {2616#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:16,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {2616#(<= main_~j~0 0)} ~j~0 := 1 + ~j~0; {2635#(<= main_~j~0 1)} is VALID [2018-11-23 12:34:16,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#(<= main_~j~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2639#(and (<= 0 main_~k~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:16,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {2639#(and (<= 0 main_~k~0) (<= main_~j~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2643#(and (<= main_~j~0 1) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:16,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {2643#(and (<= main_~j~0 1) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2647#(and (<= 2 main_~k~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:16,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {2647#(and (<= 2 main_~k~0) (<= main_~j~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2651#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:16,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {2651#(and (<= 3 main_~n~0) (<= main_~j~0 1))} assume !(~k~0 < ~n~0); {2651#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:16,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {2651#(and (<= 3 main_~n~0) (<= main_~j~0 1))} ~j~0 := 1 + ~j~0; {2658#(and (<= 3 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:16,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {2658#(and (<= 3 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:16,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {2594#false} ~i~0 := 1 + ~i~0; {2594#false} is VALID [2018-11-23 12:34:16,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {2594#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {2594#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {2594#false} assume !(~k~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:16,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {2594#false} ~j~0 := 1 + ~j~0; {2594#false} is VALID [2018-11-23 12:34:16,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {2594#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2594#false} is VALID [2018-11-23 12:34:16,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {2594#false} assume !(~k~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:16,043 INFO L273 TraceCheckUtils]: 33: Hoare triple {2594#false} ~j~0 := 1 + ~j~0; {2594#false} is VALID [2018-11-23 12:34:16,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {2594#false} assume !(~j~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:16,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {2594#false} ~i~0 := 1 + ~i~0; {2594#false} is VALID [2018-11-23 12:34:16,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {2594#false} assume !(~i~0 < ~n~0); {2594#false} is VALID [2018-11-23 12:34:16,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {2594#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {2594#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {2594#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2594#false} is VALID [2018-11-23 12:34:16,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {2594#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2594#false} is VALID [2018-11-23 12:34:16,045 INFO L256 TraceCheckUtils]: 41: Hoare triple {2594#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2594#false} is VALID [2018-11-23 12:34:16,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {2594#false} ~cond := #in~cond; {2594#false} is VALID [2018-11-23 12:34:16,045 INFO L273 TraceCheckUtils]: 43: Hoare triple {2594#false} assume 0 == ~cond; {2594#false} is VALID [2018-11-23 12:34:16,045 INFO L273 TraceCheckUtils]: 44: Hoare triple {2594#false} assume !false; {2594#false} is VALID [2018-11-23 12:34:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 82 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:34:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:16,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:16,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:16,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:16,102 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:16,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:16,103 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 9 states. [2018-11-23 12:34:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,203 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2018-11-23 12:34:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:34:17,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-23 12:34:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-23 12:34:17,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2018-11-23 12:34:17,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:17,398 INFO L225 Difference]: With dead ends: 168 [2018-11-23 12:34:17,398 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:34:17,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:34:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:34:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 95. [2018-11-23 12:34:17,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:17,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 95 states. [2018-11-23 12:34:17,761 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 95 states. [2018-11-23 12:34:17,762 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 95 states. [2018-11-23 12:34:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,766 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2018-11-23 12:34:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-11-23 12:34:17,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,766 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 117 states. [2018-11-23 12:34:17,766 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 117 states. [2018-11-23 12:34:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,770 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2018-11-23 12:34:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-11-23 12:34:17,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:17,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:34:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-11-23 12:34:17,774 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 45 [2018-11-23 12:34:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:17,774 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-11-23 12:34:17,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-11-23 12:34:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:34:17,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:17,775 INFO L402 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:17,776 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:17,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1998480783, now seen corresponding path program 6 times [2018-11-23 12:34:17,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:17,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,782 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:17,782 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:17,782 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:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:34:17,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 12:34:17,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:18,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {3432#true} call ULTIMATE.init(); {3432#true} is VALID [2018-11-23 12:34:18,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {3432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3432#true} is VALID [2018-11-23 12:34:18,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {3432#true} assume true; {3432#true} is VALID [2018-11-23 12:34:18,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3432#true} {3432#true} #99#return; {3432#true} is VALID [2018-11-23 12:34:18,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {3432#true} call #t~ret2 := main(); {3432#true} is VALID [2018-11-23 12:34:18,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {3432#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {3452#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {3452#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {3452#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {3452#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {3452#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:18,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {3452#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3495#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:18,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {3495#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3499#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:18,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {3499#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3503#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:18,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {3503#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3507#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:18,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {3507#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !(~k~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {3433#false} ~j~0 := 1 + ~j~0; {3433#false} is VALID [2018-11-23 12:34:18,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {3433#false} assume !(~j~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {3433#false} ~i~0 := 1 + ~i~0; {3433#false} is VALID [2018-11-23 12:34:18,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {3433#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {3433#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,084 INFO L273 TraceCheckUtils]: 32: Hoare triple {3433#false} assume !(~k~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {3433#false} ~j~0 := 1 + ~j~0; {3433#false} is VALID [2018-11-23 12:34:18,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {3433#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,085 INFO L273 TraceCheckUtils]: 35: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,086 INFO L273 TraceCheckUtils]: 36: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,086 INFO L273 TraceCheckUtils]: 37: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {3433#false} assume !(~k~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {3433#false} ~j~0 := 1 + ~j~0; {3433#false} is VALID [2018-11-23 12:34:18,087 INFO L273 TraceCheckUtils]: 40: Hoare triple {3433#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,087 INFO L273 TraceCheckUtils]: 42: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {3433#false} assume !(~k~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 45: Hoare triple {3433#false} ~j~0 := 1 + ~j~0; {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {3433#false} assume !(~j~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {3433#false} ~i~0 := 1 + ~i~0; {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {3433#false} assume !(~i~0 < ~n~0); {3433#false} is VALID [2018-11-23 12:34:18,088 INFO L273 TraceCheckUtils]: 49: Hoare triple {3433#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L273 TraceCheckUtils]: 50: Hoare triple {3433#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L273 TraceCheckUtils]: 51: Hoare triple {3433#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {3433#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L256 TraceCheckUtils]: 53: Hoare triple {3433#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {3433#false} ~cond := #in~cond; {3433#false} is VALID [2018-11-23 12:34:18,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {3433#false} assume 0 == ~cond; {3433#false} is VALID [2018-11-23 12:34:18,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {3433#false} assume !false; {3433#false} is VALID [2018-11-23 12:34:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 201 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 12:34:18,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:18,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:18,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-23 12:34:18,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:18,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:18,160 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:18,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:18,161 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 7 states. [2018-11-23 12:34:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,961 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2018-11-23 12:34:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:18,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-23 12:34:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:34:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:34:18,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-23 12:34:19,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:19,061 INFO L225 Difference]: With dead ends: 200 [2018-11-23 12:34:19,061 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:34:19,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:34:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-11-23 12:34:19,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:19,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 110 states. [2018-11-23 12:34:19,719 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 110 states. [2018-11-23 12:34:19,719 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 110 states. [2018-11-23 12:34:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:19,723 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2018-11-23 12:34:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-11-23 12:34:19,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:19,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:19,725 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 117 states. [2018-11-23 12:34:19,725 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 117 states. [2018-11-23 12:34:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:19,729 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2018-11-23 12:34:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-11-23 12:34:19,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:19,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:19,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:19,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 12:34:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-23 12:34:19,735 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 57 [2018-11-23 12:34:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:19,735 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-23 12:34:19,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-23 12:34:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:34:19,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:19,737 INFO L402 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:19,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:19,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1557287797, now seen corresponding path program 7 times [2018-11-23 12:34:19,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:19,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:19,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:19,744 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:19,745 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:19,745 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:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:19,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:20,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {4369#true} call ULTIMATE.init(); {4369#true} is VALID [2018-11-23 12:34:20,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {4369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4369#true} is VALID [2018-11-23 12:34:20,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {4369#true} assume true; {4369#true} is VALID [2018-11-23 12:34:20,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4369#true} {4369#true} #99#return; {4369#true} is VALID [2018-11-23 12:34:20,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {4369#true} call #t~ret2 := main(); {4369#true} is VALID [2018-11-23 12:34:20,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {4369#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {4389#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:20,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {4389#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4389#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:20,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {4389#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4396#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:20,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {4396#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4400#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:20,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {4400#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4404#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:20,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {4404#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4408#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:20,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {4408#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4412#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:20,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {4412#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {4370#false} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {4370#false} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {4370#false} assume !(~j~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {4370#false} ~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-23 12:34:20,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,061 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {4370#false} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,062 INFO L273 TraceCheckUtils]: 37: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,063 INFO L273 TraceCheckUtils]: 39: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,063 INFO L273 TraceCheckUtils]: 42: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,064 INFO L273 TraceCheckUtils]: 43: Hoare triple {4370#false} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,064 INFO L273 TraceCheckUtils]: 44: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,064 INFO L273 TraceCheckUtils]: 45: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,064 INFO L273 TraceCheckUtils]: 46: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,065 INFO L273 TraceCheckUtils]: 47: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,065 INFO L273 TraceCheckUtils]: 49: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {4370#false} is VALID [2018-11-23 12:34:20,065 INFO L273 TraceCheckUtils]: 50: Hoare triple {4370#false} assume !(~k~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {4370#false} ~j~0 := 1 + ~j~0; {4370#false} is VALID [2018-11-23 12:34:20,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {4370#false} assume !(~j~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,066 INFO L273 TraceCheckUtils]: 53: Hoare triple {4370#false} ~i~0 := 1 + ~i~0; {4370#false} is VALID [2018-11-23 12:34:20,066 INFO L273 TraceCheckUtils]: 54: Hoare triple {4370#false} assume !(~i~0 < ~n~0); {4370#false} is VALID [2018-11-23 12:34:20,066 INFO L273 TraceCheckUtils]: 55: Hoare triple {4370#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {4370#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {4370#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4370#false} is VALID [2018-11-23 12:34:20,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {4370#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {4370#false} is VALID [2018-11-23 12:34:20,067 INFO L256 TraceCheckUtils]: 59: Hoare triple {4370#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {4370#false} is VALID [2018-11-23 12:34:20,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {4370#false} ~cond := #in~cond; {4370#false} is VALID [2018-11-23 12:34:20,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {4370#false} assume 0 == ~cond; {4370#false} is VALID [2018-11-23 12:34:20,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {4370#false} assume !false; {4370#false} is VALID [2018-11-23 12:34:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 134 proven. 10 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-23 12:34:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:20,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-23 12:34:20,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:20,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:20,127 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:20,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:20,128 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2018-11-23 12:34:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:21,099 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2018-11-23 12:34:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:21,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-23 12:34:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:34:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:34:21,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2018-11-23 12:34:22,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:22,203 INFO L225 Difference]: With dead ends: 229 [2018-11-23 12:34:22,203 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 12:34:22,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 12:34:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2018-11-23 12:34:23,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:23,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 125 states. [2018-11-23 12:34:23,309 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 125 states. [2018-11-23 12:34:23,309 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 125 states. [2018-11-23 12:34:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:23,314 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-23 12:34:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-23 12:34:23,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:23,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:23,315 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 132 states. [2018-11-23 12:34:23,315 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 132 states. [2018-11-23 12:34:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:23,320 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-23 12:34:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-23 12:34:23,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:23,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:23,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:23,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:34:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-11-23 12:34:23,325 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 63 [2018-11-23 12:34:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:23,325 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-11-23 12:34:23,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-11-23 12:34:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:34:23,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:23,326 INFO L402 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:23,327 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:23,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1777595919, now seen corresponding path program 8 times [2018-11-23 12:34:23,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:23,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:23,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:23,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:23,334 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:23,334 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:23,334 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:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:23,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:23,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:23,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:23,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {5434#true} call ULTIMATE.init(); {5434#true} is VALID [2018-11-23 12:34:23,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {5434#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5434#true} is VALID [2018-11-23 12:34:23,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {5434#true} assume true; {5434#true} is VALID [2018-11-23 12:34:23,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5434#true} {5434#true} #99#return; {5434#true} is VALID [2018-11-23 12:34:23,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {5434#true} call #t~ret2 := main(); {5434#true} is VALID [2018-11-23 12:34:23,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {5434#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {5454#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:23,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {5454#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5454#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:23,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {5454#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {5461#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:23,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {5461#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5465#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:23,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {5465#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5469#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:23,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {5469#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5473#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:23,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {5473#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5477#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:23,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {5477#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5481#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:34:23,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {5435#false} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {5435#false} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#false} assume !(~j~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {5435#false} ~i~0 := 1 + ~i~0; {5435#false} is VALID [2018-11-23 12:34:23,643 INFO L273 TraceCheckUtils]: 33: Hoare triple {5435#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {5435#false} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {5435#false} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {5435#false} is VALID [2018-11-23 12:34:23,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {5435#false} assume !(~k~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {5435#false} ~j~0 := 1 + ~j~0; {5435#false} is VALID [2018-11-23 12:34:23,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {5435#false} assume !(~j~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {5435#false} ~i~0 := 1 + ~i~0; {5435#false} is VALID [2018-11-23 12:34:23,649 INFO L273 TraceCheckUtils]: 60: Hoare triple {5435#false} assume !(~i~0 < ~n~0); {5435#false} is VALID [2018-11-23 12:34:23,649 INFO L273 TraceCheckUtils]: 61: Hoare triple {5435#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,649 INFO L273 TraceCheckUtils]: 62: Hoare triple {5435#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {5435#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {5435#false} is VALID [2018-11-23 12:34:23,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {5435#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {5435#false} is VALID [2018-11-23 12:34:23,650 INFO L256 TraceCheckUtils]: 65: Hoare triple {5435#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {5435#false} is VALID [2018-11-23 12:34:23,650 INFO L273 TraceCheckUtils]: 66: Hoare triple {5435#false} ~cond := #in~cond; {5435#false} is VALID [2018-11-23 12:34:23,650 INFO L273 TraceCheckUtils]: 67: Hoare triple {5435#false} assume 0 == ~cond; {5435#false} is VALID [2018-11-23 12:34:23,650 INFO L273 TraceCheckUtils]: 68: Hoare triple {5435#false} assume !false; {5435#false} is VALID [2018-11-23 12:34:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2018-11-23 12:34:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:23,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:23,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-23 12:34:23,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:23,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:23,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:23,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:23,706 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 9 states. [2018-11-23 12:34:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:24,736 INFO L93 Difference]: Finished difference Result 258 states and 326 transitions. [2018-11-23 12:34:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:24,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-23 12:34:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 12:34:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 12:34:24,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 90 transitions. [2018-11-23 12:34:25,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:25,878 INFO L225 Difference]: With dead ends: 258 [2018-11-23 12:34:25,878 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 12:34:25,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 12:34:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2018-11-23 12:34:26,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:26,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 140 states. [2018-11-23 12:34:26,588 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 140 states. [2018-11-23 12:34:26,588 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 140 states. [2018-11-23 12:34:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,594 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2018-11-23 12:34:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-11-23 12:34:26,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,596 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 147 states. [2018-11-23 12:34:26,596 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 147 states. [2018-11-23 12:34:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:26,601 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2018-11-23 12:34:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-11-23 12:34:26,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:26,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:26,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:26,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 12:34:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2018-11-23 12:34:26,607 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 69 [2018-11-23 12:34:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:26,607 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2018-11-23 12:34:26,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2018-11-23 12:34:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:34:26,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:26,608 INFO L402 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:26,609 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:26,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1500778997, now seen corresponding path program 9 times [2018-11-23 12:34:26,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:26,616 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:26,617 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:26,617 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:26,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:26,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:34:26,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:26,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:27,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {6627#true} call ULTIMATE.init(); {6627#true} is VALID [2018-11-23 12:34:27,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {6627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6627#true} is VALID [2018-11-23 12:34:27,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {6627#true} assume true; {6627#true} is VALID [2018-11-23 12:34:27,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6627#true} {6627#true} #99#return; {6627#true} is VALID [2018-11-23 12:34:27,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {6627#true} call #t~ret2 := main(); {6627#true} is VALID [2018-11-23 12:34:27,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {6627#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {6647#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {6647#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {6647#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,958 INFO L273 TraceCheckUtils]: 34: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {6647#(<= 1000 main_~n~0)} ~i~0 := 1 + ~i~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,962 INFO L273 TraceCheckUtils]: 38: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,962 INFO L273 TraceCheckUtils]: 39: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,963 INFO L273 TraceCheckUtils]: 40: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,963 INFO L273 TraceCheckUtils]: 42: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {6647#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,970 INFO L273 TraceCheckUtils]: 51: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,971 INFO L273 TraceCheckUtils]: 52: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,971 INFO L273 TraceCheckUtils]: 53: Hoare triple {6647#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {6647#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {6647#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:34:27,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {6647#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {6798#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:27,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {6798#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6802#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:27,974 INFO L273 TraceCheckUtils]: 57: Hoare triple {6802#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6806#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:27,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {6806#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6810#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:27,976 INFO L273 TraceCheckUtils]: 59: Hoare triple {6810#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6814#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:27,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {6814#(and (<= 1000 main_~n~0) (<= main_~k~0 4))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6818#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:34:27,979 INFO L273 TraceCheckUtils]: 61: Hoare triple {6818#(and (<= main_~k~0 5) (<= 1000 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {6822#(and (<= 1000 main_~n~0) (<= main_~k~0 6))} is VALID [2018-11-23 12:34:27,980 INFO L273 TraceCheckUtils]: 62: Hoare triple {6822#(and (<= 1000 main_~n~0) (<= main_~k~0 6))} assume !(~k~0 < ~n~0); {6628#false} is VALID [2018-11-23 12:34:27,980 INFO L273 TraceCheckUtils]: 63: Hoare triple {6628#false} ~j~0 := 1 + ~j~0; {6628#false} is VALID [2018-11-23 12:34:27,980 INFO L273 TraceCheckUtils]: 64: Hoare triple {6628#false} assume !(~j~0 < ~n~0); {6628#false} is VALID [2018-11-23 12:34:27,980 INFO L273 TraceCheckUtils]: 65: Hoare triple {6628#false} ~i~0 := 1 + ~i~0; {6628#false} is VALID [2018-11-23 12:34:27,980 INFO L273 TraceCheckUtils]: 66: Hoare triple {6628#false} assume !(~i~0 < ~n~0); {6628#false} is VALID [2018-11-23 12:34:27,981 INFO L273 TraceCheckUtils]: 67: Hoare triple {6628#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {6628#false} is VALID [2018-11-23 12:34:27,981 INFO L273 TraceCheckUtils]: 68: Hoare triple {6628#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {6628#false} is VALID [2018-11-23 12:34:27,981 INFO L273 TraceCheckUtils]: 69: Hoare triple {6628#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {6628#false} is VALID [2018-11-23 12:34:27,982 INFO L273 TraceCheckUtils]: 70: Hoare triple {6628#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {6628#false} is VALID [2018-11-23 12:34:27,982 INFO L256 TraceCheckUtils]: 71: Hoare triple {6628#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {6628#false} is VALID [2018-11-23 12:34:27,982 INFO L273 TraceCheckUtils]: 72: Hoare triple {6628#false} ~cond := #in~cond; {6628#false} is VALID [2018-11-23 12:34:27,983 INFO L273 TraceCheckUtils]: 73: Hoare triple {6628#false} assume 0 == ~cond; {6628#false} is VALID [2018-11-23 12:34:27,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {6628#false} assume !false; {6628#false} is VALID [2018-11-23 12:34:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 260 proven. 21 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-11-23 12:34:28,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:28,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:34:28,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 12:34:28,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:28,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:34:28,046 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:28,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:34:28,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:34:28,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:28,047 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand 10 states. [2018-11-23 12:34:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:29,920 INFO L93 Difference]: Finished difference Result 287 states and 361 transitions. [2018-11-23 12:34:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:34:29,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 12:34:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 12:34:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 12:34:29,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2018-11-23 12:34:30,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:30,387 INFO L225 Difference]: With dead ends: 287 [2018-11-23 12:34:30,387 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:34:30,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:34:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-11-23 12:34:31,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:31,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 155 states. [2018-11-23 12:34:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 155 states. [2018-11-23 12:34:31,183 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 155 states. [2018-11-23 12:34:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,189 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2018-11-23 12:34:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2018-11-23 12:34:31,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,191 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 162 states. [2018-11-23 12:34:31,191 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 162 states. [2018-11-23 12:34:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,198 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2018-11-23 12:34:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2018-11-23 12:34:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:31,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:31,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 12:34:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 188 transitions. [2018-11-23 12:34:31,205 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 188 transitions. Word has length 75 [2018-11-23 12:34:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:31,206 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 188 transitions. [2018-11-23 12:34:31,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:34:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 188 transitions. [2018-11-23 12:34:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:34:31,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:31,207 INFO L402 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:31,208 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:31,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1294358897, now seen corresponding path program 10 times [2018-11-23 12:34:31,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:31,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:31,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,216 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:31,216 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:31,216 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:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:31,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:31,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:31,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:32,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {7948#true} call ULTIMATE.init(); {7948#true} is VALID [2018-11-23 12:34:32,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {7948#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7948#true} is VALID [2018-11-23 12:34:32,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {7948#true} assume true; {7948#true} is VALID [2018-11-23 12:34:32,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7948#true} {7948#true} #99#return; {7948#true} is VALID [2018-11-23 12:34:32,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {7948#true} call #t~ret2 := main(); {7948#true} is VALID [2018-11-23 12:34:32,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {7948#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {7948#true} is VALID [2018-11-23 12:34:32,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {7948#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {7971#(<= main_~j~0 0)} is VALID [2018-11-23 12:34:32,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {7971#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {7975#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:32,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {7975#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7979#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-23 12:34:32,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {7979#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7983#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:32,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {7983#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7987#(and (<= 3 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:32,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {7987#(and (<= 3 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7991#(and (<= main_~j~0 0) (<= 4 main_~k~0))} is VALID [2018-11-23 12:34:32,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {7991#(and (<= main_~j~0 0) (<= 4 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7995#(and (<= 5 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:32,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {7995#(and (<= 5 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7999#(and (<= 6 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:32,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {7999#(and (<= 6 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8003#(and (<= main_~j~0 0) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {8003#(and (<= main_~j~0 0) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8003#(and (<= main_~j~0 0) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {8003#(and (<= main_~j~0 0) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,122 INFO L273 TraceCheckUtils]: 19: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {8010#(and (<= main_~j~0 1) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} assume !(~k~0 < ~n~0); {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {8041#(and (<= main_~j~0 2) (<= 7 main_~n~0))} ~j~0 := 1 + ~j~0; {8072#(and (<= main_~j~0 3) (<= 7 main_~n~0))} is VALID [2018-11-23 12:34:32,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {8072#(and (<= main_~j~0 3) (<= 7 main_~n~0))} assume !(~j~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {7949#false} ~i~0 := 1 + ~i~0; {7949#false} is VALID [2018-11-23 12:34:32,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {7949#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {7949#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,145 INFO L273 TraceCheckUtils]: 43: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {7949#false} assume !(~k~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {7949#false} ~j~0 := 1 + ~j~0; {7949#false} is VALID [2018-11-23 12:34:32,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {7949#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 53: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 54: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 57: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {7949#false} assume !(~k~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {7949#false} ~j~0 := 1 + ~j~0; {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {7949#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 61: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 63: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,149 INFO L273 TraceCheckUtils]: 64: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 65: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {7949#false} assume !(~k~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {7949#false} ~j~0 := 1 + ~j~0; {7949#false} is VALID [2018-11-23 12:34:32,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {7949#false} assume !(~j~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {7949#false} ~i~0 := 1 + ~i~0; {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {7949#false} assume !(~i~0 < ~n~0); {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {7949#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 74: Hoare triple {7949#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {7949#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {7949#false} is VALID [2018-11-23 12:34:32,151 INFO L273 TraceCheckUtils]: 76: Hoare triple {7949#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {7949#false} is VALID [2018-11-23 12:34:32,152 INFO L256 TraceCheckUtils]: 77: Hoare triple {7949#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {7949#false} is VALID [2018-11-23 12:34:32,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {7949#false} ~cond := #in~cond; {7949#false} is VALID [2018-11-23 12:34:32,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {7949#false} assume 0 == ~cond; {7949#false} is VALID [2018-11-23 12:34:32,152 INFO L273 TraceCheckUtils]: 80: Hoare triple {7949#false} assume !false; {7949#false} is VALID [2018-11-23 12:34:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 624 proven. 208 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 12:34:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 12:34:32,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-23 12:34:32,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:32,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:34:32,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:32,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:34:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:34:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:34:32,233 INFO L87 Difference]: Start difference. First operand 155 states and 188 transitions. Second operand 14 states. [2018-11-23 12:34:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:34,028 INFO L93 Difference]: Finished difference Result 358 states and 443 transitions. [2018-11-23 12:34:34,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:34:34,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-11-23 12:34:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:34:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 141 transitions. [2018-11-23 12:34:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:34:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 141 transitions. [2018-11-23 12:34:34,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 141 transitions. [2018-11-23 12:34:34,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:34,564 INFO L225 Difference]: With dead ends: 358 [2018-11-23 12:34:34,564 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 12:34:34,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:34:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 12:34:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 199. [2018-11-23 12:34:35,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:35,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:35,218 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:35,219 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 199 states. [2018-11-23 12:34:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,231 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2018-11-23 12:34:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2018-11-23 12:34:35,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,232 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 241 states. [2018-11-23 12:34:35,233 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 241 states. [2018-11-23 12:34:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,245 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2018-11-23 12:34:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2018-11-23 12:34:35,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:35,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 12:34:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2018-11-23 12:34:35,255 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 81 [2018-11-23 12:34:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:35,256 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2018-11-23 12:34:35,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:34:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2018-11-23 12:34:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:34:35,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:35,257 INFO L402 BasicCegarLoop]: trace histogram [56, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:35,257 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:35,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash -552358545, now seen corresponding path program 11 times [2018-11-23 12:34:35,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,265 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:35,265 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:35,265 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:35,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1