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-18e5b2d-m [2018-11-18 23:26:57,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:26:57,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:26:57,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:26:57,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:26:57,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:26:57,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:26:57,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:26:57,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:26:57,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:26:57,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:26:57,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:26:57,291 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:26:57,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:26:57,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:26:57,294 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:26:57,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:26:57,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:26:57,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:26:57,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:26:57,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:26:57,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:26:57,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:26:57,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:26:57,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:26:57,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:26:57,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:26:57,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:26:57,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:26:57,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:26:57,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:26:57,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:26:57,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:26:57,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:26:57,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:26:57,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:26:57,315 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-18 23:26:57,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:26:57,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:26:57,332 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:26:57,332 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:26:57,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:26:57,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:26:57,333 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:26:57,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:26:57,334 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:26:57,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:26:57,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:26:57,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:26:57,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:26:57,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:26:57,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:26:57,335 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:26:57,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:26:57,336 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:26:57,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:26:57,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:26:57,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:26:57,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:26:57,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:26:57,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:26:57,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:26:57,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:26:57,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:26:57,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:26:57,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:26:57,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:26:57,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:26:57,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:26:57,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:26:57,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:26:57,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:26:57,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:26:57,415 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-18 23:26:57,482 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4881d5788/45dfdd6ab1c0420abb4f741d0253d80d/FLAGdc6c5c502 [2018-11-18 23:26:57,933 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:26:57,934 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/rev-2-n-u_true-unreach-call.i [2018-11-18 23:26:57,941 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4881d5788/45dfdd6ab1c0420abb4f741d0253d80d/FLAGdc6c5c502 [2018-11-18 23:26:58,303 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4881d5788/45dfdd6ab1c0420abb4f741d0253d80d [2018-11-18 23:26:58,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:26:58,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:26:58,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:26:58,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:26:58,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:26:58,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48222046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58, skipping insertion in model container [2018-11-18 23:26:58,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:26:58,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:26:58,606 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:26:58,611 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:26:58,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:26:58,667 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:26:58,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58 WrapperNode [2018-11-18 23:26:58,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:26:58,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:26:58,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:26:58,669 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:26:58,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (1/1) ... [2018-11-18 23:26:58,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:26:58,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:26:58,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:26:58,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:26:58,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (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-18 23:26:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:26:58,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:26:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:26:58,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:26:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:26:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:26:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:26:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:26:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:26:59,586 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:26:59,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:26:59 BoogieIcfgContainer [2018-11-18 23:26:59,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:26:59,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:26:59,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:26:59,592 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:26:59,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:26:58" (1/3) ... [2018-11-18 23:26:59,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607d553a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:26:59, skipping insertion in model container [2018-11-18 23:26:59,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:26:58" (2/3) ... [2018-11-18 23:26:59,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607d553a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:26:59, skipping insertion in model container [2018-11-18 23:26:59,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:26:59" (3/3) ... [2018-11-18 23:26:59,596 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-2-n-u_true-unreach-call.i [2018-11-18 23:26:59,606 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:26:59,615 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:26:59,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:26:59,664 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:26:59,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:26:59,665 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:26:59,665 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:26:59,665 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:26:59,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:26:59,666 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:26:59,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:26:59,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:26:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-18 23:26:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:26:59,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:26:59,696 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-18 23:26:59,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:26:59,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:26:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash -439935169, now seen corresponding path program 1 times [2018-11-18 23:26:59,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:26:59,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:26:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:26:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:26:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:26:59,789 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:26:59,789 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:26:59,789 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-18 23:26:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:26:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:26:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:26:59,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:00,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-18 23:27:00,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-18 23:27:00,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-18 23:27:00,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-18 23:27:00,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2018-11-18 23:27:00,050 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {39#true} is VALID [2018-11-18 23:27:00,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-18 23:27:00,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-18 23:27:00,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-18 23:27:00,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-18 23:27:00,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:27:00,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {40#false} is VALID [2018-11-18 23:27:00,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:27:00,053 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {40#false} is VALID [2018-11-18 23:27:00,054 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-18 23:27:00,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-18 23:27:00,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-18 23:27:00,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-18 23:27:00,059 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-18 23:27:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:27:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:27:00,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:27:00,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:00,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:27:00,212 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-18 23:27:00,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:27:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:27:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:27:00,227 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-18 23:27:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:00,372 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-18 23:27:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:27:00,372 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:27:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:27:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:27:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:27:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:27:00,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-18 23:27:00,640 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-18 23:27:00,652 INFO L225 Difference]: With dead ends: 66 [2018-11-18 23:27:00,652 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:27:00,656 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-18 23:27:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:27:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:27:00,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:00,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:27:00,836 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:27:00,836 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:27:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:00,841 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:27:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:27:00,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:00,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:00,843 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:27:00,843 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:27:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:00,848 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:27:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:27:00,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:00,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:00,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:00,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:27:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-18 23:27:00,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-18 23:27:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:00,862 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-18 23:27:00,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:27:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:27:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:27:00,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:00,863 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-18 23:27:00,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:00,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1117238025, now seen corresponding path program 1 times [2018-11-18 23:27:00,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:00,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:00,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:00,883 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:00,883 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:00,883 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-18 23:27:00,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:00,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:01,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-18 23:27:01,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {285#true} is VALID [2018-11-18 23:27:01,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-18 23:27:01,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #105#return; {285#true} is VALID [2018-11-18 23:27:01,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret4 := main(); {285#true} is VALID [2018-11-18 23:27:01,295 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:01,305 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-18 23:27:01,318 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-18 23:27:01,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-18 23:27:01,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:27:01,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} assume !(~i~0 < ~m~0); {286#false} is VALID [2018-11-18 23:27:01,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-18 23:27:01,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:27:01,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {286#false} is VALID [2018-11-18 23:27:01,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:27:01,321 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {286#false} is VALID [2018-11-18 23:27:01,322 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-18 23:27:01,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2018-11-18 23:27:01,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume 0 == ~cond; {286#false} is VALID [2018-11-18 23:27:01,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-18 23:27:01,329 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-18 23:27:01,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:27:01,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:27:01,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:27:01,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:01,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:27:01,442 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-18 23:27:01,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:27:01,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:27:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:27:01,444 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-18 23:27:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:01,859 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 23:27:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:27:01,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:27:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:27:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:27:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:27:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:27:01,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-18 23:27:02,081 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-18 23:27:02,084 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:27:02,084 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 23:27:02,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:27:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 23:27:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-18 23:27:02,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:02,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2018-11-18 23:27:02,121 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2018-11-18 23:27:02,122 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2018-11-18 23:27:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:02,125 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 23:27:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 23:27:02,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:02,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:02,126 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2018-11-18 23:27:02,126 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2018-11-18 23:27:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:02,129 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 23:27:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 23:27:02,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:02,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:02,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:02,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:27:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-18 23:27:02,134 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-11-18 23:27:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-18 23:27:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:27:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-18 23:27:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:27:02,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:02,136 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-18 23:27:02,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:02,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1388242926, now seen corresponding path program 1 times [2018-11-18 23:27:02,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:02,145 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:02,145 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:02,145 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-18 23:27:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:02,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:02,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-18 23:27:02,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-18 23:27:02,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-18 23:27:02,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #105#return; {541#true} is VALID [2018-11-18 23:27:02,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret4 := main(); {541#true} is VALID [2018-11-18 23:27:02,371 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {561#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:02,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {561#(<= 1500 main_~n~0)} assume true; {561#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:02,372 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-18 23:27:02,373 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-18 23:27:02,373 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-18 23:27:02,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#false} ~i~0 := 1 + ~i~0; {542#false} is VALID [2018-11-18 23:27:02,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:27:02,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-18 23:27:02,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-18 23:27:02,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:27:02,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-18 23:27:02,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-18 23:27:02,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:27:02,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {542#false} is VALID [2018-11-18 23:27:02,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:27:02,378 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {542#false} is VALID [2018-11-18 23:27:02,378 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-18 23:27:02,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-18 23:27:02,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2018-11-18 23:27:02,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-18 23:27:02,382 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-18 23:27:02,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:27:02,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:27:02,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:27:02,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:02,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:27:02,461 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-18 23:27:02,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:27:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:27:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:27:02,462 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-18 23:27:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:02,727 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-18 23:27:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:27:02,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:27:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:27:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:27:02,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-18 23:27:02,897 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-18 23:27:02,899 INFO L225 Difference]: With dead ends: 71 [2018-11-18 23:27:02,899 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 23:27:02,900 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-18 23:27:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 23:27:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-18 23:27:02,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:02,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 39 states. [2018-11-18 23:27:02,947 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 39 states. [2018-11-18 23:27:02,947 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 39 states. [2018-11-18 23:27:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:02,951 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 23:27:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 23:27:02,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:02,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:02,953 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 46 states. [2018-11-18 23:27:02,953 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 46 states. [2018-11-18 23:27:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:02,956 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 23:27:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 23:27:02,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:02,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:02,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:02,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 23:27:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 23:27:02,960 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-11-18 23:27:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:02,961 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 23:27:02,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:27:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 23:27:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 23:27:02,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:02,962 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-18 23:27:02,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:02,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash -248566036, now seen corresponding path program 1 times [2018-11-18 23:27:02,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:02,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:02,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:02,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:02,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:02,971 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:02,971 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:02,971 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-18 23:27:02,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:03,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:03,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-18 23:27:03,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-18 23:27:03,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-18 23:27:03,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #105#return; {864#true} is VALID [2018-11-18 23:27:03,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret4 := main(); {864#true} is VALID [2018-11-18 23:27:03,193 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {884#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:03,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#(<= 1500 main_~n~0)} assume true; {884#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:03,194 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-18 23:27:03,195 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-18 23:27:03,196 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:27:03,197 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-18 23:27:03,198 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-18 23:27:03,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#false} ~i~0 := 1 + ~i~0; {865#false} is VALID [2018-11-18 23:27:03,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:27:03,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-18 23:27:03,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-18 23:27:03,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:27:03,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-18 23:27:03,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-18 23:27:03,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:27:03,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {865#false} is VALID [2018-11-18 23:27:03,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:27:03,202 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {865#false} is VALID [2018-11-18 23:27:03,202 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-18 23:27:03,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2018-11-18 23:27:03,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2018-11-18 23:27:03,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-18 23:27:03,205 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-18 23:27:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:27:03,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:27:03,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 23:27:03,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:03,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:27:03,256 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-18 23:27:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:27:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:27:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:27:03,258 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-18 23:27:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:03,580 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-11-18 23:27:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:27:03,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 23:27:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:27:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-18 23:27:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:27:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-18 23:27:03,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-18 23:27:03,762 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-18 23:27:03,765 INFO L225 Difference]: With dead ends: 85 [2018-11-18 23:27:03,766 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 23:27:03,767 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-18 23:27:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 23:27:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-18 23:27:03,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:03,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-18 23:27:03,825 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-18 23:27:03,825 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-18 23:27:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:03,829 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-18 23:27:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-18 23:27:03,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:03,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:03,832 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-18 23:27:03,832 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-18 23:27:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:03,836 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-18 23:27:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-18 23:27:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:03,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:03,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:03,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 23:27:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-18 23:27:03,840 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2018-11-18 23:27:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:03,841 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-18 23:27:03,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:27:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 23:27:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:27:03,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:03,846 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-18 23:27:03,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:03,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash -235735226, now seen corresponding path program 2 times [2018-11-18 23:27:03,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:03,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:03,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:03,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:03,856 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:03,856 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-18 23:27:03,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:27:03,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:27:03,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:27:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:03,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:03,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-18 23:27:03,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1243#true} is VALID [2018-11-18 23:27:03,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-18 23:27:03,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #105#return; {1243#true} is VALID [2018-11-18 23:27:03,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret4 := main(); {1243#true} is VALID [2018-11-18 23:27:03,994 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:03,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:03,996 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-18 23:27:03,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:03,998 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,002 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,003 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-18 23:27:04,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:27:04,009 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-18 23:27:04,010 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-18 23:27:04,010 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-18 23:27:04,015 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-18 23:27:04,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {1244#false} ~i~0 := 0;~j~0 := 0; {1244#false} is VALID [2018-11-18 23:27:04,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-18 23:27:04,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {1244#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1244#false} is VALID [2018-11-18 23:27:04,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-18 23:27:04,017 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {1244#false} is VALID [2018-11-18 23:27:04,017 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-18 23:27:04,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {1244#false} ~cond := #in~cond; {1244#false} is VALID [2018-11-18 23:27:04,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {1244#false} assume 0 == ~cond; {1244#false} is VALID [2018-11-18 23:27:04,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-18 23:27:04,019 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-18 23:27:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:27:04,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:27:04,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:27:04,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:04,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:27:04,098 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-18 23:27:04,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:27:04,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:27:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:27:04,099 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-18 23:27:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:04,361 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-18 23:27:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:27:04,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:27:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-18 23:27:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-18 23:27:04,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-18 23:27:04,500 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-18 23:27:04,503 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:27:04,503 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 23:27:04,503 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-18 23:27:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 23:27:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2018-11-18 23:27:04,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:04,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 49 states. [2018-11-18 23:27:04,565 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 49 states. [2018-11-18 23:27:04,565 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 49 states. [2018-11-18 23:27:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:04,569 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 23:27:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 23:27:04,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:04,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:04,571 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 76 states. [2018-11-18 23:27:04,571 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 76 states. [2018-11-18 23:27:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:04,575 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 23:27:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 23:27:04,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:04,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:04,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:04,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 23:27:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-18 23:27:04,579 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 29 [2018-11-18 23:27:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:04,579 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-18 23:27:04,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:27:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-18 23:27:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:27:04,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:04,581 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-18 23:27:04,581 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:04,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash -72304729, now seen corresponding path program 1 times [2018-11-18 23:27:04,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:04,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:27:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:04,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:04,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:04,590 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-18 23:27:04,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:04,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:04,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {1691#true} call ULTIMATE.init(); {1691#true} is VALID [2018-11-18 23:27:04,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1691#true} is VALID [2018-11-18 23:27:04,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1691#true} assume true; {1691#true} is VALID [2018-11-18 23:27:04,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1691#true} {1691#true} #105#return; {1691#true} is VALID [2018-11-18 23:27:04,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {1691#true} call #t~ret4 := main(); {1691#true} is VALID [2018-11-18 23:27:04,840 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:04,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {1711#(<= 1500 main_~n~0)} assume true; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:04,842 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-18 23:27:04,843 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-18 23:27:04,848 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:27:04,849 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-18 23:27:04,853 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:27:04,853 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-18 23:27:04,854 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-18 23:27:04,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {1692#false} ~i~0 := 1 + ~i~0; {1692#false} is VALID [2018-11-18 23:27:04,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-18 23:27:04,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-18 23:27:04,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-18 23:27:04,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,856 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {1692#false} is VALID [2018-11-18 23:27:04,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,856 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {1692#false} is VALID [2018-11-18 23:27:04,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {1692#false} assume !(~j~0 < ~n~0); {1692#false} is VALID [2018-11-18 23:27:04,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {1692#false} ~i~0 := 1 + ~i~0; {1692#false} is VALID [2018-11-18 23:27:04,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-18 23:27:04,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-18 23:27:04,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-18 23:27:04,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:27:04,858 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {1692#false} is VALID [2018-11-18 23:27:04,858 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-18 23:27:04,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {1692#false} ~cond := #in~cond; {1692#false} is VALID [2018-11-18 23:27:04,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {1692#false} assume 0 == ~cond; {1692#false} is VALID [2018-11-18 23:27:04,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2018-11-18 23:27:04,862 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-18 23:27:04,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:27:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:27:04,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-18 23:27:04,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:04,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:27:04,923 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-18 23:27:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:27:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:27:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:27:04,925 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 6 states. [2018-11-18 23:27:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:05,440 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-18 23:27:05,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:27:05,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-18 23:27:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:27:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-18 23:27:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:27:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-18 23:27:05,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2018-11-18 23:27:05,585 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-18 23:27:05,588 INFO L225 Difference]: With dead ends: 102 [2018-11-18 23:27:05,588 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 23:27:05,589 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-18 23:27:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 23:27:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-18 23:27:05,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:05,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-18 23:27:05,687 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-18 23:27:05,687 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-18 23:27:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:05,691 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-18 23:27:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-18 23:27:05,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:05,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:05,691 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-18 23:27:05,692 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-18 23:27:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:05,695 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-18 23:27:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-18 23:27:05,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:05,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:05,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:05,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 23:27:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-18 23:27:05,699 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 38 [2018-11-18 23:27:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:05,699 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 23:27:05,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:27:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 23:27:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 23:27:05,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:05,700 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-18 23:27:05,701 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:05,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2073021427, now seen corresponding path program 2 times [2018-11-18 23:27:05,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:05,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:27:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:05,709 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:05,710 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:05,710 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-18 23:27:05,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:27:05,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:27:05,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:27:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:05,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:06,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {2159#true} call ULTIMATE.init(); {2159#true} is VALID [2018-11-18 23:27:06,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {2159#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2159#true} is VALID [2018-11-18 23:27:06,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {2159#true} assume true; {2159#true} is VALID [2018-11-18 23:27:06,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2159#true} {2159#true} #105#return; {2159#true} is VALID [2018-11-18 23:27:06,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {2159#true} call #t~ret4 := main(); {2159#true} is VALID [2018-11-18 23:27:06,199 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:06,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {2179#(<= 1500 main_~n~0)} assume true; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:27:06,200 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-18 23:27:06,201 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-18 23:27:06,202 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:27:06,203 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-18 23:27:06,204 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:27:06,205 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-18 23:27:06,207 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:27:06,207 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-18 23:27:06,208 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-18 23:27:06,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {2160#false} ~i~0 := 1 + ~i~0; {2160#false} is VALID [2018-11-18 23:27:06,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-18 23:27:06,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-18 23:27:06,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-18 23:27:06,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,211 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:27:06,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,211 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:27:06,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,212 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:27:06,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {2160#false} assume !(~j~0 < ~n~0); {2160#false} is VALID [2018-11-18 23:27:06,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {2160#false} ~i~0 := 1 + ~i~0; {2160#false} is VALID [2018-11-18 23:27:06,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-18 23:27:06,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-18 23:27:06,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-18 23:27:06,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:27:06,215 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {2160#false} is VALID [2018-11-18 23:27:06,215 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-18 23:27:06,216 INFO L273 TraceCheckUtils]: 39: Hoare triple {2160#false} ~cond := #in~cond; {2160#false} is VALID [2018-11-18 23:27:06,216 INFO L273 TraceCheckUtils]: 40: Hoare triple {2160#false} assume 0 == ~cond; {2160#false} is VALID [2018-11-18 23:27:06,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2018-11-18 23:27:06,219 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-18 23:27:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:27:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 23:27:06,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 23:27:06,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:06,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:27:06,324 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-18 23:27:06,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:27:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:27:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:27:06,325 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-11-18 23:27:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:07,295 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-18 23:27:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:27:07,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 23:27:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:27:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-18 23:27:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:27:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-18 23:27:07,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2018-11-18 23:27:07,438 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-18 23:27:07,439 INFO L225 Difference]: With dead ends: 118 [2018-11-18 23:27:07,440 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 23:27:07,443 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-18 23:27:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 23:27:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-18 23:27:07,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:07,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 65 states. [2018-11-18 23:27:07,717 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 65 states. [2018-11-18 23:27:07,717 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 65 states. [2018-11-18 23:27:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:07,721 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-18 23:27:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-18 23:27:07,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:07,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:07,722 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 69 states. [2018-11-18 23:27:07,722 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 69 states. [2018-11-18 23:27:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:07,725 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-18 23:27:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-18 23:27:07,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:07,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:07,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:07,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 23:27:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-18 23:27:07,728 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 42 [2018-11-18 23:27:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:07,729 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-18 23:27:07,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:27:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-18 23:27:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 23:27:07,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:07,730 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-18 23:27:07,730 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:07,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1880122817, now seen corresponding path program 3 times [2018-11-18 23:27:07,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:07,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:27:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:07,737 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:07,737 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:07,737 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-18 23:27:07,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:27:07,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 23:27:07,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:27:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:07,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:07,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-18 23:27:07,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2692#true} is VALID [2018-11-18 23:27:07,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-18 23:27:07,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2692#true} {2692#true} #105#return; {2692#true} is VALID [2018-11-18 23:27:07,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {2692#true} call #t~ret4 := main(); {2692#true} is VALID [2018-11-18 23:27:07,908 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(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,909 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-18 23:27:07,914 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-18 23:27:07,914 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-18 23:27:07,915 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,916 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-18 23:27:07,916 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,918 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-18 23:27:07,919 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,920 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-18 23:27:07,926 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,928 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-18 23:27:07,930 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-18 23:27:07,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:27:07,932 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-18 23:27:07,934 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-18 23:27:07,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-18 23:27:07,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-18 23:27:07,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,935 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:27:07,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,935 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:27:07,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,936 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:27:07,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,936 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) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem1;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:27:07,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {2693#false} assume !(~j~0 < ~n~0); {2693#false} is VALID [2018-11-18 23:27:07,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {2693#false} ~i~0 := 1 + ~i~0; {2693#false} is VALID [2018-11-18 23:27:07,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {2693#false} assume !(~i~0 < ~m~0); {2693#false} is VALID [2018-11-18 23:27:07,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-18 23:27:07,938 INFO L273 TraceCheckUtils]: 38: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-18 23:27:07,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:27:07,938 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 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~m~0 - ~i~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~j~0 - 1), 4); {2693#false} is VALID [2018-11-18 23:27:07,939 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-18 23:27:07,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-18 23:27:07,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {2693#false} assume 0 == ~cond; {2693#false} is VALID [2018-11-18 23:27:07,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-18 23:27:07,941 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-18 23:27:07,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:27:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-18 23:27:07,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 23:27:07,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:27:07,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:27:08,037 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-18 23:27:08,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:27:08,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:27:08,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:27:08,038 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-11-18 23:27:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:08,353 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-18 23:27:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:27:08,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 23:27:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:27:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 23:27:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:27:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 23:27:08,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-18 23:27:08,440 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-18 23:27:08,442 INFO L225 Difference]: With dead ends: 133 [2018-11-18 23:27:08,443 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 23:27:08,444 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-18 23:27:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 23:27:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-18 23:27:08,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:27:08,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 78 states. [2018-11-18 23:27:08,582 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 78 states. [2018-11-18 23:27:08,582 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 78 states. [2018-11-18 23:27:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:08,586 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-18 23:27:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 23:27:08,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:08,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:08,587 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 89 states. [2018-11-18 23:27:08,587 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 89 states. [2018-11-18 23:27:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:27:08,591 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-18 23:27:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 23:27:08,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:27:08,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:27:08,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:27:08,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:27:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 23:27:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-18 23:27:08,595 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 46 [2018-11-18 23:27:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:27:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-18 23:27:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:27:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-18 23:27:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 23:27:08,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:27:08,596 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-18 23:27:08,597 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:27:08,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:27:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 264780802, now seen corresponding path program 4 times [2018-11-18 23:27:08,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:27:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:27:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:08,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:27:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:27:08,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:27:08,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:27:08,604 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-18 23:27:08,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:27:08,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:27:08,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:27:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:27:08,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:27:08,970 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:27:08,971 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:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) 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:155) 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-18 23:27:08,976 INFO L168 Benchmark]: Toolchain (without parser) took 10662.90 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 849.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -670.5 MB). Peak memory consumption was 179.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:27:08,978 INFO L168 Benchmark]: CDTParser took 0.25 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-18 23:27:08,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.94 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-18 23:27:08,979 INFO L168 Benchmark]: Boogie Preprocessor took 46.90 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-18 23:27:08,980 INFO L168 Benchmark]: RCFGBuilder took 870.87 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -726.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:27:08,982 INFO L168 Benchmark]: TraceAbstraction took 9387.20 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 191.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:27:08,986 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.25 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. * CACSL2BoogieTranslator took 352.94 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 46.90 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 870.87 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -726.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9387.20 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 191.3 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:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...