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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/rev-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:12:53,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:12:53,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:12:53,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:12:53,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:12:53,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:12:53,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:12:53,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:12:53,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:12:53,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:12:53,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:12:53,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:12:53,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:12:53,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:12:53,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:12:53,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:12:53,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:12:53,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:12:53,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:12:53,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:12:53,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:12:53,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:12:53,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:12:53,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:12:53,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:12:53,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:12:53,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:12:53,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:12:53,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:12:53,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:12:53,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:12:53,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:12:53,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:12:53,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:12:53,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:12:53,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:12:53,378 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-14 17:12:53,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:12:53,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:12:53,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:12:53,405 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:12:53,409 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:12:53,409 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:12:53,410 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:12:53,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:12:53,410 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:12:53,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:12:53,411 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:12:53,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:12:53,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:12:53,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:12:53,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:12:53,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:12:53,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:12:53,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:12:53,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:12:53,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:12:53,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:12:53,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:12:53,415 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:12:53,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:12:53,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:12:53,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:12:53,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:12:53,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:12:53,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:12:53,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:12:53,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/rev-2-n-u_true-unreach-call.i [2018-11-14 17:12:53,544 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dad3d92a/41cb46d4bf3b414b915f3a4c6ec684f4/FLAGd92a8c92f [2018-11-14 17:12:53,975 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:12:53,975 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/rev-2-n-u_true-unreach-call.i [2018-11-14 17:12:53,982 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dad3d92a/41cb46d4bf3b414b915f3a4c6ec684f4/FLAGd92a8c92f [2018-11-14 17:12:53,997 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dad3d92a/41cb46d4bf3b414b915f3a4c6ec684f4 [2018-11-14 17:12:54,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:12:54,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:12:54,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:12:54,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:12:54,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:12:54,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:12:53" (1/1) ... [2018-11-14 17:12:54,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65124975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54, skipping insertion in model container [2018-11-14 17:12:54,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:12:53" (1/1) ... [2018-11-14 17:12:54,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:12:54,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:12:54,279 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:12:54,285 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:12:54,317 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:12:54,339 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:12:54,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54 WrapperNode [2018-11-14 17:12:54,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:12:54,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:12:54,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:12:54,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:12:54,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (1/1) ... [2018-11-14 17:12:54,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:12:54,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:12:54,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:12:54,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:12:54,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (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-14 17:12:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:12:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:12:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:12:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:12:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:12:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:12:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:12:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:12:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:12:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:12:55,310 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:12:55,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:12:55 BoogieIcfgContainer [2018-11-14 17:12:55,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:12:55,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:12:55,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:12:55,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:12:55,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:12:53" (1/3) ... [2018-11-14 17:12:55,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703c739a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:12:55, skipping insertion in model container [2018-11-14 17:12:55,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:54" (2/3) ... [2018-11-14 17:12:55,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703c739a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:12:55, skipping insertion in model container [2018-11-14 17:12:55,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:12:55" (3/3) ... [2018-11-14 17:12:55,319 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-2-n-u_true-unreach-call.i [2018-11-14 17:12:55,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:12:55,336 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:12:55,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:12:55,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:12:55,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:12:55,385 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:12:55,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:12:55,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:12:55,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:12:55,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:12:55,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:12:55,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:12:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 17:12:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:12:55,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:55,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:55,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:55,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash -439935169, now seen corresponding path program 1 times [2018-11-14 17:12:55,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:55,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:55,501 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:55,502 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:55,502 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-14 17:12:55,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:55,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:55,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 17:12:55,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-14 17:12:55,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 17:12:55,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-14 17:12:55,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2018-11-14 17:12:55,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {39#true} is VALID [2018-11-14 17:12:55,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 17:12:55,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-14 17:12:55,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 17:12:55,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-14 17:12:55,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:12:55,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {40#false} is VALID [2018-11-14 17:12:55,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:12:55,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {40#false} is VALID [2018-11-14 17:12:55,765 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {40#false} is VALID [2018-11-14 17:12:55,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 17:12:55,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~cond == 0; {40#false} is VALID [2018-11-14 17:12:55,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 17:12:55,773 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-14 17:12:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:12:55,815 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:12:55,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:55,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:12:55,890 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-14 17:12:55,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:12:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:12:55,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:12:55,904 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 17:12:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:56,047 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-14 17:12:56,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:12:56,048 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:12:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:12:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-14 17:12:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:12:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-14 17:12:56,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-14 17:12:56,347 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-14 17:12:56,360 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:12:56,360 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:12:56,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:12:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:12:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:12:56,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:56,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:12:56,458 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:12:56,459 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:12:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:56,465 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 17:12:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:12:56,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:56,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:56,467 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:12:56,468 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:12:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:56,474 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 17:12:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:12:56,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:56,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:56,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:56,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:12:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 17:12:56,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-14 17:12:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:56,492 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 17:12:56,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:12:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:12:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:12:56,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:56,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:56,496 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:56,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1117238025, now seen corresponding path program 1 times [2018-11-14 17:12:56,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:56,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:56,510 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:56,510 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:56,510 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-14 17:12:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:56,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:56,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-14 17:12:56,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {285#true} is VALID [2018-11-14 17:12:56,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-14 17:12:56,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #105#return; {285#true} is VALID [2018-11-14 17:12:56,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret4 := main(); {285#true} is VALID [2018-11-14 17:12:56,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:12:56,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:12:56,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {286#false} is VALID [2018-11-14 17:12:56,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-14 17:12:56,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 17:12:56,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} assume !(~i~0 < ~m~0); {286#false} is VALID [2018-11-14 17:12:56,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-14 17:12:56,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 17:12:56,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {286#false} is VALID [2018-11-14 17:12:56,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 17:12:56,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {286#false} is VALID [2018-11-14 17:12:56,992 INFO L256 TraceCheckUtils]: 16: Hoare triple {286#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {286#false} is VALID [2018-11-14 17:12:56,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2018-11-14 17:12:56,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume ~cond == 0; {286#false} is VALID [2018-11-14 17:12:56,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-14 17:12:56,995 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-14 17:12:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:57,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:12:57,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:12:57,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:57,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:12:57,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:57,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:12:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:12:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:12:57,193 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 17:12:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:57,474 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-14 17:12:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:12:57,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:12:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:12:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 17:12:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:12:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 17:12:57,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-14 17:12:57,646 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-14 17:12:57,649 INFO L225 Difference]: With dead ends: 56 [2018-11-14 17:12:57,649 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:12:57,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-14 17:12:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:12:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-14 17:12:57,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:57,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2018-11-14 17:12:57,667 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2018-11-14 17:12:57,667 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2018-11-14 17:12:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:57,671 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-14 17:12:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 17:12:57,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:57,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:57,672 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2018-11-14 17:12:57,672 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2018-11-14 17:12:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:57,675 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-14 17:12:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 17:12:57,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:57,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:57,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:57,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:12:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 17:12:57,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-11-14 17:12:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:57,680 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 17:12:57,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:12:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 17:12:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:12:57,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:57,682 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:57,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:57,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1388242926, now seen corresponding path program 1 times [2018-11-14 17:12:57,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:57,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:57,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:57,691 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:57,691 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:57,691 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-14 17:12:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:57,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:57,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-14 17:12:57,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-14 17:12:57,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 17:12:57,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #105#return; {541#true} is VALID [2018-11-14 17:12:57,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret4 := main(); {541#true} is VALID [2018-11-14 17:12:57,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {561#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:57,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {561#(<= 1500 main_~n~0)} assume true; {561#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:57,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {561#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:57,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:57,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {542#false} is VALID [2018-11-14 17:12:57,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#false} ~i~0 := ~i~0 + 1; {542#false} is VALID [2018-11-14 17:12:57,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 17:12:57,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-14 17:12:57,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-14 17:12:57,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 17:12:57,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-14 17:12:57,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-14 17:12:57,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 17:12:57,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {542#false} is VALID [2018-11-14 17:12:57,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 17:12:57,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {542#false} is VALID [2018-11-14 17:12:57,884 INFO L256 TraceCheckUtils]: 21: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {542#false} is VALID [2018-11-14 17:12:57,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-14 17:12:57,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#false} assume ~cond == 0; {542#false} is VALID [2018-11-14 17:12:57,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-14 17:12:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:12:57,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:12:57,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:12:57,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:57,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:12:57,978 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-14 17:12:57,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:12:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:12:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:12:57,979 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-14 17:12:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:58,256 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-14 17:12:58,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:12:58,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:12:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:12:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-14 17:12:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:12:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-14 17:12:58,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-14 17:12:58,395 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-14 17:12:58,398 INFO L225 Difference]: With dead ends: 71 [2018-11-14 17:12:58,398 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:12:58,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-14 17:12:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:12:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-14 17:12:58,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:58,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 39 states. [2018-11-14 17:12:58,427 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 39 states. [2018-11-14 17:12:58,427 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 39 states. [2018-11-14 17:12:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:58,432 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 17:12:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 17:12:58,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:58,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:58,433 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 46 states. [2018-11-14 17:12:58,434 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 46 states. [2018-11-14 17:12:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:58,437 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 17:12:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 17:12:58,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:58,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:58,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:58,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:12:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:12:58,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-11-14 17:12:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:58,441 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:12:58,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:12:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:12:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:12:58,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:58,443 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:58,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:58,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash -248566036, now seen corresponding path program 1 times [2018-11-14 17:12:58,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:58,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:58,454 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:58,455 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:58,455 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-14 17:12:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:58,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:58,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-14 17:12:58,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-14 17:12:58,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-14 17:12:58,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #105#return; {864#true} is VALID [2018-11-14 17:12:58,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret4 := main(); {864#true} is VALID [2018-11-14 17:12:58,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {864#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {884#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:58,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#(<= 1500 main_~n~0)} assume true; {884#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:58,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:58,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:58,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:12:58,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:12:58,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {865#false} is VALID [2018-11-14 17:12:58,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#false} ~i~0 := ~i~0 + 1; {865#false} is VALID [2018-11-14 17:12:58,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 17:12:58,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-14 17:12:58,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-14 17:12:58,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 17:12:58,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-14 17:12:58,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-14 17:12:58,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 17:12:58,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {865#false} is VALID [2018-11-14 17:12:58,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 17:12:58,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {865#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {865#false} is VALID [2018-11-14 17:12:58,689 INFO L256 TraceCheckUtils]: 23: Hoare triple {865#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {865#false} is VALID [2018-11-14 17:12:58,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2018-11-14 17:12:58,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {865#false} assume ~cond == 0; {865#false} is VALID [2018-11-14 17:12:58,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-14 17:12:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:12:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:12:58,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:12:58,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:12:58,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:58,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:12:58,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:58,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:12:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:12:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:12:58,741 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-14 17:12:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,089 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-11-14 17:12:59,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:12:59,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:12:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:12:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 17:12:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:12:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 17:12:59,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-14 17:12:59,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:59,308 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:12:59,309 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:12:59,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-14 17:12:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:12:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-14 17:12:59,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:59,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-14 17:12:59,372 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-14 17:12:59,372 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-14 17:12:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,377 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:12:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:12:59,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:59,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:59,379 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-14 17:12:59,379 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-14 17:12:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,383 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:12:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:12:59,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:59,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:59,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:59,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:12:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 17:12:59,388 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2018-11-14 17:12:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:59,388 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 17:12:59,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:12:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:12:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:12:59,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:59,390 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:59,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:59,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash -235735226, now seen corresponding path program 2 times [2018-11-14 17:12:59,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:59,399 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:59,399 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:59,399 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-14 17:12:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:12:59,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:12:59,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:12:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:59,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:59,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-14 17:12:59,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1243#true} is VALID [2018-11-14 17:12:59,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-14 17:12:59,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #105#return; {1243#true} is VALID [2018-11-14 17:12:59,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret4 := main(); {1243#true} is VALID [2018-11-14 17:12:59,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#(<= 1000 main_~m~0)} ~i~0 := ~i~0 + 1; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1263#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:12:59,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:12:59,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:12:59,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1244#false} is VALID [2018-11-14 17:12:59,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {1244#false} ~i~0 := 0;~j~0 := 0; {1244#false} is VALID [2018-11-14 17:12:59,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-14 17:12:59,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {1244#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1244#false} is VALID [2018-11-14 17:12:59,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-14 17:12:59,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {1244#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {1244#false} is VALID [2018-11-14 17:12:59,570 INFO L256 TraceCheckUtils]: 25: Hoare triple {1244#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1244#false} is VALID [2018-11-14 17:12:59,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {1244#false} ~cond := #in~cond; {1244#false} is VALID [2018-11-14 17:12:59,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {1244#false} assume ~cond == 0; {1244#false} is VALID [2018-11-14 17:12:59,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-14 17:12:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:12:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:12:59,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 17:12:59,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:59,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:12:59,664 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-14 17:12:59,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:12:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:12:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:12:59,665 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-14 17:12:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,958 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-14 17:12:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:12:59,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 17:12:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:12:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-14 17:12:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:12:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-14 17:12:59,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-14 17:13:00,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:00,118 INFO L225 Difference]: With dead ends: 96 [2018-11-14 17:13:00,118 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:13:00,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-14 17:13:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:13:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2018-11-14 17:13:00,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:00,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 49 states. [2018-11-14 17:13:00,178 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 49 states. [2018-11-14 17:13:00,178 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 49 states. [2018-11-14 17:13:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:00,183 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:13:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:13:00,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:00,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:00,185 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 76 states. [2018-11-14 17:13:00,185 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 76 states. [2018-11-14 17:13:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:00,189 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:13:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:13:00,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:00,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:00,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:00,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:13:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-14 17:13:00,194 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 29 [2018-11-14 17:13:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:00,194 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-14 17:13:00,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 17:13:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:13:00,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:00,196 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:00,196 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:00,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -72304729, now seen corresponding path program 1 times [2018-11-14 17:13:00,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:00,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:00,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:00,204 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:00,204 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:00,205 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-14 17:13:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:00,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:00,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {1691#true} call ULTIMATE.init(); {1691#true} is VALID [2018-11-14 17:13:00,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {1691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1691#true} is VALID [2018-11-14 17:13:00,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {1691#true} assume true; {1691#true} is VALID [2018-11-14 17:13:00,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1691#true} {1691#true} #105#return; {1691#true} is VALID [2018-11-14 17:13:00,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {1691#true} call #t~ret4 := main(); {1691#true} is VALID [2018-11-14 17:13:00,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {1691#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:13:00,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {1711#(<= 1500 main_~n~0)} assume true; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:13:00,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {1711#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:00,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:00,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:13:00,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:13:00,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:00,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:00,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1692#false} is VALID [2018-11-14 17:13:00,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {1692#false} ~i~0 := ~i~0 + 1; {1692#false} is VALID [2018-11-14 17:13:00,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-14 17:13:00,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-14 17:13:00,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-14 17:13:00,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {1692#false} is VALID [2018-11-14 17:13:00,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {1692#false} is VALID [2018-11-14 17:13:00,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {1692#false} assume !(~j~0 < ~n~0); {1692#false} is VALID [2018-11-14 17:13:00,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {1692#false} ~i~0 := ~i~0 + 1; {1692#false} is VALID [2018-11-14 17:13:00,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-14 17:13:00,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-14 17:13:00,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-14 17:13:00,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-14 17:13:00,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {1692#false} is VALID [2018-11-14 17:13:00,455 INFO L256 TraceCheckUtils]: 34: Hoare triple {1692#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1692#false} is VALID [2018-11-14 17:13:00,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {1692#false} ~cond := #in~cond; {1692#false} is VALID [2018-11-14 17:13:00,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {1692#false} assume ~cond == 0; {1692#false} is VALID [2018-11-14 17:13:00,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2018-11-14 17:13:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:13:00,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:00,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:13:00,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-14 17:13:00,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:00,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:13:00,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:00,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:13:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:13:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:13:00,526 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 6 states. [2018-11-14 17:13:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,055 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-14 17:13:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:13:01,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-14 17:13:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-14 17:13:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-14 17:13:01,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2018-11-14 17:13:01,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:01,208 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:13:01,208 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:13:01,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-14 17:13:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:13:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-14 17:13:01,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:01,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-14 17:13:01,320 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-14 17:13:01,320 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-14 17:13:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,325 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 17:13:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 17:13:01,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,326 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-14 17:13:01,326 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-14 17:13:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,329 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 17:13:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 17:13:01,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:01,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:13:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-14 17:13:01,333 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 38 [2018-11-14 17:13:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:01,334 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-14 17:13:01,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:13:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-14 17:13:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:13:01,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:01,335 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:01,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:01,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2073021427, now seen corresponding path program 2 times [2018-11-14 17:13:01,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:01,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:01,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:01,344 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-14 17:13:01,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:13:01,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:13:01,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:01,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:01,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {2159#true} call ULTIMATE.init(); {2159#true} is VALID [2018-11-14 17:13:01,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {2159#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2159#true} is VALID [2018-11-14 17:13:01,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {2159#true} assume true; {2159#true} is VALID [2018-11-14 17:13:01,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2159#true} {2159#true} #105#return; {2159#true} is VALID [2018-11-14 17:13:01,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {2159#true} call #t~ret4 := main(); {2159#true} is VALID [2018-11-14 17:13:01,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {2159#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:13:01,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {2179#(<= 1500 main_~n~0)} assume true; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:13:01,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {2179#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:01,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:01,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:13:01,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:13:01,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:01,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:01,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:13:01,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:13:01,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {2160#false} is VALID [2018-11-14 17:13:01,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {2160#false} ~i~0 := ~i~0 + 1; {2160#false} is VALID [2018-11-14 17:13:01,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-14 17:13:01,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-14 17:13:01,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-14 17:13:01,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2160#false} is VALID [2018-11-14 17:13:01,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2160#false} is VALID [2018-11-14 17:13:01,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2160#false} is VALID [2018-11-14 17:13:01,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {2160#false} assume !(~j~0 < ~n~0); {2160#false} is VALID [2018-11-14 17:13:01,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {2160#false} ~i~0 := ~i~0 + 1; {2160#false} is VALID [2018-11-14 17:13:01,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-14 17:13:01,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-14 17:13:01,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-14 17:13:01,873 INFO L273 TraceCheckUtils]: 36: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-14 17:13:01,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {2160#false} is VALID [2018-11-14 17:13:01,874 INFO L256 TraceCheckUtils]: 38: Hoare triple {2160#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2160#false} is VALID [2018-11-14 17:13:01,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {2160#false} ~cond := #in~cond; {2160#false} is VALID [2018-11-14 17:13:01,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {2160#false} assume ~cond == 0; {2160#false} is VALID [2018-11-14 17:13:01,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2018-11-14 17:13:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:13:01,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:01,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:13:01,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-14 17:13:01,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:01,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:13:01,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:01,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:13:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:13:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:01,988 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-11-14 17:13:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:02,864 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-14 17:13:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:13:02,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-14 17:13:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-14 17:13:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-14 17:13:02,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2018-11-14 17:13:03,176 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-14 17:13:03,178 INFO L225 Difference]: With dead ends: 118 [2018-11-14 17:13:03,178 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:13:03,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:13:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-14 17:13:03,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:03,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 65 states. [2018-11-14 17:13:03,412 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 65 states. [2018-11-14 17:13:03,412 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 65 states. [2018-11-14 17:13:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,416 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-14 17:13:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-14 17:13:03,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:03,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:03,417 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 69 states. [2018-11-14 17:13:03,418 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 69 states. [2018-11-14 17:13:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,421 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-14 17:13:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-14 17:13:03,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:03,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:03,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:03,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:13:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-14 17:13:03,425 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 42 [2018-11-14 17:13:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:03,425 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-14 17:13:03,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:13:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 17:13:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:13:03,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:03,429 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:03,430 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1880122817, now seen corresponding path program 3 times [2018-11-14 17:13:03,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:03,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:03,442 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:03,444 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:03,445 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-14 17:13:03,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:13:03,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:13:03,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:03,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:03,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-14 17:13:03,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2692#true} is VALID [2018-11-14 17:13:03,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-14 17:13:03,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2692#true} {2692#true} #105#return; {2692#true} is VALID [2018-11-14 17:13:03,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {2692#true} call #t~ret4 := main(); {2692#true} is VALID [2018-11-14 17:13:03,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {2692#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:13:03,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2693#false} is VALID [2018-11-14 17:13:03,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 24: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 26: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,659 INFO L273 TraceCheckUtils]: 27: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 28: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 29: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem1;~j~0 := ~j~0 + 1; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {2693#false} assume !(~j~0 < ~n~0); {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {2693#false} ~i~0 := ~i~0 + 1; {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {2693#false} assume !(~i~0 < ~m~0); {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 38: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L273 TraceCheckUtils]: 41: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (~n~0 * 4) + (~n~0 - ~j~0 - 1) * 4, 4); {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L256 TraceCheckUtils]: 42: Hoare triple {2693#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {2693#false} assume ~cond == 0; {2693#false} is VALID [2018-11-14 17:13:03,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-14 17:13:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-14 17:13:03,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:03,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 17:13:03,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 17:13:03,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:03,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:03,763 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-14 17:13:03,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:03,765 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-11-14 17:13:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,978 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-14 17:13:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:03,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 17:13:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-14 17:13:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-14 17:13:03,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-14 17:13:04,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:04,074 INFO L225 Difference]: With dead ends: 133 [2018-11-14 17:13:04,074 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 17:13:04,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-14 17:13:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 17:13:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-14 17:13:04,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:04,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 78 states. [2018-11-14 17:13:04,217 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 78 states. [2018-11-14 17:13:04,217 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 78 states. [2018-11-14 17:13:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,222 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-14 17:13:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-14 17:13:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,223 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 89 states. [2018-11-14 17:13:04,223 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 89 states. [2018-11-14 17:13:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,225 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-14 17:13:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-14 17:13:04,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:04,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 17:13:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-14 17:13:04,229 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 46 [2018-11-14 17:13:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:04,229 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-14 17:13:04,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-14 17:13:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 17:13:04,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:04,230 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:04,230 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:04,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 264780802, now seen corresponding path program 4 times [2018-11-14 17:13:04,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,237 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:04,237 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:04,237 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-14 17:13:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:13:04,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:13:04,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:04,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:04,590 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:04,591 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:13:04,597 INFO L168 Benchmark]: Toolchain (without parser) took 10588.54 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 883.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:13:04,599 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:13:04,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:13:04,600 INFO L168 Benchmark]: Boogie Preprocessor took 67.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:13:04,600 INFO L168 Benchmark]: RCFGBuilder took 902.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:13:04,601 INFO L168 Benchmark]: TraceAbstraction took 9283.73 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 145.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 25.2 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:13:04,605 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 902.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9283.73 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 145.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 25.2 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...