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-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:04,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:04,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:04,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:04,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:04,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:04,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:04,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:04,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:04,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:04,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:04,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:04,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:04,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:04,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:04,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:04,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:04,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:04,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:04,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:04,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:04,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:04,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:04,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:04,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:04,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:04,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:04,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:04,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:04,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:04,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:04,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:04,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:04,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:04,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:04,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:04,219 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,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:04,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:04,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:04,246 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:04,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:04,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:04,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:04,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:04,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:04,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:04,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:04,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:04,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:04,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:04,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:04,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:04,250 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:04,250 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:04,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:04,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:04,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:04,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:04,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:04,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:04,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:04,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:04,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:04,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:04,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:04,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:04,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:04,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:04,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:04,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:04,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:04,350 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:04,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-23 12:34:04,418 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6222bd046/5706967d87eb40f5adf5a91b00e849ba/FLAGe8f20966b [2018-11-23 12:34:04,841 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:04,842 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-23 12:34:04,848 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6222bd046/5706967d87eb40f5adf5a91b00e849ba/FLAGe8f20966b [2018-11-23 12:34:05,216 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6222bd046/5706967d87eb40f5adf5a91b00e849ba [2018-11-23 12:34:05,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:05,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:05,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:05,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:05,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:05,233 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,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef57ff 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,236 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,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:05,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:05,492 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:05,497 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:05,525 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:05,549 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:05,549 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,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:05,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:05,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:05,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:05,562 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,571 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:05,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:05,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:05,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:05,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:05,593 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:05,593 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:05,595 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:05,595 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:05,610 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:05,626 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:05,633 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:05,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:05,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:05,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:05,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:05,642 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:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:06,293 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:06,294 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:34:06,294 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,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:06,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:06,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:06,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:06,299 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,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d7763b 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,301 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,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d7763b 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,301 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,303 INFO L112 eAbstractionObserver]: Analyzing ICFG init-2-n-u_true-unreach-call.i [2018-11-23 12:34:06,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:06,326 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:06,345 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:06,376 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:06,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:06,377 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:06,377 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:06,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:06,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:06,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:06,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:06,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:34:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:34:06,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:06,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:06,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:06,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1832694891, now seen corresponding path program 1 times [2018-11-23 12:34:06,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:06,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:06,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:06,499 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:06,499 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:06,499 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,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:06,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:06,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 12:34:06,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29#true} is VALID [2018-11-23 12:34:06,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 12:34:06,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #73#return; {29#true} is VALID [2018-11-23 12:34:06,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2018-11-23 12:34:06,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {49#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:06,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {30#false} is VALID [2018-11-23 12:34:06,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0;~j~0 := 0; {30#false} is VALID [2018-11-23 12:34:06,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {30#false} is VALID [2018-11-23 12:34:06,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {30#false} is VALID [2018-11-23 12:34:06,997 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {30#false} is VALID [2018-11-23 12:34:06,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 12:34:06,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 12:34:06,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 12:34:07,002 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,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:07,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:34:07,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:07,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:07,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:07,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:07,168 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-23 12:34:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,698 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-11-23 12:34:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:07,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:34:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:34:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:34:07,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-23 12:34:07,923 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:07,935 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:34:07,936 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:34:07,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:34:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 12:34:07,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:07,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-23 12:34:07,995 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-23 12:34:07,995 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-23 12:34:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,999 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:34:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:34:08,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,000 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-23 12:34:08,001 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-23 12:34:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,005 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:34:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:34:08,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:08,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:34:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 12:34:08,011 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-23 12:34:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:08,011 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 12:34:08,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:34:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:08,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:08,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:08,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:08,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1374604441, now seen corresponding path program 1 times [2018-11-23 12:34:08,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:08,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,028 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:08,029 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:08,029 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,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:08,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2018-11-23 12:34:08,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {221#true} is VALID [2018-11-23 12:34:08,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2018-11-23 12:34:08,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #73#return; {221#true} is VALID [2018-11-23 12:34:08,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret2 := main(); {221#true} is VALID [2018-11-23 12:34:08,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {221#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {241#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:08,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {241#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {245#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:08,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {245#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {222#false} is VALID [2018-11-23 12:34:08,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#false} ~i~0 := 1 + ~i~0; {222#false} is VALID [2018-11-23 12:34:08,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#false} assume !(~i~0 < ~m~0); {222#false} is VALID [2018-11-23 12:34:08,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#false} ~i~0 := 0;~j~0 := 0; {222#false} is VALID [2018-11-23 12:34:08,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {222#false} is VALID [2018-11-23 12:34:08,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {222#false} is VALID [2018-11-23 12:34:08,200 INFO L256 TraceCheckUtils]: 13: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {222#false} is VALID [2018-11-23 12:34:08,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2018-11-23 12:34:08,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2018-11-23 12:34:08,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {222#false} assume !false; {222#false} is VALID [2018-11-23 12:34:08,203 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:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:08,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 12:34:08,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:08,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:08,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:08,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:08,450 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-11-23 12:34:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,934 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 12:34:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:08,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 12:34:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 12:34:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 12:34:08,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-23 12:34:09,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,093 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:34:09,094 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:34:09,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:34:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-23 12:34:09,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:09,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:09,146 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:09,147 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-23 12:34:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,151 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:34:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:34:09,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,152 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-23 12:34:09,152 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-23 12:34:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,155 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:34:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:34:09,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:09,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:34:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:34:09,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 12:34:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:09,160 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:34:09,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:34:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:34:09,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:09,161 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,161 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:09,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1853309542, now seen corresponding path program 1 times [2018-11-23 12:34:09,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:09,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:09,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,171 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:09,171 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:09,171 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,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:09,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-23 12:34:09,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {429#true} is VALID [2018-11-23 12:34:09,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 12:34:09,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #73#return; {429#true} is VALID [2018-11-23 12:34:09,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret2 := main(); {429#true} is VALID [2018-11-23 12:34:09,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {449#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:09,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {449#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {453#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:09,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {453#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {457#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:09,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {430#false} is VALID [2018-11-23 12:34:09,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#false} ~i~0 := 1 + ~i~0; {430#false} is VALID [2018-11-23 12:34:09,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {430#false} assume !(~i~0 < ~m~0); {430#false} is VALID [2018-11-23 12:34:09,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {430#false} ~i~0 := 0;~j~0 := 0; {430#false} is VALID [2018-11-23 12:34:09,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {430#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {430#false} is VALID [2018-11-23 12:34:09,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {430#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {430#false} is VALID [2018-11-23 12:34:09,422 INFO L256 TraceCheckUtils]: 14: Hoare triple {430#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {430#false} is VALID [2018-11-23 12:34:09,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {430#false} ~cond := #in~cond; {430#false} is VALID [2018-11-23 12:34:09,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {430#false} assume 0 == ~cond; {430#false} is VALID [2018-11-23 12:34:09,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-23 12:34:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:09,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:09,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:09,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:34:09,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:09,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:09,518 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,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:09,520 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2018-11-23 12:34:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,880 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:34:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:09,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:34:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 12:34:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 12:34:09,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-23 12:34:10,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:10,034 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:34:10,034 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:34:10,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:34:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 12:34:10,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:10,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 12:34:10,122 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 12:34:10,122 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 12:34:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,126 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:34:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:34:10,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,127 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 12:34:10,127 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 12:34:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,130 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:34:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:34:10,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:10,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:34:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:34:10,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2018-11-23 12:34:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:10,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:34:10,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:34:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:34:10,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:10,136 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:10,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:10,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 486701511, now seen corresponding path program 2 times [2018-11-23 12:34:10,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:10,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:10,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,145 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:10,146 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:10,146 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:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:10,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:10,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:10,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2018-11-23 12:34:10,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {667#true} is VALID [2018-11-23 12:34:10,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2018-11-23 12:34:10,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #73#return; {667#true} is VALID [2018-11-23 12:34:10,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret2 := main(); {667#true} is VALID [2018-11-23 12:34:10,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {667#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {687#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:10,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {687#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {691#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:10,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {695#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:10,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {699#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:10,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {699#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {668#false} is VALID [2018-11-23 12:34:10,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {668#false} ~i~0 := 1 + ~i~0; {668#false} is VALID [2018-11-23 12:34:10,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {668#false} assume !(~i~0 < ~m~0); {668#false} is VALID [2018-11-23 12:34:10,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {668#false} ~i~0 := 0;~j~0 := 0; {668#false} is VALID [2018-11-23 12:34:10,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {668#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {668#false} is VALID [2018-11-23 12:34:10,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {668#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {668#false} is VALID [2018-11-23 12:34:10,340 INFO L256 TraceCheckUtils]: 15: Hoare triple {668#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {668#false} is VALID [2018-11-23 12:34:10,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2018-11-23 12:34:10,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2018-11-23 12:34:10,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {668#false} assume !false; {668#false} is VALID [2018-11-23 12:34:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:10,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:10,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:10,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:34:10,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:10,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:10,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:10,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:10,385 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2018-11-23 12:34:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,669 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 12:34:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:10,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:34:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 12:34:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 12:34:10,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 12:34:10,775 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:10,778 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:34:10,778 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:34:10,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:34:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 12:34:10,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:10,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 12:34:10,821 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 12:34:10,822 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 12:34:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,825 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:34:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:34:10,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,827 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 12:34:10,827 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 12:34:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,830 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:34:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:34:10,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:10,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:34:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:34:10,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2018-11-23 12:34:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:10,835 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:34:10,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:34:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:34:10,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:10,836 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:10,837 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:10,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 12600122, now seen corresponding path program 3 times [2018-11-23 12:34:10,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,845 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:10,845 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:10,845 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,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:10,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:10,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:11,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {938#true} call ULTIMATE.init(); {938#true} is VALID [2018-11-23 12:34:11,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {938#true} is VALID [2018-11-23 12:34:11,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2018-11-23 12:34:11,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #73#return; {938#true} is VALID [2018-11-23 12:34:11,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {938#true} call #t~ret2 := main(); {938#true} is VALID [2018-11-23 12:34:11,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {938#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {977#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:11,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {977#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {939#false} is VALID [2018-11-23 12:34:11,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#false} ~i~0 := 0;~j~0 := 0; {939#false} is VALID [2018-11-23 12:34:11,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {939#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {939#false} is VALID [2018-11-23 12:34:11,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {939#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {939#false} is VALID [2018-11-23 12:34:11,035 INFO L256 TraceCheckUtils]: 16: Hoare triple {939#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {939#false} is VALID [2018-11-23 12:34:11,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {939#false} ~cond := #in~cond; {939#false} is VALID [2018-11-23 12:34:11,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {939#false} assume 0 == ~cond; {939#false} is VALID [2018-11-23 12:34:11,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {939#false} assume !false; {939#false} is VALID [2018-11-23 12:34:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:34:11,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:11,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:11,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:11,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:11,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:11,078 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:11,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:11,080 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-23 12:34:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,248 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-23 12:34:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:11,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-23 12:34:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2018-11-23 12:34:11,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2018-11-23 12:34:11,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:11,364 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:34:11,364 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:34:11,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:34:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-23 12:34:11,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:11,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:11,465 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:11,465 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,468 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 12:34:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 12:34:11,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,470 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2018-11-23 12:34:11,470 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2018-11-23 12:34:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,473 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 12:34:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 12:34:11,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:11,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:34:11,478 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 20 [2018-11-23 12:34:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:11,478 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:34:11,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:34:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:34:11,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:11,479 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:11,480 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:11,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 554384073, now seen corresponding path program 4 times [2018-11-23 12:34:11,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:11,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:11,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,488 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:11,488 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:11,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:11,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:11,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:11,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:11,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {1248#true} call ULTIMATE.init(); {1248#true} is VALID [2018-11-23 12:34:11,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {1248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1248#true} is VALID [2018-11-23 12:34:11,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {1248#true} assume true; {1248#true} is VALID [2018-11-23 12:34:11,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1248#true} {1248#true} #73#return; {1248#true} is VALID [2018-11-23 12:34:11,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {1248#true} call #t~ret2 := main(); {1248#true} is VALID [2018-11-23 12:34:11,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {1248#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1268#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:11,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {1268#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1272#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:11,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {1272#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1276#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:11,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {1276#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1280#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:11,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1284#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:11,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {1284#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {1249#false} is VALID [2018-11-23 12:34:11,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {1249#false} ~i~0 := 1 + ~i~0; {1249#false} is VALID [2018-11-23 12:34:11,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {1249#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1249#false} is VALID [2018-11-23 12:34:11,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {1249#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1249#false} is VALID [2018-11-23 12:34:11,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {1249#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1249#false} is VALID [2018-11-23 12:34:11,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {1249#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1249#false} is VALID [2018-11-23 12:34:11,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {1249#false} assume !(~j~0 < ~n~0); {1249#false} is VALID [2018-11-23 12:34:11,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {1249#false} ~i~0 := 1 + ~i~0; {1249#false} is VALID [2018-11-23 12:34:11,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {1249#false} assume !(~i~0 < ~m~0); {1249#false} is VALID [2018-11-23 12:34:11,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {1249#false} ~i~0 := 0;~j~0 := 0; {1249#false} is VALID [2018-11-23 12:34:11,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {1249#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1249#false} is VALID [2018-11-23 12:34:11,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {1249#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1249#false} is VALID [2018-11-23 12:34:11,748 INFO L256 TraceCheckUtils]: 22: Hoare triple {1249#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1249#false} is VALID [2018-11-23 12:34:11,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {1249#false} ~cond := #in~cond; {1249#false} is VALID [2018-11-23 12:34:11,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {1249#false} assume 0 == ~cond; {1249#false} is VALID [2018-11-23 12:34:11,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {1249#false} assume !false; {1249#false} is VALID [2018-11-23 12:34:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:34:11,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:11,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:11,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:34:11,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:11,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:11,806 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,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:11,807 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 7 states. [2018-11-23 12:34:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,133 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 12:34:12,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:12,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:34:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:34:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:34:12,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 12:34:12,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:12,306 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:34:12,306 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:34:12,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:34:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 12:34:12,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:12,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2018-11-23 12:34:12,433 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2018-11-23 12:34:12,433 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2018-11-23 12:34:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,436 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:34:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:34:12,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:12,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:12,437 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2018-11-23 12:34:12,437 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2018-11-23 12:34:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,441 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:34:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:34:12,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:12,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:12,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:12,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:34:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-23 12:34:12,445 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2018-11-23 12:34:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:12,445 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 12:34:12,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 12:34:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:34:12,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:12,446 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:12,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:12,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1435350805, now seen corresponding path program 5 times [2018-11-23 12:34:12,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:12,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:12,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:12,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:12,455 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:12,456 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:12,456 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,475 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:34:12,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:34:12,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:12,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:12,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2018-11-23 12:34:12,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {1613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1613#true} is VALID [2018-11-23 12:34:12,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 12:34:12,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #73#return; {1613#true} is VALID [2018-11-23 12:34:12,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret2 := main(); {1613#true} is VALID [2018-11-23 12:34:12,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1613#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1633#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:12,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {1633#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1637#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:12,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {1637#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1641#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:12,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {1641#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:12,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1649#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:12,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {1649#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1653#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:12,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {1653#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:34:12,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {1614#false} ~i~0 := 1 + ~i~0; {1614#false} is VALID [2018-11-23 12:34:12,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {1614#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1614#false} is VALID [2018-11-23 12:34:12,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:34:12,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:34:12,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:34:12,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:34:12,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {1614#false} assume !(~j~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:34:12,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {1614#false} ~i~0 := 1 + ~i~0; {1614#false} is VALID [2018-11-23 12:34:12,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {1614#false} assume !(~i~0 < ~m~0); {1614#false} is VALID [2018-11-23 12:34:12,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {1614#false} ~i~0 := 0;~j~0 := 0; {1614#false} is VALID [2018-11-23 12:34:12,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {1614#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1614#false} is VALID [2018-11-23 12:34:12,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1614#false} is VALID [2018-11-23 12:34:12,760 INFO L256 TraceCheckUtils]: 24: Hoare triple {1614#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1614#false} is VALID [2018-11-23 12:34:12,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2018-11-23 12:34:12,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#false} assume 0 == ~cond; {1614#false} is VALID [2018-11-23 12:34:12,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2018-11-23 12:34:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:34:12,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:12,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:12,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:34:12,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:12,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:12,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:12,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:12,816 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 8 states. [2018-11-23 12:34:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,219 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2018-11-23 12:34:13,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:13,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:34:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-23 12:34:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2018-11-23 12:34:13,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2018-11-23 12:34:13,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:13,376 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:34:13,376 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:34:13,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 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:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:34:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 12:34:13,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:13,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2018-11-23 12:34:13,510 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2018-11-23 12:34:13,510 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2018-11-23 12:34:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,514 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 12:34:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 12:34:13,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,515 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2018-11-23 12:34:13,515 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2018-11-23 12:34:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,518 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 12:34:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 12:34:13,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:13,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:34:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 12:34:13,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 28 [2018-11-23 12:34:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:13,522 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 12:34:13,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 12:34:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:34:13,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:13,523 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:13,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:13,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1344459191, now seen corresponding path program 6 times [2018-11-23 12:34:13,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:13,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,532 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:13,533 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:13,533 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,554 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:34:13,571 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-23 12:34:13,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:13,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:13,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:34:13,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:34:13,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:34:13,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #73#return; {2020#true} is VALID [2018-11-23 12:34:13,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret2 := main(); {2020#true} is VALID [2018-11-23 12:34:13,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {2040#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,866 INFO L273 TraceCheckUtils]: 20: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {2065#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2090#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:13,867 INFO L273 TraceCheckUtils]: 22: Hoare triple {2090#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2021#false} is VALID [2018-11-23 12:34:13,868 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#false} ~i~0 := 0;~j~0 := 0; {2021#false} is VALID [2018-11-23 12:34:13,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {2021#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2021#false} is VALID [2018-11-23 12:34:13,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {2021#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2021#false} is VALID [2018-11-23 12:34:13,869 INFO L256 TraceCheckUtils]: 26: Hoare triple {2021#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2021#false} is VALID [2018-11-23 12:34:13,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {2021#false} ~cond := #in~cond; {2021#false} is VALID [2018-11-23 12:34:13,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#false} assume 0 == ~cond; {2021#false} is VALID [2018-11-23 12:34:13,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:34:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:34:13,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:13,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:13,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 12:34:13,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:13,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:13,964 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:13,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:13,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:13,965 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-11-23 12:34:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,425 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-11-23 12:34:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:14,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 12:34:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:34:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:34:14,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-23 12:34:14,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,483 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:34:14,483 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:34:14,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:34:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-11-23 12:34:14,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:14,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 56 states. [2018-11-23 12:34:14,606 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 56 states. [2018-11-23 12:34:14,606 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 56 states. [2018-11-23 12:34:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,609 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 12:34:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-23 12:34:14,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:14,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:14,610 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 63 states. [2018-11-23 12:34:14,610 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 63 states. [2018-11-23 12:34:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,613 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 12:34:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-23 12:34:14,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:14,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:14,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:14,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:34:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-23 12:34:14,616 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2018-11-23 12:34:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:14,617 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-23 12:34:14,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:34:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:34:14,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:14,618 INFO L402 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:14,618 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:14,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:14,618 INFO L82 PathProgramCache]: Analyzing trace with hash 245144760, now seen corresponding path program 7 times [2018-11-23 12:34:14,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:14,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:14,625 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:14,625 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:14,626 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:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:14,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:15,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {2481#true} call ULTIMATE.init(); {2481#true} is VALID [2018-11-23 12:34:15,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {2481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2481#true} is VALID [2018-11-23 12:34:15,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {2481#true} assume true; {2481#true} is VALID [2018-11-23 12:34:15,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2481#true} {2481#true} #73#return; {2481#true} is VALID [2018-11-23 12:34:15,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {2481#true} call #t~ret2 := main(); {2481#true} is VALID [2018-11-23 12:34:15,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {2481#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2501#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:15,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {2501#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2505#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:15,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {2505#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2509#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:15,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {2509#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:15,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2517#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:15,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {2517#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2521#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:15,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {2521#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2525#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {2525#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {2482#false} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {2482#false} ~i~0 := 1 + ~i~0; {2482#false} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {2482#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2482#false} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {2482#false} assume !(~j~0 < ~n~0); {2482#false} is VALID [2018-11-23 12:34:15,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {2482#false} ~i~0 := 1 + ~i~0; {2482#false} is VALID [2018-11-23 12:34:15,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {2482#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2482#false} is VALID [2018-11-23 12:34:15,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2482#false} is VALID [2018-11-23 12:34:15,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {2482#false} assume !(~j~0 < ~n~0); {2482#false} is VALID [2018-11-23 12:34:15,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {2482#false} ~i~0 := 1 + ~i~0; {2482#false} is VALID [2018-11-23 12:34:15,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {2482#false} assume !(~i~0 < ~m~0); {2482#false} is VALID [2018-11-23 12:34:15,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {2482#false} ~i~0 := 0;~j~0 := 0; {2482#false} is VALID [2018-11-23 12:34:15,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {2482#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2482#false} is VALID [2018-11-23 12:34:15,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {2482#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2482#false} is VALID [2018-11-23 12:34:15,185 INFO L256 TraceCheckUtils]: 34: Hoare triple {2482#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2482#false} is VALID [2018-11-23 12:34:15,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {2482#false} ~cond := #in~cond; {2482#false} is VALID [2018-11-23 12:34:15,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {2482#false} assume 0 == ~cond; {2482#false} is VALID [2018-11-23 12:34:15,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {2482#false} assume !false; {2482#false} is VALID [2018-11-23 12:34:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 12:34:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:15,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:15,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 12:34:15,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:15,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:15,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:15,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:15,241 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 9 states. [2018-11-23 12:34:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,771 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2018-11-23 12:34:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:34:15,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 12:34:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-23 12:34:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-23 12:34:15,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2018-11-23 12:34:15,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:15,904 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:34:15,904 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:34:15,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:34:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-23 12:34:16,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:16,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2018-11-23 12:34:16,052 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2018-11-23 12:34:16,052 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2018-11-23 12:34:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,055 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 12:34:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-23 12:34:16,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,056 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2018-11-23 12:34:16,057 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2018-11-23 12:34:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,059 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 12:34:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-23 12:34:16,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:16,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:34:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-23 12:34:16,062 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 38 [2018-11-23 12:34:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:16,062 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-23 12:34:16,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-23 12:34:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:34:16,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:16,063 INFO L402 BasicCegarLoop]: trace histogram [18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:16,064 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:16,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash -586510585, now seen corresponding path program 8 times [2018-11-23 12:34:16,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,070 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:16,070 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:16,071 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:16,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:16,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:16,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:16,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:16,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {3021#true} call ULTIMATE.init(); {3021#true} is VALID [2018-11-23 12:34:16,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {3021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3021#true} is VALID [2018-11-23 12:34:16,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {3021#true} assume true; {3021#true} is VALID [2018-11-23 12:34:16,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3021#true} {3021#true} #73#return; {3021#true} is VALID [2018-11-23 12:34:16,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {3021#true} call #t~ret2 := main(); {3021#true} is VALID [2018-11-23 12:34:16,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {3021#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {3041#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:16,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {3041#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3045#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:16,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {3045#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3049#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:16,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {3049#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3053#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:16,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3057#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:16,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {3057#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3061#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:16,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {3061#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3065#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:16,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {3065#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3069#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:34:16,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {3069#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {3022#false} is VALID [2018-11-23 12:34:16,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {3022#false} ~i~0 := 1 + ~i~0; {3022#false} is VALID [2018-11-23 12:34:16,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {3022#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3022#false} is VALID [2018-11-23 12:34:16,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,345 INFO L273 TraceCheckUtils]: 19: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {3022#false} assume !(~j~0 < ~n~0); {3022#false} is VALID [2018-11-23 12:34:16,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {3022#false} ~i~0 := 1 + ~i~0; {3022#false} is VALID [2018-11-23 12:34:16,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {3022#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3022#false} is VALID [2018-11-23 12:34:16,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 29: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {3022#false} assume !(~j~0 < ~n~0); {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {3022#false} ~i~0 := 1 + ~i~0; {3022#false} is VALID [2018-11-23 12:34:16,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {3022#false} assume !(~i~0 < ~m~0); {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {3022#false} ~i~0 := 0;~j~0 := 0; {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {3022#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L273 TraceCheckUtils]: 36: Hoare triple {3022#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L256 TraceCheckUtils]: 37: Hoare triple {3022#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {3022#false} ~cond := #in~cond; {3022#false} is VALID [2018-11-23 12:34:16,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {3022#false} assume 0 == ~cond; {3022#false} is VALID [2018-11-23 12:34:16,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {3022#false} assume !false; {3022#false} is VALID [2018-11-23 12:34:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 101 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-23 12:34:16,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:16,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:34:16,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-23 12:34:16,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:16,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:34:16,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:16,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:34:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:34:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:16,394 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 10 states. [2018-11-23 12:34:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,022 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-11-23 12:34:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:34:17,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-23 12:34:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 12:34:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:34:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 12:34:17,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-23 12:34:17,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:17,236 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:34:17,236 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:34:17,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:34:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:34:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-23 12:34:17,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:17,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 68 states. [2018-11-23 12:34:17,453 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 68 states. [2018-11-23 12:34:17,453 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 68 states. [2018-11-23 12:34:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,455 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-11-23 12:34:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2018-11-23 12:34:17,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,456 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 71 states. [2018-11-23 12:34:17,456 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 71 states. [2018-11-23 12:34:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,458 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-11-23 12:34:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2018-11-23 12:34:17,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:17,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:34:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-23 12:34:17,462 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 41 [2018-11-23 12:34:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:17,462 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-23 12:34:17,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:34:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-23 12:34:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:34:17,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:17,463 INFO L402 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:17,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:17,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1310345640, now seen corresponding path program 9 times [2018-11-23 12:34:17,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:17,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:17,470 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:17,471 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:17,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:17,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:34:17,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:17,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:17,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {3614#true} call ULTIMATE.init(); {3614#true} is VALID [2018-11-23 12:34:17,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {3614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3614#true} is VALID [2018-11-23 12:34:17,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {3614#true} assume true; {3614#true} is VALID [2018-11-23 12:34:17,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3614#true} {3614#true} #73#return; {3614#true} is VALID [2018-11-23 12:34:17,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {3614#true} call #t~ret2 := main(); {3614#true} is VALID [2018-11-23 12:34:17,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {3614#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {3634#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {3634#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {3634#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,986 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3634#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:17,987 INFO L273 TraceCheckUtils]: 26: Hoare triple {3634#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3698#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:17,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {3698#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3702#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:17,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {3702#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3706#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:17,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {3706#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3710#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:17,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {3710#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3714#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:17,992 INFO L273 TraceCheckUtils]: 31: Hoare triple {3714#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3718#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:34:17,993 INFO L273 TraceCheckUtils]: 32: Hoare triple {3718#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3722#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:34:17,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {3722#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3726#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:34:17,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {3726#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {3615#false} is VALID [2018-11-23 12:34:17,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {3615#false} ~i~0 := 1 + ~i~0; {3615#false} is VALID [2018-11-23 12:34:17,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {3615#false} assume !(~i~0 < ~m~0); {3615#false} is VALID [2018-11-23 12:34:17,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {3615#false} ~i~0 := 0;~j~0 := 0; {3615#false} is VALID [2018-11-23 12:34:17,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {3615#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3615#false} is VALID [2018-11-23 12:34:17,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {3615#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3615#false} is VALID [2018-11-23 12:34:17,997 INFO L256 TraceCheckUtils]: 40: Hoare triple {3615#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {3615#false} is VALID [2018-11-23 12:34:17,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {3615#false} ~cond := #in~cond; {3615#false} is VALID [2018-11-23 12:34:17,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {3615#false} assume 0 == ~cond; {3615#false} is VALID [2018-11-23 12:34:17,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {3615#false} assume !false; {3615#false} is VALID [2018-11-23 12:34:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-23 12:34:18,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:18,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:34:18,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-23 12:34:18,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:18,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:34:18,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:18,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:34:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:34:18,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:18,064 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 11 states. [2018-11-23 12:34:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,554 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-23 12:34:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:34:18,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-23 12:34:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:34:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-23 12:34:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:34:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2018-11-23 12:34:18,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2018-11-23 12:34:18,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:18,655 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:34:18,655 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:34:18,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:34:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:34:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-23 12:34:18,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:18,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 74 states. [2018-11-23 12:34:18,816 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 74 states. [2018-11-23 12:34:18,816 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 74 states. [2018-11-23 12:34:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,819 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 12:34:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-23 12:34:18,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,820 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 77 states. [2018-11-23 12:34:18,820 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 77 states. [2018-11-23 12:34:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,823 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 12:34:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-23 12:34:18,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:18,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:34:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-11-23 12:34:18,826 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 44 [2018-11-23 12:34:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:18,826 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-11-23 12:34:18,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:34:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-11-23 12:34:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:34:18,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:18,827 INFO L402 BasicCegarLoop]: trace histogram [24, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:18,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:18,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1035660697, now seen corresponding path program 10 times [2018-11-23 12:34:18,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,835 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:18,835 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:18,835 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:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:35:28,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:35:28,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:28,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:28,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2018-11-23 12:35:28,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {4260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4260#true} is VALID [2018-11-23 12:35:28,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2018-11-23 12:35:28,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #73#return; {4260#true} is VALID [2018-11-23 12:35:28,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret2 := main(); {4260#true} is VALID [2018-11-23 12:35:28,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {4280#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {4314#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {4348#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {4382#(and (<= main_~i~0 3) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:35:28,926 INFO L273 TraceCheckUtils]: 39: Hoare triple {4382#(and (<= main_~i~0 3) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {4261#false} is VALID [2018-11-23 12:35:28,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {4261#false} ~i~0 := 0;~j~0 := 0; {4261#false} is VALID [2018-11-23 12:35:28,927 INFO L273 TraceCheckUtils]: 41: Hoare triple {4261#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4261#false} is VALID [2018-11-23 12:35:28,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {4261#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4261#false} is VALID [2018-11-23 12:35:28,927 INFO L256 TraceCheckUtils]: 43: Hoare triple {4261#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {4261#false} is VALID [2018-11-23 12:35:28,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {4261#false} ~cond := #in~cond; {4261#false} is VALID [2018-11-23 12:35:28,928 INFO L273 TraceCheckUtils]: 45: Hoare triple {4261#false} assume 0 == ~cond; {4261#false} is VALID [2018-11-23 12:35:28,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2018-11-23 12:35:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 12:35:28,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:28,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:35:28,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:35:28,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:28,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:35:28,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:35:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:35:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:28,987 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2018-11-23 12:35:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,785 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2018-11-23 12:35:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:35:29,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:35:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:35:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:35:29,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 12:35:29,839 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:35:29,841 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:35:29,842 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:35:29,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:35:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-11-23 12:35:30,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:30,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 85 states. [2018-11-23 12:35:30,135 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 85 states. [2018-11-23 12:35:30,135 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 85 states. [2018-11-23 12:35:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,138 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-23 12:35:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-23 12:35:30,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,139 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 95 states. [2018-11-23 12:35:30,139 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 95 states. [2018-11-23 12:35:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,142 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-23 12:35:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-23 12:35:30,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:30,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:35:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-11-23 12:35:30,145 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 47 [2018-11-23 12:35:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-11-23 12:35:30,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:35:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-11-23 12:35:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:35:30,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:30,147 INFO L402 BasicCegarLoop]: trace histogram [32, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:30,147 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:30,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1434978667, now seen corresponding path program 11 times [2018-11-23 12:35:30,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,153 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:30,154 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:30,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:30,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:35:35,642 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:35:35,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:35,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:35,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2018-11-23 12:35:35,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {4966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4966#true} is VALID [2018-11-23 12:35:35,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2018-11-23 12:35:35,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #73#return; {4966#true} is VALID [2018-11-23 12:35:35,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret2 := main(); {4966#true} is VALID [2018-11-23 12:35:35,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {4966#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {4986#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {4986#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {4986#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:35,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {4986#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5023#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:35,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {5023#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5027#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:35,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {5027#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5031#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:35,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {5031#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5035#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:35,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {5035#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5039#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:35,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {5039#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5043#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:35,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {5043#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5047#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:35,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {5047#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5051#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:35,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {5051#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5055#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:35,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {5055#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !(~j~0 < ~n~0); {4967#false} is VALID [2018-11-23 12:35:35,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#false} ~i~0 := 1 + ~i~0; {4967#false} is VALID [2018-11-23 12:35:35,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {4967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4967#false} is VALID [2018-11-23 12:35:35,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {4967#false} assume !(~j~0 < ~n~0); {4967#false} is VALID [2018-11-23 12:35:35,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {4967#false} ~i~0 := 1 + ~i~0; {4967#false} is VALID [2018-11-23 12:35:35,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {4967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4967#false} is VALID [2018-11-23 12:35:35,980 INFO L273 TraceCheckUtils]: 40: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,980 INFO L273 TraceCheckUtils]: 41: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,980 INFO L273 TraceCheckUtils]: 42: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4967#false} is VALID [2018-11-23 12:35:35,981 INFO L273 TraceCheckUtils]: 48: Hoare triple {4967#false} assume !(~j~0 < ~n~0); {4967#false} is VALID [2018-11-23 12:35:35,982 INFO L273 TraceCheckUtils]: 49: Hoare triple {4967#false} ~i~0 := 1 + ~i~0; {4967#false} is VALID [2018-11-23 12:35:35,982 INFO L273 TraceCheckUtils]: 50: Hoare triple {4967#false} assume !(~i~0 < ~m~0); {4967#false} is VALID [2018-11-23 12:35:35,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {4967#false} ~i~0 := 0;~j~0 := 0; {4967#false} is VALID [2018-11-23 12:35:35,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {4967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4967#false} is VALID [2018-11-23 12:35:35,982 INFO L273 TraceCheckUtils]: 53: Hoare triple {4967#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4967#false} is VALID [2018-11-23 12:35:35,983 INFO L256 TraceCheckUtils]: 54: Hoare triple {4967#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {4967#false} is VALID [2018-11-23 12:35:35,983 INFO L273 TraceCheckUtils]: 55: Hoare triple {4967#false} ~cond := #in~cond; {4967#false} is VALID [2018-11-23 12:35:35,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {4967#false} assume 0 == ~cond; {4967#false} is VALID [2018-11-23 12:35:35,983 INFO L273 TraceCheckUtils]: 57: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2018-11-23 12:35:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 414 proven. 36 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 12:35:36,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:36,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:35:36,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-23 12:35:36,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:36,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:35:36,043 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:35:36,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:35:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:35:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:35:36,044 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 12 states. [2018-11-23 12:35:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:36,574 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2018-11-23 12:35:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:35:36,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-23 12:35:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:35:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-23 12:35:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:35:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-23 12:35:36,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2018-11-23 12:35:37,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:37,276 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:35:37,277 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:35:37,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:35:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:35:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-23 12:35:37,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:37,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 92 states. [2018-11-23 12:35:37,654 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 92 states. [2018-11-23 12:35:37,654 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 92 states. [2018-11-23 12:35:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:37,657 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-23 12:35:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-11-23 12:35:37,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:37,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:37,658 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 95 states. [2018-11-23 12:35:37,658 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 95 states. [2018-11-23 12:35:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:37,660 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-23 12:35:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-11-23 12:35:37,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:37,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:37,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:37,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:35:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-11-23 12:35:37,664 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 58 [2018-11-23 12:35:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:37,664 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-11-23 12:35:37,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:35:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-11-23 12:35:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:35:37,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:37,665 INFO L402 BasicCegarLoop]: trace histogram [36, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:37,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:37,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -965207001, now seen corresponding path program 12 times [2018-11-23 12:35:37,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:37,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:37,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:37,672 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:37,672 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:37,672 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:35:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:35:38,873 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-23 12:35:38,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:38,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:39,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {5789#true} call ULTIMATE.init(); {5789#true} is VALID [2018-11-23 12:35:39,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {5789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5789#true} is VALID [2018-11-23 12:35:39,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {5789#true} assume true; {5789#true} is VALID [2018-11-23 12:35:39,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5789#true} {5789#true} #73#return; {5789#true} is VALID [2018-11-23 12:35:39,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {5789#true} call #t~ret2 := main(); {5789#true} is VALID [2018-11-23 12:35:39,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {5789#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {5809#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {5809#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {5809#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:39,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {5809#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5849#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:39,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {5849#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5853#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:39,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {5853#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5857#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:39,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {5857#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5861#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:39,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {5861#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5865#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:39,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {5865#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5869#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:39,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {5869#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5873#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:39,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {5873#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5877#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:39,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {5877#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5881#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:39,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {5881#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5885#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:35:39,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {5885#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !(~j~0 < ~n~0); {5790#false} is VALID [2018-11-23 12:35:39,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {5790#false} ~i~0 := 1 + ~i~0; {5790#false} is VALID [2018-11-23 12:35:39,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {5790#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5790#false} is VALID [2018-11-23 12:35:39,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {5790#false} assume !(~j~0 < ~n~0); {5790#false} is VALID [2018-11-23 12:35:39,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {5790#false} ~i~0 := 1 + ~i~0; {5790#false} is VALID [2018-11-23 12:35:39,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {5790#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 43: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 47: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 49: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 51: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 52: Hoare triple {5790#false} assume !(~j~0 < ~n~0); {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 53: Hoare triple {5790#false} ~i~0 := 1 + ~i~0; {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 54: Hoare triple {5790#false} assume !(~i~0 < ~m~0); {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {5790#false} ~i~0 := 0;~j~0 := 0; {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {5790#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5790#false} is VALID [2018-11-23 12:35:39,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {5790#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5790#false} is VALID [2018-11-23 12:35:39,205 INFO L256 TraceCheckUtils]: 58: Hoare triple {5790#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {5790#false} is VALID [2018-11-23 12:35:39,205 INFO L273 TraceCheckUtils]: 59: Hoare triple {5790#false} ~cond := #in~cond; {5790#false} is VALID [2018-11-23 12:35:39,205 INFO L273 TraceCheckUtils]: 60: Hoare triple {5790#false} assume 0 == ~cond; {5790#false} is VALID [2018-11-23 12:35:39,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {5790#false} assume !false; {5790#false} is VALID [2018-11-23 12:35:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 509 proven. 45 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:35:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:39,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:35:39,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:35:39,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:39,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:35:39,276 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:35:39,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:35:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:35:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:35:39,277 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 13 states. [2018-11-23 12:35:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:40,042 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2018-11-23 12:35:40,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:35:40,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:35:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:35:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 12:35:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:35:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 12:35:40,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-23 12:35:40,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:40,459 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:35:40,459 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 12:35:40,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:35:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 12:35:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-11-23 12:35:40,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:40,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 99 states. [2018-11-23 12:35:40,672 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 99 states. [2018-11-23 12:35:40,672 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 99 states. [2018-11-23 12:35:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:40,675 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-11-23 12:35:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2018-11-23 12:35:40,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:40,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:40,676 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 102 states. [2018-11-23 12:35:40,676 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 102 states. [2018-11-23 12:35:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:40,679 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-11-23 12:35:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2018-11-23 12:35:40,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:40,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:40,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:40,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:35:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-11-23 12:35:40,683 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 62 [2018-11-23 12:35:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-11-23 12:35:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:35:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-23 12:35:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:35:40,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:40,684 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:40,684 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:40,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2005868693, now seen corresponding path program 13 times [2018-11-23 12:35:40,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:40,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,691 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:40,691 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:40,692 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:35:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:40,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:41,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {6676#true} call ULTIMATE.init(); {6676#true} is VALID [2018-11-23 12:35:41,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {6676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6676#true} is VALID [2018-11-23 12:35:41,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {6676#true} assume true; {6676#true} is VALID [2018-11-23 12:35:41,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6676#true} {6676#true} #73#return; {6676#true} is VALID [2018-11-23 12:35:41,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {6676#true} call #t~ret2 := main(); {6676#true} is VALID [2018-11-23 12:35:41,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {6676#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {6696#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:41,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {6696#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {6700#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:41,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {6700#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6704#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:41,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {6704#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6708#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:41,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {6708#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6712#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:41,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {6712#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6716#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:41,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {6716#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6720#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:41,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {6720#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6724#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:41,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {6724#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6728#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:41,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {6728#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6732#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:41,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {6732#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6736#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:35:41,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {6736#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6740#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:41,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {6740#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {6677#false} is VALID [2018-11-23 12:35:41,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {6677#false} ~i~0 := 1 + ~i~0; {6677#false} is VALID [2018-11-23 12:35:41,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {6677#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6677#false} is VALID [2018-11-23 12:35:41,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {6677#false} assume !(~j~0 < ~n~0); {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {6677#false} ~i~0 := 1 + ~i~0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {6677#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {6677#false} assume !(~j~0 < ~n~0); {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {6677#false} ~i~0 := 1 + ~i~0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {6677#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 53: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {6677#false} assume !(~j~0 < ~n~0); {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {6677#false} ~i~0 := 1 + ~i~0; {6677#false} is VALID [2018-11-23 12:35:41,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {6677#false} assume !(~i~0 < ~m~0); {6677#false} is VALID [2018-11-23 12:35:41,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {6677#false} ~i~0 := 0;~j~0 := 0; {6677#false} is VALID [2018-11-23 12:35:41,621 INFO L273 TraceCheckUtils]: 60: Hoare triple {6677#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6677#false} is VALID [2018-11-23 12:35:41,621 INFO L273 TraceCheckUtils]: 61: Hoare triple {6677#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6677#false} is VALID [2018-11-23 12:35:41,621 INFO L256 TraceCheckUtils]: 62: Hoare triple {6677#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {6677#false} is VALID [2018-11-23 12:35:41,621 INFO L273 TraceCheckUtils]: 63: Hoare triple {6677#false} ~cond := #in~cond; {6677#false} is VALID [2018-11-23 12:35:41,622 INFO L273 TraceCheckUtils]: 64: Hoare triple {6677#false} assume 0 == ~cond; {6677#false} is VALID [2018-11-23 12:35:41,622 INFO L273 TraceCheckUtils]: 65: Hoare triple {6677#false} assume !false; {6677#false} is VALID [2018-11-23 12:35:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 367 proven. 55 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-11-23 12:35:41,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:41,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 12:35:41,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-23 12:35:41,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:41,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:35:41,671 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:35:41,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:35:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:35:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:35:41,672 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 14 states. [2018-11-23 12:35:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:42,608 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-11-23 12:35:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:35:42,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-23 12:35:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:35:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2018-11-23 12:35:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:35:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2018-11-23 12:35:42,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2018-11-23 12:35:43,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:43,189 INFO L225 Difference]: With dead ends: 190 [2018-11-23 12:35:43,189 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:35:43,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:35:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:35:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-23 12:35:43,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:43,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 106 states. [2018-11-23 12:35:43,556 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 106 states. [2018-11-23 12:35:43,556 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 106 states. [2018-11-23 12:35:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:43,560 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-11-23 12:35:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-11-23 12:35:43,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:43,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:43,562 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 109 states. [2018-11-23 12:35:43,562 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 109 states. [2018-11-23 12:35:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:43,565 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-11-23 12:35:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-11-23 12:35:43,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:43,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:43,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:43,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:35:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2018-11-23 12:35:43,570 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 66 [2018-11-23 12:35:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:43,570 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2018-11-23 12:35:43,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:35:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2018-11-23 12:35:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:35:43,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:43,571 INFO L402 BasicCegarLoop]: trace histogram [44, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:43,572 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:43,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1996946393, now seen corresponding path program 14 times [2018-11-23 12:35:43,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:43,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:43,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:43,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:43,579 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:43,580 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:43,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:43,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:43,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:35:43,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:43,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:44,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {7627#true} call ULTIMATE.init(); {7627#true} is VALID [2018-11-23 12:35:44,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {7627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7627#true} is VALID [2018-11-23 12:35:44,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {7627#true} assume true; {7627#true} is VALID [2018-11-23 12:35:44,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7627#true} {7627#true} #73#return; {7627#true} is VALID [2018-11-23 12:35:44,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {7627#true} call #t~ret2 := main(); {7627#true} is VALID [2018-11-23 12:35:44,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {7627#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {7647#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:44,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {7647#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7651#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:44,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {7651#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:44,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {7655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7659#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:44,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {7659#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7663#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:44,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {7663#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7667#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:44,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {7667#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7671#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:44,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {7671#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7675#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:44,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {7675#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7679#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:44,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {7679#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7683#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:44,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {7683#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7687#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:35:44,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {7687#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7691#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:44,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {7691#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7695#(and (<= 1500 main_~n~0) (<= main_~j~0 11))} is VALID [2018-11-23 12:35:44,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {7695#(and (<= 1500 main_~n~0) (<= main_~j~0 11))} assume !(~j~0 < ~n~0); {7628#false} is VALID [2018-11-23 12:35:44,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {7628#false} ~i~0 := 1 + ~i~0; {7628#false} is VALID [2018-11-23 12:35:44,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {7628#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7628#false} is VALID [2018-11-23 12:35:44,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {7628#false} assume !(~j~0 < ~n~0); {7628#false} is VALID [2018-11-23 12:35:44,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {7628#false} ~i~0 := 1 + ~i~0; {7628#false} is VALID [2018-11-23 12:35:44,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {7628#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7628#false} is VALID [2018-11-23 12:35:44,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 37: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {7628#false} assume !(~j~0 < ~n~0); {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {7628#false} ~i~0 := 1 + ~i~0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {7628#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 50: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 54: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 55: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 56: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 58: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,316 INFO L273 TraceCheckUtils]: 59: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {7628#false} assume !(~j~0 < ~n~0); {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 61: Hoare triple {7628#false} ~i~0 := 1 + ~i~0; {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 62: Hoare triple {7628#false} assume !(~i~0 < ~m~0); {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 63: Hoare triple {7628#false} ~i~0 := 0;~j~0 := 0; {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 64: Hoare triple {7628#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 65: Hoare triple {7628#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L256 TraceCheckUtils]: 66: Hoare triple {7628#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {7628#false} is VALID [2018-11-23 12:35:44,317 INFO L273 TraceCheckUtils]: 67: Hoare triple {7628#false} ~cond := #in~cond; {7628#false} is VALID [2018-11-23 12:35:44,318 INFO L273 TraceCheckUtils]: 68: Hoare triple {7628#false} assume 0 == ~cond; {7628#false} is VALID [2018-11-23 12:35:44,318 INFO L273 TraceCheckUtils]: 69: Hoare triple {7628#false} assume !false; {7628#false} is VALID [2018-11-23 12:35:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 436 proven. 66 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-11-23 12:35:44,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:44,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-23 12:35:44,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:35:44,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:44,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:35:44,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:44,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:35:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:35:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:35:44,402 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 15 states. [2018-11-23 12:35:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:45,661 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2018-11-23 12:35:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:35:45,661 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-11-23 12:35:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:35:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 106 transitions. [2018-11-23 12:35:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:35:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 106 transitions. [2018-11-23 12:35:45,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 106 transitions. [2018-11-23 12:35:46,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:46,606 INFO L225 Difference]: With dead ends: 203 [2018-11-23 12:35:46,606 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:35:46,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:35:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:35:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-11-23 12:35:46,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:46,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 113 states. [2018-11-23 12:35:46,842 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 113 states. [2018-11-23 12:35:46,842 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 113 states. [2018-11-23 12:35:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:46,848 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2018-11-23 12:35:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-11-23 12:35:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:46,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:46,849 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 116 states. [2018-11-23 12:35:46,849 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 116 states. [2018-11-23 12:35:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:46,854 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2018-11-23 12:35:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-11-23 12:35:46,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:46,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:46,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:46,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:35:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-23 12:35:46,859 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 70 [2018-11-23 12:35:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:46,859 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-23 12:35:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:35:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-11-23 12:35:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:35:46,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:46,861 INFO L402 BasicCegarLoop]: trace histogram [48, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:46,861 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:46,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -675965589, now seen corresponding path program 15 times [2018-11-23 12:35:46,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:46,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:46,868 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:46,868 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:46,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:35:48,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 12:35:48,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:48,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:48,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {8642#true} call ULTIMATE.init(); {8642#true} is VALID [2018-11-23 12:35:48,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {8642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8642#true} is VALID [2018-11-23 12:35:48,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {8642#true} assume true; {8642#true} is VALID [2018-11-23 12:35:48,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8642#true} {8642#true} #73#return; {8642#true} is VALID [2018-11-23 12:35:48,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {8642#true} call #t~ret2 := main(); {8642#true} is VALID [2018-11-23 12:35:48,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {8642#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {8662#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {8662#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {8662#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {8662#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,675 INFO L273 TraceCheckUtils]: 41: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,690 INFO L273 TraceCheckUtils]: 43: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,690 INFO L273 TraceCheckUtils]: 44: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,691 INFO L273 TraceCheckUtils]: 45: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,691 INFO L273 TraceCheckUtils]: 46: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,691 INFO L273 TraceCheckUtils]: 47: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,691 INFO L273 TraceCheckUtils]: 48: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,692 INFO L273 TraceCheckUtils]: 49: Hoare triple {8662#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {8662#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {8662#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:35:48,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {8662#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8801#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:48,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {8801#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8805#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:35:48,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {8805#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8809#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:48,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {8809#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8813#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:35:48,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {8813#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8817#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:35:48,697 INFO L273 TraceCheckUtils]: 56: Hoare triple {8817#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8821#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:48,698 INFO L273 TraceCheckUtils]: 57: Hoare triple {8821#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8825#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:35:48,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {8825#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8829#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:35:48,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {8829#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8833#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:35:48,702 INFO L273 TraceCheckUtils]: 60: Hoare triple {8833#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8837#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:35:48,703 INFO L273 TraceCheckUtils]: 61: Hoare triple {8837#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8841#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:35:48,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {8841#(and (<= main_~j~0 10) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8845#(and (<= 1500 main_~n~0) (<= main_~j~0 11))} is VALID [2018-11-23 12:35:48,705 INFO L273 TraceCheckUtils]: 63: Hoare triple {8845#(and (<= 1500 main_~n~0) (<= main_~j~0 11))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8849#(and (<= 1500 main_~n~0) (<= main_~j~0 12))} is VALID [2018-11-23 12:35:48,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {8849#(and (<= 1500 main_~n~0) (<= main_~j~0 12))} assume !(~j~0 < ~n~0); {8643#false} is VALID [2018-11-23 12:35:48,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {8643#false} ~i~0 := 1 + ~i~0; {8643#false} is VALID [2018-11-23 12:35:48,706 INFO L273 TraceCheckUtils]: 66: Hoare triple {8643#false} assume !(~i~0 < ~m~0); {8643#false} is VALID [2018-11-23 12:35:48,707 INFO L273 TraceCheckUtils]: 67: Hoare triple {8643#false} ~i~0 := 0;~j~0 := 0; {8643#false} is VALID [2018-11-23 12:35:48,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {8643#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8643#false} is VALID [2018-11-23 12:35:48,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {8643#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8643#false} is VALID [2018-11-23 12:35:48,708 INFO L256 TraceCheckUtils]: 70: Hoare triple {8643#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {8643#false} is VALID [2018-11-23 12:35:48,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {8643#false} ~cond := #in~cond; {8643#false} is VALID [2018-11-23 12:35:48,708 INFO L273 TraceCheckUtils]: 72: Hoare triple {8643#false} assume 0 == ~cond; {8643#false} is VALID [2018-11-23 12:35:48,708 INFO L273 TraceCheckUtils]: 73: Hoare triple {8643#false} assume !false; {8643#false} is VALID [2018-11-23 12:35:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 514 proven. 78 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-11-23 12:35:48,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:48,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-23 12:35:48,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-23 12:35:48,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:48,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:35:48,769 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:35:48,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:35:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:35:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:35:48,771 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 16 states. [2018-11-23 12:35:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:49,720 INFO L93 Difference]: Finished difference Result 216 states and 256 transitions. [2018-11-23 12:35:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:35:49,720 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-23 12:35:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:35:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2018-11-23 12:35:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:35:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2018-11-23 12:35:49,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 111 transitions. [2018-11-23 12:35:49,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:49,903 INFO L225 Difference]: With dead ends: 216 [2018-11-23 12:35:49,903 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:35:49,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:35:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:35:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-11-23 12:35:50,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:50,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 120 states. [2018-11-23 12:35:50,167 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 120 states. [2018-11-23 12:35:50,168 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 120 states. [2018-11-23 12:35:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:50,172 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-11-23 12:35:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-11-23 12:35:50,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:50,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:50,173 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 123 states. [2018-11-23 12:35:50,173 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 123 states. [2018-11-23 12:35:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:50,176 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-11-23 12:35:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-11-23 12:35:50,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:50,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:50,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:50,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:35:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-11-23 12:35:50,181 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 74 [2018-11-23 12:35:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:50,181 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-11-23 12:35:50,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:35:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-11-23 12:35:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:35:50,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:50,182 INFO L402 BasicCegarLoop]: trace histogram [52, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:50,182 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:50,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1850772519, now seen corresponding path program 16 times [2018-11-23 12:35:50,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:50,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:50,189 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:50,189 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:50,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST