java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/rev-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:35:18,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:35:18,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:35:18,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:35:18,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:35:18,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:35:18,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:35:18,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:35:18,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:35:18,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:35:18,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:35:18,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:35:18,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:35:18,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:35:18,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:35:18,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:35:18,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:35:18,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:35:18,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:35:18,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:35:18,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:35:18,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:35:18,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:35:18,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:35:18,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:35:18,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:35:18,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:35:18,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:35:18,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:35:18,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:35:18,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:35:18,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:35:18,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:35:18,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:35:18,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:35:18,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:35:18,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:35:18,294 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:35:18,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:35:18,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:35:18,296 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:35:18,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:35:18,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:35:18,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:35:18,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:35:18,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:35:18,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:35:18,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:35:18,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:35:18,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:35:18,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:35:18,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:35:18,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:35:18,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:35:18,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:35:18,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:35:18,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:35:18,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:35:18,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:35:18,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:35:18,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:35:18,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:35:18,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:35:18,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:35:18,305 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:35:18,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:35:18,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:35:18,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:35:18,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:35:18,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:35:18,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:35:18,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:35:18,392 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:35:18,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/rev-3-u_true-unreach-call.i [2018-11-23 12:35:18,450 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b56622b4/074485a4fc77412abc114409c9d66e43/FLAG9a974c756 [2018-11-23 12:35:18,908 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:35:18,909 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/rev-3-u_true-unreach-call.i [2018-11-23 12:35:18,915 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b56622b4/074485a4fc77412abc114409c9d66e43/FLAG9a974c756 [2018-11-23 12:35:19,257 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b56622b4/074485a4fc77412abc114409c9d66e43 [2018-11-23 12:35:19,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:35:19,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:35:19,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:19,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:35:19,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:35:19,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd86bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19, skipping insertion in model container [2018-11-23 12:35:19,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:35:19,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:35:19,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:19,571 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:35:19,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:19,644 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:35:19,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19 WrapperNode [2018-11-23 12:35:19,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:19,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:19,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:35:19,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:35:19,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:19,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:35:19,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:35:19,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:35:19,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... [2018-11-23 12:35:19,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:35:19,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:35:19,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:35:19,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:35:19,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:35:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:35:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:35:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:35:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:35:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:35:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:35:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:35:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:35:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:35:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:35:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:35:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:35:20,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:35:20,663 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:35:20,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:20 BoogieIcfgContainer [2018-11-23 12:35:20,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:35:20,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:35:20,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:35:20,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:35:20,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:35:19" (1/3) ... [2018-11-23 12:35:20,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f684b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:20, skipping insertion in model container [2018-11-23 12:35:20,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:19" (2/3) ... [2018-11-23 12:35:20,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f684b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:20, skipping insertion in model container [2018-11-23 12:35:20,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:20" (3/3) ... [2018-11-23 12:35:20,672 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-3-u_true-unreach-call.i [2018-11-23 12:35:20,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:35:20,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:35:20,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:35:20,735 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:35:20,735 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:35:20,735 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:35:20,736 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:35:20,736 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:35:20,736 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:35:20,736 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:35:20,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:35:20,737 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:35:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:35:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:35:20,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:20,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:20,765 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:20,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1773460249, now seen corresponding path program 1 times [2018-11-23 12:35:20,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:20,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:20,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:20,856 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:20,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:20,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:20,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:21,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:35:21,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:35:21,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:35:21,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #138#return; {39#true} is VALID [2018-11-23 12:35:21,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2018-11-23 12:35:21,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-23 12:35:21,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:35:21,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:35:21,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:35:21,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:35:21,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:35:21,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-23 12:35:21,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {40#false} is VALID [2018-11-23 12:35:21,168 INFO L256 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {40#false} is VALID [2018-11-23 12:35:21,170 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 12:35:21,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 12:35:21,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:35:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:35:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:35:21,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:35:21,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:21,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:35:21,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:21,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:35:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:35:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:35:21,364 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:35:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:21,598 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2018-11-23 12:35:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:35:21,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:35:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:35:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:35:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:35:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:35:21,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2018-11-23 12:35:22,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:22,155 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:35:22,155 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:35:22,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:35:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:35:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:35:22,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:22,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:35:22,364 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:35:22,365 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:35:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:22,369 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:35:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:35:22,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:22,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:22,371 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:35:22,371 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:35:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:22,375 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:35:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:35:22,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:22,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:22,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:22,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:35:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 12:35:22,382 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2018-11-23 12:35:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:22,382 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 12:35:22,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:35:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:35:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:35:22,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:22,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:22,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1763514787, now seen corresponding path program 1 times [2018-11-23 12:35:22,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:22,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:22,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:22,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:22,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:22,394 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:22,394 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:22,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:22,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:22,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:22,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 12:35:22,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-23 12:35:22,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 12:35:22,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #138#return; {291#true} is VALID [2018-11-23 12:35:22,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2018-11-23 12:35:22,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {311#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:22,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {292#false} is VALID [2018-11-23 12:35:22,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:35:22,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !(~i~0 < ~n~0); {292#false} is VALID [2018-11-23 12:35:22,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:35:22,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:35:22,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {292#false} is VALID [2018-11-23 12:35:22,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {292#false} is VALID [2018-11-23 12:35:22,571 INFO L256 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {292#false} is VALID [2018-11-23 12:35:22,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 12:35:22,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2018-11-23 12:35:22,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 12:35:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:35:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:35:22,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:35:22,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:22,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:35:22,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:22,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:35:22,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:35:22,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:35:22,757 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-11-23 12:35:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:23,130 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-23 12:35:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:35:23,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:35:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:35:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:35:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:35:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:35:23,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:35:23,314 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-23 12:35:23,316 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:35:23,316 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:35:23,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:35:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:35:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:35:23,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:23,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:35:23,368 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:35:23,368 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:35:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:23,372 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:35:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:35:23,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:23,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:23,373 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:35:23,373 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:35:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:23,376 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:35:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:35:23,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:23,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:23,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:23,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:35:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:35:23,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:35:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:23,384 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:35:23,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:35:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:35:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:35:23,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:23,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:23,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:23,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2133227694, now seen corresponding path program 1 times [2018-11-23 12:35:23,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:23,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:23,396 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:23,396 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:23,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:23,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:23,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:23,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-23 12:35:23,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {546#true} is VALID [2018-11-23 12:35:23,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-23 12:35:23,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #138#return; {546#true} is VALID [2018-11-23 12:35:23,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret4 := main(); {546#true} is VALID [2018-11-23 12:35:23,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {566#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:23,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {570#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:23,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {547#false} is VALID [2018-11-23 12:35:23,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#false} ~i~0 := 1 + ~i~0; {547#false} is VALID [2018-11-23 12:35:23,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#false} assume !(~i~0 < ~n~0); {547#false} is VALID [2018-11-23 12:35:23,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:35:23,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#false} assume !(~i~0 < ~n~0); {547#false} is VALID [2018-11-23 12:35:23,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:35:23,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:35:23,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {547#false} is VALID [2018-11-23 12:35:23,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {547#false} is VALID [2018-11-23 12:35:23,569 INFO L256 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {547#false} is VALID [2018-11-23 12:35:23,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2018-11-23 12:35:23,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2018-11-23 12:35:23,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-23 12:35:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:35:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:35:23,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:35:23,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:23,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:23,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:23,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:23,641 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:35:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:24,043 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-23 12:35:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:24,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:35:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:35:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:35:24,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-23 12:35:24,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:24,271 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:35:24,271 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:35:24,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:35:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:35:24,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:24,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:35:24,323 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:35:24,324 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:35:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:24,328 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:35:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:35:24,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:24,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:24,330 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:35:24,330 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:35:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:24,333 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:35:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:35:24,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:24,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:24,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:24,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:35:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 12:35:24,337 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2018-11-23 12:35:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:24,338 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 12:35:24,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:35:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:35:24,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:24,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:24,340 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:24,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1108398309, now seen corresponding path program 1 times [2018-11-23 12:35:24,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:24,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:24,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:24,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:24,348 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:24,348 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:24,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:24,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:24,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:24,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-23 12:35:24,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-23 12:35:24,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-23 12:35:24,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #138#return; {862#true} is VALID [2018-11-23 12:35:24,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret4 := main(); {862#true} is VALID [2018-11-23 12:35:24,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {882#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:24,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {882#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {882#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:24,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {882#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {889#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:35:24,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !(~k~0 < ~n~0); {863#false} is VALID [2018-11-23 12:35:24,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#false} ~j~0 := 1 + ~j~0; {863#false} is VALID [2018-11-23 12:35:24,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#false} assume !(~j~0 < ~n~0); {863#false} is VALID [2018-11-23 12:35:24,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#false} ~i~0 := 1 + ~i~0; {863#false} is VALID [2018-11-23 12:35:24,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#false} assume !(~i~0 < ~n~0); {863#false} is VALID [2018-11-23 12:35:24,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:35:24,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#false} assume !(~i~0 < ~n~0); {863#false} is VALID [2018-11-23 12:35:24,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:35:24,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {863#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:35:24,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {863#false} is VALID [2018-11-23 12:35:24,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {863#false} is VALID [2018-11-23 12:35:24,488 INFO L256 TraceCheckUtils]: 19: Hoare triple {863#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {863#false} is VALID [2018-11-23 12:35:24,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#false} ~cond := #in~cond; {863#false} is VALID [2018-11-23 12:35:24,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {863#false} assume 0 == ~cond; {863#false} is VALID [2018-11-23 12:35:24,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-23 12:35:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:35:24,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:24,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:35:24,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:35:24,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:24,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:24,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:24,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:24,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:24,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:24,534 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2018-11-23 12:35:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:24,902 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 12:35:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:24,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:35:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:35:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:35:24,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2018-11-23 12:35:25,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:25,018 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:35:25,018 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:35:25,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:35:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-23 12:35:25,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:25,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2018-11-23 12:35:25,115 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2018-11-23 12:35:25,115 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2018-11-23 12:35:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:25,118 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:35:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:35:25,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:25,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:25,119 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2018-11-23 12:35:25,120 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2018-11-23 12:35:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:25,123 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:35:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:35:25,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:25,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:25,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:25,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:35:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:35:25,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 23 [2018-11-23 12:35:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:25,127 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:35:25,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:35:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:35:25,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:25,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:25,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:25,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:25,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1602833213, now seen corresponding path program 1 times [2018-11-23 12:35:25,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:25,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:25,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:25,137 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:25,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:25,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:25,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-23 12:35:25,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-23 12:35:25,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-23 12:35:25,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #138#return; {1190#true} is VALID [2018-11-23 12:35:25,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret4 := main(); {1190#true} is VALID [2018-11-23 12:35:25,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1210#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:25,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1210#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:25,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1217#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:35:25,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1221#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:35:25,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {1221#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !(~k~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:35:25,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {1191#false} ~j~0 := 1 + ~j~0; {1191#false} is VALID [2018-11-23 12:35:25,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} assume !(~j~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:35:25,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} ~i~0 := 1 + ~i~0; {1191#false} is VALID [2018-11-23 12:35:25,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !(~i~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:35:25,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:35:25,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume !(~i~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:35:25,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:35:25,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:35:25,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1191#false} is VALID [2018-11-23 12:35:25,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {1191#false} is VALID [2018-11-23 12:35:25,325 INFO L256 TraceCheckUtils]: 20: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1191#false} is VALID [2018-11-23 12:35:25,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-23 12:35:25,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2018-11-23 12:35:25,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-23 12:35:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:35:25,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:35:25,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:35:25,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:25,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:35:25,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:25,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:35:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:35:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:25,374 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:35:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:25,705 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:35:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:35:25,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:35:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:35:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:35:25,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:35:25,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:25,872 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:35:25,872 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:35:25,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:35:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-23 12:35:26,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:26,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 43 states. [2018-11-23 12:35:26,042 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 43 states. [2018-11-23 12:35:26,043 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 43 states. [2018-11-23 12:35:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:26,047 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:35:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:35:26,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:26,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:26,048 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 48 states. [2018-11-23 12:35:26,048 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 48 states. [2018-11-23 12:35:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:26,051 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:35:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:35:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:26,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:26,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:26,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:35:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:35:26,055 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2018-11-23 12:35:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:26,055 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:35:26,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:35:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:35:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:35:26,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:26,057 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:26,057 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:26,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 249553947, now seen corresponding path program 2 times [2018-11-23 12:35:26,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:26,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:26,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:26,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:26,064 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:26,064 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:26,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:26,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:26,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:35:26,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:26,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:26,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2018-11-23 12:35:26,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1556#true} is VALID [2018-11-23 12:35:26,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2018-11-23 12:35:26,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #138#return; {1556#true} is VALID [2018-11-23 12:35:26,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret4 := main(); {1556#true} is VALID [2018-11-23 12:35:26,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1556#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {1576#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {1576#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {1576#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {1576#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {1576#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {1576#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {1576#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {1576#(<= 1000 main_~n~0)} ~i~0 := 1 + ~i~0; {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= 1000 main_~n~0)} assume !(~i~0 < ~n~0); {1576#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:26,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= 1000 main_~n~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1607#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:26,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {1607#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {1557#false} is VALID [2018-11-23 12:35:26,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {1557#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:35:26,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:35:26,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1557#false} is VALID [2018-11-23 12:35:26,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {1557#false} is VALID [2018-11-23 12:35:26,287 INFO L256 TraceCheckUtils]: 21: Hoare triple {1557#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1557#false} is VALID [2018-11-23 12:35:26,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {1557#false} ~cond := #in~cond; {1557#false} is VALID [2018-11-23 12:35:26,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {1557#false} assume 0 == ~cond; {1557#false} is VALID [2018-11-23 12:35:26,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2018-11-23 12:35:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:35:26,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:26,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:35:26,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:35:26,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:26,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:26,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:26,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:26,342 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2018-11-23 12:35:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:26,665 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 12:35:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:26,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:35:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:35:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:35:26,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-23 12:35:26,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:26,793 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:35:26,793 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:35:26,794 INFO L631 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-23 12:35:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:35:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2018-11-23 12:35:26,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:26,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 44 states. [2018-11-23 12:35:26,928 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 44 states. [2018-11-23 12:35:26,928 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 44 states. [2018-11-23 12:35:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:26,931 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:35:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:35:26,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:26,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:26,932 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 70 states. [2018-11-23 12:35:26,933 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 70 states. [2018-11-23 12:35:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:26,936 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:35:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:35:26,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:26,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:26,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:26,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:35:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:35:26,939 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 25 [2018-11-23 12:35:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:26,940 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:35:26,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:35:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:35:26,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:26,941 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:26,941 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:26,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1698801625, now seen corresponding path program 1 times [2018-11-23 12:35:26,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:26,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:26,950 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:26,950 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:26,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:26,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:27,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:27,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2018-11-23 12:35:27,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1988#true} is VALID [2018-11-23 12:35:27,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2018-11-23 12:35:27,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #138#return; {1988#true} is VALID [2018-11-23 12:35:27,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret4 := main(); {1988#true} is VALID [2018-11-23 12:35:27,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {1988#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2008#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:27,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {2008#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2008#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:27,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {2008#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2015#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:35:27,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {2015#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2019#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:35:27,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {2019#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2023#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:35:27,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !(~k~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:35:27,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:35:27,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {1989#false} assume !(~i~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:35:27,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:35:27,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#false} assume !(~k~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:35:27,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:35:27,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {1989#false} assume !(~i~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:35:27,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:35:27,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {1989#false} is VALID [2018-11-23 12:35:27,996 INFO L256 TraceCheckUtils]: 29: Hoare triple {1989#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1989#false} is VALID [2018-11-23 12:35:27,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2018-11-23 12:35:27,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2018-11-23 12:35:27,997 INFO L273 TraceCheckUtils]: 32: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2018-11-23 12:35:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:35:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:35:28,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:35:28,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:28,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:35:28,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:28,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:35:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:35:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:28,061 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 12:35:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:28,848 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2018-11-23 12:35:28,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:35:28,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:35:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:35:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:35:28,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 12:35:28,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:29,001 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:35:29,005 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:35:29,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:35:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 12:35:29,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:29,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 12:35:29,528 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 12:35:29,528 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 12:35:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,531 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:35:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:35:29,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:29,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:29,532 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 12:35:29,532 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 12:35:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,535 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:35:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:35:29,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:29,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:29,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:29,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:35:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-23 12:35:29,538 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 33 [2018-11-23 12:35:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:29,539 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-23 12:35:29,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:35:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:35:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:35:29,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:29,540 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 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-23 12:35:29,540 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:29,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash -602786922, now seen corresponding path program 2 times [2018-11-23 12:35:29,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:29,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:29,548 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:29,548 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:29,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:29,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:35:29,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:29,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:29,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2018-11-23 12:35:29,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {2420#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2420#true} is VALID [2018-11-23 12:35:29,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2018-11-23 12:35:29,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #138#return; {2420#true} is VALID [2018-11-23 12:35:29,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret4 := main(); {2420#true} is VALID [2018-11-23 12:35:29,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2440#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:29,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {2440#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2440#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:29,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {2440#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2447#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:35:29,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {2447#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2451#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:35:29,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {2451#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2455#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:35:29,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2459#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:35:29,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !(~k~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:35:29,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:35:29,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {2421#false} assume !(~i~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:35:29,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:35:29,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2421#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:35:29,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {2421#false} assume !(~k~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:35:29,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:35:29,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {2421#false} assume !(~i~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:35:29,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {2421#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:35:29,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {2421#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {2421#false} is VALID [2018-11-23 12:35:29,764 INFO L256 TraceCheckUtils]: 31: Hoare triple {2421#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2421#false} is VALID [2018-11-23 12:35:29,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {2421#false} ~cond := #in~cond; {2421#false} is VALID [2018-11-23 12:35:29,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {2421#false} assume 0 == ~cond; {2421#false} is VALID [2018-11-23 12:35:29,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2018-11-23 12:35:29,766 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-23 12:35:29,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:29,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:35:29,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:35:29,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:29,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:35:29,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:29,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:35:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:35:29,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:35:29,818 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 7 states. [2018-11-23 12:35:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,234 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-23 12:35:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:35:30,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:35:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:35:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:35:30,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-23 12:35:30,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:30,538 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:35:30,538 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:35:30,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:35:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:35:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-23 12:35:30,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:30,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-23 12:35:30,638 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-23 12:35:30,638 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-23 12:35:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,640 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:35:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:35:30,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-23 12:35:30,641 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-23 12:35:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,644 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:35:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:35:30,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:30,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:35:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-23 12:35:30,647 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 35 [2018-11-23 12:35:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:30,647 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 12:35:30,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:35:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:35:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:35:30,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:30,648 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 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-23 12:35:30,649 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:30,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash -119527047, now seen corresponding path program 3 times [2018-11-23 12:35:30,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:30,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,655 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:30,655 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:30,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:30,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:35:30,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:35:30,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:30,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:30,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {2896#true} call ULTIMATE.init(); {2896#true} is VALID [2018-11-23 12:35:30,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {2896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2896#true} is VALID [2018-11-23 12:35:30,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {2896#true} assume true; {2896#true} is VALID [2018-11-23 12:35:30,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2896#true} {2896#true} #138#return; {2896#true} is VALID [2018-11-23 12:35:30,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {2896#true} call #t~ret4 := main(); {2896#true} is VALID [2018-11-23 12:35:30,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {2896#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {2916#(<= 1000 main_~n~0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {2916#(<= 1000 main_~n~0)} ~j~0 := 1 + ~j~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {2916#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {2916#(<= 1000 main_~n~0)} ~i~0 := 1 + ~i~0; {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2916#(<= 1000 main_~n~0)} assume !(~i~0 < ~n~0); {2916#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {2916#(<= 1000 main_~n~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~k~0 < ~n~0); {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:30,892 INFO L273 TraceCheckUtils]: 27: Hoare triple {2953#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {2984#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:35:30,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {2897#false} is VALID [2018-11-23 12:35:30,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {2897#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:35:30,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {2897#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:35:30,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {2897#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2897#false} is VALID [2018-11-23 12:35:30,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {2897#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {2897#false} is VALID [2018-11-23 12:35:30,894 INFO L256 TraceCheckUtils]: 33: Hoare triple {2897#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2897#false} is VALID [2018-11-23 12:35:30,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {2897#false} ~cond := #in~cond; {2897#false} is VALID [2018-11-23 12:35:30,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {2897#false} assume 0 == ~cond; {2897#false} is VALID [2018-11-23 12:35:30,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {2897#false} assume !false; {2897#false} is VALID [2018-11-23 12:35:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:35:30,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:30,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:35:30,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:35:30,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:30,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:35:30,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:30,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:35:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:35:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:30,958 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-11-23 12:35:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,537 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2018-11-23 12:35:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:35:31,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:35:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:35:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:35:31,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2018-11-23 12:35:31,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:31,704 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:35:31,704 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:35:31,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:35:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2018-11-23 12:35:31,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:31,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 74 states. [2018-11-23 12:35:31,975 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 74 states. [2018-11-23 12:35:31,975 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 74 states. [2018-11-23 12:35:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,981 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:35:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:35:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:31,982 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 128 states. [2018-11-23 12:35:31,982 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 128 states. [2018-11-23 12:35:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,987 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:35:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:35:31,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:31,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:31,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:31,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:35:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-23 12:35:31,991 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 37 [2018-11-23 12:35:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:31,992 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-23 12:35:31,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:35:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-23 12:35:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:35:31,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:31,993 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:31,993 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:31,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1459343723, now seen corresponding path program 4 times [2018-11-23 12:35:31,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:31,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:32,000 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:32,000 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:32,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:35:32,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:35:32,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:32,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:32,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {3668#true} call ULTIMATE.init(); {3668#true} is VALID [2018-11-23 12:35:32,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {3668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3668#true} is VALID [2018-11-23 12:35:32,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {3668#true} assume true; {3668#true} is VALID [2018-11-23 12:35:32,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3668#true} {3668#true} #138#return; {3668#true} is VALID [2018-11-23 12:35:32,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {3668#true} call #t~ret4 := main(); {3668#true} is VALID [2018-11-23 12:35:32,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {3668#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3668#true} is VALID [2018-11-23 12:35:32,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {3668#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {3691#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {3691#(<= main_~j~0 0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {3691#(<= main_~j~0 0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {3691#(<= main_~j~0 0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {3691#(<= main_~j~0 0)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {3691#(<= main_~j~0 0)} assume !(~k~0 < ~n~0); {3691#(<= main_~j~0 0)} is VALID [2018-11-23 12:35:32,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {3691#(<= main_~j~0 0)} ~j~0 := 1 + ~j~0; {3713#(<= main_~j~0 1)} is VALID [2018-11-23 12:35:32,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {3713#(<= main_~j~0 1)} assume !(~j~0 < ~n~0); {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {3717#(<= main_~n~0 1)} ~i~0 := 1 + ~i~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~k~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 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {3717#(<= main_~n~0 1)} assume !(~k~0 < ~n~0); {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {3717#(<= main_~n~0 1)} ~j~0 := 1 + ~j~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {3717#(<= main_~n~0 1)} assume !(~j~0 < ~n~0); {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {3717#(<= main_~n~0 1)} ~i~0 := 1 + ~i~0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {3717#(<= main_~n~0 1)} assume !(~i~0 < ~n~0); {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {3717#(<= main_~n~0 1)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3717#(<= main_~n~0 1)} is VALID [2018-11-23 12:35:32,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {3717#(<= main_~n~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3763#(and (<= 0 main_~k~0) (<= main_~n~0 1))} is VALID [2018-11-23 12:35:32,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {3763#(and (<= 0 main_~k~0) (<= main_~n~0 1))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3767#(and (<= main_~n~0 1) (<= 1 main_~k~0))} is VALID [2018-11-23 12:35:32,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {3767#(and (<= main_~n~0 1) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {3669#false} assume !(~k~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:35:32,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {3669#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {3669#false} assume !(~k~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:35:32,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {3669#false} assume !(~i~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {3669#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:35:32,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:35:32,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {3669#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (4 * ~n~0 * ~n~0) + (~n~0 - ~j~0 - 1) * (4 * ~n~0) + 4 * (~n~0 - ~k~0 - 1), 4); {3669#false} is VALID [2018-11-23 12:35:32,262 INFO L256 TraceCheckUtils]: 53: Hoare triple {3669#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3669#false} is VALID [2018-11-23 12:35:32,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {3669#false} ~cond := #in~cond; {3669#false} is VALID [2018-11-23 12:35:32,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {3669#false} assume 0 == ~cond; {3669#false} is VALID [2018-11-23 12:35:32,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {3669#false} assume !false; {3669#false} is VALID [2018-11-23 12:35:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:35:32,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:32,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:35:32,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-23 12:35:32,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:32,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:35:32,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:32,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:35:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:35:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:35:32,336 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 7 states. [2018-11-23 12:35:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:33,634 INFO L93 Difference]: Finished difference Result 241 states and 295 transitions. [2018-11-23 12:35:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:35:33,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-23 12:35:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-11-23 12:35:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-11-23 12:35:33,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 132 transitions. [2018-11-23 12:35:33,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:33,826 INFO L225 Difference]: With dead ends: 241 [2018-11-23 12:35:33,826 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 12:35:33,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:35:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 12:35:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2018-11-23 12:35:34,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:34,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 125 states. [2018-11-23 12:35:34,577 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 125 states. [2018-11-23 12:35:34,577 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 125 states. [2018-11-23 12:35:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:34,583 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2018-11-23 12:35:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2018-11-23 12:35:34,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:34,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:34,584 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 165 states. [2018-11-23 12:35:34,584 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 165 states. [2018-11-23 12:35:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:34,590 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2018-11-23 12:35:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2018-11-23 12:35:34,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:34,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:34,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:34,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:35:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2018-11-23 12:35:34,595 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 57 [2018-11-23 12:35:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:34,595 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2018-11-23 12:35:34,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:35:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2018-11-23 12:35:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:35:34,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:34,597 INFO L402 BasicCegarLoop]: trace histogram [16, 12, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:34,597 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:34,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1727359831, now seen corresponding path program 5 times [2018-11-23 12:35:34,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:34,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:34,606 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:34,606 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:34,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:35:34,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1