java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:11:21,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:11:21,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:11:22,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:11:22,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:11:22,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:11:22,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:11:22,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:11:22,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:11:22,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:11:22,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:11:22,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:11:22,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:11:22,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:11:22,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:11:22,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:11:22,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:11:22,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:11:22,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:11:22,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:11:22,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:11:22,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:11:22,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:11:22,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:11:22,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:11:22,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:11:22,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:11:22,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:11:22,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:11:22,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:11:22,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:11:22,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:11:22,063 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:11:22,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:11:22,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:11:22,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:11:22,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:11:22,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:11:22,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:11:22,092 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:11:22,092 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:11:22,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:11:22,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:11:22,093 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:11:22,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:11:22,093 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:11:22,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:11:22,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:11:22,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:11:22,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:11:22,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:11:22,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:11:22,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:11:22,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:11:22,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:11:22,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:11:22,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:11:22,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:11:22,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:11:22,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:11:22,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:11:22,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:11:22,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:11:22,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:11:22,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:11:22,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:11:22,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:11:22,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:11:22,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:11:22,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:11:22,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:11:22,189 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:11:22,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-3-n-u_true-unreach-call.i [2018-11-14 17:11:22,257 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fbaa51f/6571b0331d95426e821e3ef5a2c58225/FLAG9d2cd00ef [2018-11-14 17:11:22,743 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:11:22,744 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-3-n-u_true-unreach-call.i [2018-11-14 17:11:22,751 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fbaa51f/6571b0331d95426e821e3ef5a2c58225/FLAG9d2cd00ef [2018-11-14 17:11:22,776 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fbaa51f/6571b0331d95426e821e3ef5a2c58225 [2018-11-14 17:11:22,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:11:22,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:11:22,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:11:22,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:11:22,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:11:22,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:11:22" (1/1) ... [2018-11-14 17:11:22,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d6ddf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:22, skipping insertion in model container [2018-11-14 17:11:22,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:11:22" (1/1) ... [2018-11-14 17:11:22,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:11:22,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:11:23,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:11:23,076 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:11:23,113 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:11:23,136 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:11:23,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23 WrapperNode [2018-11-14 17:11:23,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:11:23,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:11:23,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:11:23,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:11:23,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... [2018-11-14 17:11:23,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:11:23,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:11:23,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:11:23,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:11:23,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:11:23,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:11:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:11:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:11:23,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:11:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:11:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:11:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:11:23,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:11:23,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:11:24,325 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:11:24,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:11:24 BoogieIcfgContainer [2018-11-14 17:11:24,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:11:24,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:11:24,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:11:24,330 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:11:24,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:11:22" (1/3) ... [2018-11-14 17:11:24,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9a53c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:11:24, skipping insertion in model container [2018-11-14 17:11:24,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:23" (2/3) ... [2018-11-14 17:11:24,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9a53c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:11:24, skipping insertion in model container [2018-11-14 17:11:24,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:11:24" (3/3) ... [2018-11-14 17:11:24,334 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u_true-unreach-call.i [2018-11-14 17:11:24,343 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:11:24,350 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:11:24,366 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:11:24,400 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:11:24,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:11:24,401 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:11:24,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:11:24,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:11:24,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:11:24,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:11:24,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:11:24,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:11:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 17:11:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:11:24,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:24,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:24,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:24,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1945566331, now seen corresponding path program 1 times [2018-11-14 17:11:24,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:24,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:24,529 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:24,529 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:24,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:24,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:24,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:24,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 17:11:24,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-14 17:11:24,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:11:24,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-14 17:11:24,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2018-11-14 17:11:24,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {48#true} is VALID [2018-11-14 17:11:24,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 17:11:24,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:11:24,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-14 17:11:24,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:11:24,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:11:24,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:11:24,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:11:24,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {49#false} is VALID [2018-11-14 17:11:24,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:11:24,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {49#false} is VALID [2018-11-14 17:11:24,676 INFO L256 TraceCheckUtils]: 16: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {49#false} is VALID [2018-11-14 17:11:24,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-14 17:11:24,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume ~cond == 0; {49#false} is VALID [2018-11-14 17:11:24,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 17:11:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:11:24,715 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:11:24,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:24,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:11:24,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:24,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:11:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:11:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:11:24,817 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 17:11:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:25,059 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2018-11-14 17:11:25,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:11:25,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:11:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:11:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 17:11:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:11:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 17:11:25,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-14 17:11:25,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:25,845 INFO L225 Difference]: With dead ends: 84 [2018-11-14 17:11:25,846 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:11:25,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:11:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:11:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:11:26,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:26,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:11:26,081 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:11:26,082 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:11:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:26,089 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 17:11:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:11:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:26,093 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:11:26,093 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:11:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:26,098 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 17:11:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:11:26,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:26,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:26,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:26,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:11:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-14 17:11:26,106 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2018-11-14 17:11:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:26,106 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-14 17:11:26,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:11:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:11:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:11:26,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:26,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:26,108 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:26,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:26,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1304843137, now seen corresponding path program 1 times [2018-11-14 17:11:26,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:26,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:26,118 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:26,119 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:26,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:26,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:26,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-14 17:11:26,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-14 17:11:26,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-14 17:11:26,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #147#return; {354#true} is VALID [2018-11-14 17:11:26,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret4 := main(); {354#true} is VALID [2018-11-14 17:11:26,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:26,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:26,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {355#false} is VALID [2018-11-14 17:11:26,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:11:26,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:11:26,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#false} assume !(~i~0 < ~m~0); {355#false} is VALID [2018-11-14 17:11:26,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:11:26,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:11:26,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {355#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:11:26,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:11:26,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {355#false} is VALID [2018-11-14 17:11:26,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:11:26,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {355#false} is VALID [2018-11-14 17:11:26,410 INFO L256 TraceCheckUtils]: 18: Hoare triple {355#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {355#false} is VALID [2018-11-14 17:11:26,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {355#false} ~cond := #in~cond; {355#false} is VALID [2018-11-14 17:11:26,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {355#false} assume ~cond == 0; {355#false} is VALID [2018-11-14 17:11:26,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {355#false} assume !false; {355#false} is VALID [2018-11-14 17:11:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:26,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:26,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:11:26,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:11:26,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:26,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:11:26,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:26,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:11:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:11:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:11:26,580 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-14 17:11:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:26,939 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 17:11:26,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:11:26,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:11:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:11:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 17:11:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:11:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 17:11:26,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-14 17:11:27,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:27,221 INFO L225 Difference]: With dead ends: 74 [2018-11-14 17:11:27,222 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:11:27,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 17:11:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:11:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-14 17:11:27,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:27,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-14 17:11:27,244 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-14 17:11:27,244 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-14 17:11:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:27,248 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 17:11:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 17:11:27,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:27,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:27,249 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-14 17:11:27,249 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-14 17:11:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:27,252 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 17:11:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 17:11:27,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:27,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:27,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:27,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:11:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-14 17:11:27,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-14 17:11:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:27,259 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-14 17:11:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:11:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 17:11:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:11:27,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:27,261 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:27,261 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:27,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -272598018, now seen corresponding path program 1 times [2018-11-14 17:11:27,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:27,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:27,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:27,271 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:27,271 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:27,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:27,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:27,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:27,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 17:11:27,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 17:11:27,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 17:11:27,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #147#return; {676#true} is VALID [2018-11-14 17:11:27,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret4 := main(); {676#true} is VALID [2018-11-14 17:11:27,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {696#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:27,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= 1500 main_~n~0)} assume true; {696#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:27,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:27,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:27,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {677#false} is VALID [2018-11-14 17:11:27,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#false} ~i~0 := ~i~0 + 1; {677#false} is VALID [2018-11-14 17:11:27,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:11:27,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#false} assume !(~i~0 < ~m~0); {677#false} is VALID [2018-11-14 17:11:27,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:11:27,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:11:27,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {677#false} assume !(~i~0 < ~m~0); {677#false} is VALID [2018-11-14 17:11:27,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:11:27,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:11:27,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {677#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:11:27,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:11:27,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {677#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {677#false} is VALID [2018-11-14 17:11:27,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:11:27,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {677#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {677#false} is VALID [2018-11-14 17:11:27,466 INFO L256 TraceCheckUtils]: 23: Hoare triple {677#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {677#false} is VALID [2018-11-14 17:11:27,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#false} ~cond := #in~cond; {677#false} is VALID [2018-11-14 17:11:27,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#false} assume ~cond == 0; {677#false} is VALID [2018-11-14 17:11:27,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 17:11:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:27,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:27,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:11:27,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 17:11:27,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:27,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:27,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:27,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:27,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:27,536 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 4 states. [2018-11-14 17:11:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:27,847 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-14 17:11:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:27,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 17:11:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 17:11:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 17:11:27,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2018-11-14 17:11:28,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:28,034 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:11:28,034 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:11:28,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:11:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-14 17:11:28,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:28,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-14 17:11:28,087 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-14 17:11:28,087 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-14 17:11:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:28,092 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 17:11:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 17:11:28,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:28,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:28,093 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-14 17:11:28,093 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-14 17:11:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:28,098 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 17:11:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 17:11:28,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:28,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:28,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:28,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:11:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-14 17:11:28,102 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 27 [2018-11-14 17:11:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-14 17:11:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 17:11:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:11:28,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:28,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:28,104 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:28,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1346161551, now seen corresponding path program 1 times [2018-11-14 17:11:28,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:28,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:28,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:28,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:28,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:28,113 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:28,113 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:28,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:28,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:28,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:28,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-14 17:11:28,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1089#true} is VALID [2018-11-14 17:11:28,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-14 17:11:28,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #147#return; {1089#true} is VALID [2018-11-14 17:11:28,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret4 := main(); {1089#true} is VALID [2018-11-14 17:11:28,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {1089#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:28,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {1109#(<= 1800 main_~p~0)} assume true; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:28,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:28,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(<= 1800 main_~p~0)} assume true; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:28,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {1109#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:28,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:28,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {1090#false} is VALID [2018-11-14 17:11:28,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} ~j~0 := ~j~0 + 1; {1090#false} is VALID [2018-11-14 17:11:28,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !(~j~0 < ~n~0); {1090#false} is VALID [2018-11-14 17:11:28,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} ~i~0 := ~i~0 + 1; {1090#false} is VALID [2018-11-14 17:11:28,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {1090#false} assume !(~i~0 < ~m~0); {1090#false} is VALID [2018-11-14 17:11:28,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:11:28,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} assume !(~i~0 < ~m~0); {1090#false} is VALID [2018-11-14 17:11:28,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:11:28,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {1090#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:11:28,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {1090#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1090#false} is VALID [2018-11-14 17:11:28,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:11:28,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {1090#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {1090#false} is VALID [2018-11-14 17:11:28,283 INFO L256 TraceCheckUtils]: 28: Hoare triple {1090#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1090#false} is VALID [2018-11-14 17:11:28,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-14 17:11:28,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {1090#false} assume ~cond == 0; {1090#false} is VALID [2018-11-14 17:11:28,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-14 17:11:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:28,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:11:28,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:11:28,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:28,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:28,398 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-14 17:11:28,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:28,399 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 4 states. [2018-11-14 17:11:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:28,639 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-11-14 17:11:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:28,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:11:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 17:11:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 17:11:28,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2018-11-14 17:11:28,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:28,789 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:11:28,789 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:11:28,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:11:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 17:11:28,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:28,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 17:11:28,863 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 17:11:28,863 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 17:11:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:28,867 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 17:11:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 17:11:28,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:28,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:28,868 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 17:11:28,869 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 17:11:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:28,872 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 17:11:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 17:11:28,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:28,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:28,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:11:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-14 17:11:28,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2018-11-14 17:11:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:28,877 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-14 17:11:28,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:11:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:11:28,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:28,878 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:28,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:28,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1109010455, now seen corresponding path program 1 times [2018-11-14 17:11:28,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:28,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:28,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:28,887 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:28,887 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:28,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:28,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:29,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {1526#true} call ULTIMATE.init(); {1526#true} is VALID [2018-11-14 17:11:29,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {1526#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1526#true} is VALID [2018-11-14 17:11:29,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {1526#true} assume true; {1526#true} is VALID [2018-11-14 17:11:29,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} #147#return; {1526#true} is VALID [2018-11-14 17:11:29,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {1526#true} call #t~ret4 := main(); {1526#true} is VALID [2018-11-14 17:11:29,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1526#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:29,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {1546#(<= 1800 main_~p~0)} assume true; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:29,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {1546#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:29,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= 1800 main_~p~0)} assume true; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:29,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:29,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:29,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:29,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:29,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1527#false} is VALID [2018-11-14 17:11:29,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {1527#false} ~j~0 := ~j~0 + 1; {1527#false} is VALID [2018-11-14 17:11:29,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {1527#false} assume !(~j~0 < ~n~0); {1527#false} is VALID [2018-11-14 17:11:29,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {1527#false} ~i~0 := ~i~0 + 1; {1527#false} is VALID [2018-11-14 17:11:29,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#false} assume !(~i~0 < ~m~0); {1527#false} is VALID [2018-11-14 17:11:29,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:11:29,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {1527#false} assume !(~i~0 < ~m~0); {1527#false} is VALID [2018-11-14 17:11:29,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:11:29,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {1527#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:11:29,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {1527#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1527#false} is VALID [2018-11-14 17:11:29,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:11:29,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {1527#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {1527#false} is VALID [2018-11-14 17:11:29,154 INFO L256 TraceCheckUtils]: 30: Hoare triple {1527#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1527#false} is VALID [2018-11-14 17:11:29,154 INFO L273 TraceCheckUtils]: 31: Hoare triple {1527#false} ~cond := #in~cond; {1527#false} is VALID [2018-11-14 17:11:29,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {1527#false} assume ~cond == 0; {1527#false} is VALID [2018-11-14 17:11:29,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {1527#false} assume !false; {1527#false} is VALID [2018-11-14 17:11:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:29,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:29,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:11:29,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 17:11:29,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:29,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:11:29,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:29,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:11:29,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:11:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:29,222 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 5 states. [2018-11-14 17:11:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:29,622 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-11-14 17:11:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:11:29,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 17:11:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:11:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:11:29,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2018-11-14 17:11:29,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:29,811 INFO L225 Difference]: With dead ends: 115 [2018-11-14 17:11:29,811 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:11:29,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:11:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-11-14 17:11:30,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:30,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 62 states. [2018-11-14 17:11:30,015 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 62 states. [2018-11-14 17:11:30,015 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 62 states. [2018-11-14 17:11:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:30,019 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 17:11:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 17:11:30,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:30,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:30,020 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 69 states. [2018-11-14 17:11:30,020 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 69 states. [2018-11-14 17:11:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:30,024 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 17:11:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 17:11:30,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:30,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:30,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:30,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:11:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-14 17:11:30,028 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 34 [2018-11-14 17:11:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:30,028 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-14 17:11:30,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:11:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-14 17:11:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:11:30,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:30,030 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:30,030 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:30,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1702704579, now seen corresponding path program 2 times [2018-11-14 17:11:30,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:30,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:30,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:30,039 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:30,040 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:30,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:30,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:11:30,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:11:30,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:30,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:30,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {2019#true} call ULTIMATE.init(); {2019#true} is VALID [2018-11-14 17:11:30,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {2019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2019#true} is VALID [2018-11-14 17:11:30,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {2019#true} assume true; {2019#true} is VALID [2018-11-14 17:11:30,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2019#true} {2019#true} #147#return; {2019#true} is VALID [2018-11-14 17:11:30,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {2019#true} call #t~ret4 := main(); {2019#true} is VALID [2018-11-14 17:11:30,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {2019#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {2039#(<= 1000 main_~m~0)} ~j~0 := ~j~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {2039#(<= 1000 main_~m~0)} ~i~0 := ~i~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:30,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {2039#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:30,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:30,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2020#false} is VALID [2018-11-14 17:11:30,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {2020#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 17:11:30,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:11:30,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {2020#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 17:11:30,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:11:30,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2020#false} is VALID [2018-11-14 17:11:30,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:11:30,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {2020#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {2020#false} is VALID [2018-11-14 17:11:30,256 INFO L256 TraceCheckUtils]: 32: Hoare triple {2020#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2020#false} is VALID [2018-11-14 17:11:30,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2018-11-14 17:11:30,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#false} assume ~cond == 0; {2020#false} is VALID [2018-11-14 17:11:30,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2018-11-14 17:11:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:11:30,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:30,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:11:30,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:11:30,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:30,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:30,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:30,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:30,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:30,327 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 4 states. [2018-11-14 17:11:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:30,865 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2018-11-14 17:11:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:30,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:11:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 17:11:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 17:11:30,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2018-11-14 17:11:31,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:31,273 INFO L225 Difference]: With dead ends: 131 [2018-11-14 17:11:31,273 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 17:11:31,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 17:11:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-11-14 17:11:31,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:31,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 64 states. [2018-11-14 17:11:31,419 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 64 states. [2018-11-14 17:11:31,419 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 64 states. [2018-11-14 17:11:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:31,424 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 17:11:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 17:11:31,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:31,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:31,425 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 106 states. [2018-11-14 17:11:31,425 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 106 states. [2018-11-14 17:11:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:31,430 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 17:11:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 17:11:31,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:31,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:31,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:31,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 17:11:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-14 17:11:31,433 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 36 [2018-11-14 17:11:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:31,434 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-14 17:11:31,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-14 17:11:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 17:11:31,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:31,435 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:31,436 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:31,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 487964545, now seen corresponding path program 1 times [2018-11-14 17:11:31,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:31,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:31,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:31,443 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:31,444 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:31,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:31,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:31,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {2618#true} call ULTIMATE.init(); {2618#true} is VALID [2018-11-14 17:11:31,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {2618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2618#true} is VALID [2018-11-14 17:11:31,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {2618#true} assume true; {2618#true} is VALID [2018-11-14 17:11:31,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} #147#return; {2618#true} is VALID [2018-11-14 17:11:31,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {2618#true} call #t~ret4 := main(); {2618#true} is VALID [2018-11-14 17:11:31,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {2618#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:31,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(<= 1800 main_~p~0)} assume true; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:31,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {2638#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:31,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= 1800 main_~p~0)} assume true; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:31,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:31,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:31,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:31,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:31,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:11:31,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume true; {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:11:31,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {2619#false} is VALID [2018-11-14 17:11:31,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:11:31,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#false} assume !(~i~0 < ~m~0); {2619#false} is VALID [2018-11-14 17:11:31,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {2619#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {2619#false} assume !(~k~0 < ~p~0); {2619#false} is VALID [2018-11-14 17:11:31,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:11:31,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 17:11:31,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {2619#false} assume !(~i~0 < ~m~0); {2619#false} is VALID [2018-11-14 17:11:31,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {2619#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 17:11:31,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:11:31,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {2619#false} is VALID [2018-11-14 17:11:31,912 INFO L256 TraceCheckUtils]: 46: Hoare triple {2619#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2619#false} is VALID [2018-11-14 17:11:31,912 INFO L273 TraceCheckUtils]: 47: Hoare triple {2619#false} ~cond := #in~cond; {2619#false} is VALID [2018-11-14 17:11:31,913 INFO L273 TraceCheckUtils]: 48: Hoare triple {2619#false} assume ~cond == 0; {2619#false} is VALID [2018-11-14 17:11:31,913 INFO L273 TraceCheckUtils]: 49: Hoare triple {2619#false} assume !false; {2619#false} is VALID [2018-11-14 17:11:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:11:31,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:31,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:11:31,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:11:31,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:31,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:11:32,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:32,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:11:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:11:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:11:32,034 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 6 states. [2018-11-14 17:11:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:32,511 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2018-11-14 17:11:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:11:32,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:11:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:11:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 17:11:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:11:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 17:11:32,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 132 transitions. [2018-11-14 17:11:32,647 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-14 17:11:32,649 INFO L225 Difference]: With dead ends: 132 [2018-11-14 17:11:32,650 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:11:32,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:11:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:11:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-11-14 17:11:32,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:32,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 72 states. [2018-11-14 17:11:32,843 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 72 states. [2018-11-14 17:11:32,843 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 72 states. [2018-11-14 17:11:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:32,845 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:11:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:11:32,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:32,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:32,846 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 76 states. [2018-11-14 17:11:32,846 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 76 states. [2018-11-14 17:11:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:32,848 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:11:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:11:32,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:32,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:32,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:32,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 17:11:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-11-14 17:11:32,851 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 50 [2018-11-14 17:11:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:32,852 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-14 17:11:32,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:11:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-14 17:11:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:11:32,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:32,853 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:32,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:32,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1369611969, now seen corresponding path program 2 times [2018-11-14 17:11:32,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:32,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:32,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:32,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:32,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:32,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:11:32,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:11:32,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:32,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:33,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2018-11-14 17:11:33,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {3215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3215#true} is VALID [2018-11-14 17:11:33,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {3215#true} assume true; {3215#true} is VALID [2018-11-14 17:11:33,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3215#true} {3215#true} #147#return; {3215#true} is VALID [2018-11-14 17:11:33,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {3215#true} call #t~ret4 := main(); {3215#true} is VALID [2018-11-14 17:11:33,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {3215#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:33,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {3235#(<= 1800 main_~p~0)} assume true; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:33,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {3235#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:33,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {3235#(<= 1800 main_~p~0)} assume true; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 17:11:33,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {3235#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:33,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:11:33,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:33,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:11:33,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:11:33,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume true; {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:11:33,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 17:11:33,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume true; {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 17:11:33,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {3216#false} is VALID [2018-11-14 17:11:33,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:11:33,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {3216#false} assume !(~i~0 < ~m~0); {3216#false} is VALID [2018-11-14 17:11:33,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {3216#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {3216#false} assume !(~k~0 < ~p~0); {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:11:33,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 17:11:33,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {3216#false} assume !(~i~0 < ~m~0); {3216#false} is VALID [2018-11-14 17:11:33,989 INFO L273 TraceCheckUtils]: 43: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {3216#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 17:11:33,990 INFO L273 TraceCheckUtils]: 48: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:11:33,990 INFO L273 TraceCheckUtils]: 49: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {3216#false} is VALID [2018-11-14 17:11:33,990 INFO L256 TraceCheckUtils]: 50: Hoare triple {3216#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3216#false} is VALID [2018-11-14 17:11:33,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {3216#false} ~cond := #in~cond; {3216#false} is VALID [2018-11-14 17:11:33,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {3216#false} assume ~cond == 0; {3216#false} is VALID [2018-11-14 17:11:33,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2018-11-14 17:11:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 17:11:34,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:11:34,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 17:11:34,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:34,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:11:34,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:11:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:11:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:11:34,106 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2018-11-14 17:11:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:34,792 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-14 17:11:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:11:34,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 17:11:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:11:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 17:11:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:11:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 17:11:34,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-14 17:11:34,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:34,973 INFO L225 Difference]: With dead ends: 148 [2018-11-14 17:11:34,973 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 17:11:34,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:11:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 17:11:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-14 17:11:35,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:35,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2018-11-14 17:11:35,086 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2018-11-14 17:11:35,086 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2018-11-14 17:11:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:35,089 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 17:11:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 17:11:35,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:35,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:35,090 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2018-11-14 17:11:35,091 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2018-11-14 17:11:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:35,094 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 17:11:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 17:11:35,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:35,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:35,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:35,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:11:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-11-14 17:11:35,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 54 [2018-11-14 17:11:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:35,098 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-11-14 17:11:35,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:11:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-11-14 17:11:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:11:35,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:35,099 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:35,099 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:35,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 799402753, now seen corresponding path program 3 times [2018-11-14 17:11:35,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:35,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:35,107 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:35,107 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:35,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:11:35,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:11:35,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:11:35,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:35,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:35,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {3877#true} call ULTIMATE.init(); {3877#true} is VALID [2018-11-14 17:11:35,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {3877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3877#true} is VALID [2018-11-14 17:11:35,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {3877#true} assume true; {3877#true} is VALID [2018-11-14 17:11:35,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3877#true} {3877#true} #147#return; {3877#true} is VALID [2018-11-14 17:11:35,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {3877#true} call #t~ret4 := main(); {3877#true} is VALID [2018-11-14 17:11:35,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {3877#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := ~j~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {3878#false} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {3878#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,382 INFO L273 TraceCheckUtils]: 35: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 36: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 38: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 40: Hoare triple {3878#false} assume !(~k~0 < ~p~0); {3878#false} is VALID [2018-11-14 17:11:35,383 INFO L273 TraceCheckUtils]: 41: Hoare triple {3878#false} ~j~0 := ~j~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {3878#false} assume !(~j~0 < ~n~0); {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {3878#false} ~i~0 := ~i~0 + 1; {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 46: Hoare triple {3878#false} assume !(~i~0 < ~m~0); {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 47: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,384 INFO L273 TraceCheckUtils]: 48: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L273 TraceCheckUtils]: 49: Hoare triple {3878#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L273 TraceCheckUtils]: 50: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L273 TraceCheckUtils]: 51: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L273 TraceCheckUtils]: 52: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L273 TraceCheckUtils]: 53: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {3878#false} is VALID [2018-11-14 17:11:35,385 INFO L256 TraceCheckUtils]: 54: Hoare triple {3878#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3878#false} is VALID [2018-11-14 17:11:35,386 INFO L273 TraceCheckUtils]: 55: Hoare triple {3878#false} ~cond := #in~cond; {3878#false} is VALID [2018-11-14 17:11:35,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {3878#false} assume ~cond == 0; {3878#false} is VALID [2018-11-14 17:11:35,386 INFO L273 TraceCheckUtils]: 57: Hoare triple {3878#false} assume !false; {3878#false} is VALID [2018-11-14 17:11:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-14 17:11:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 17:11:35,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 17:11:35,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:35,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:35,460 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-14 17:11:35,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:35,461 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 4 states. [2018-11-14 17:11:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:35,906 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2018-11-14 17:11:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:35,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 17:11:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 17:11:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 17:11:35,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2018-11-14 17:11:36,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:36,137 INFO L225 Difference]: With dead ends: 168 [2018-11-14 17:11:36,137 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 17:11:36,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 17:11:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 17:11:36,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:36,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 17:11:36,433 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 17:11:36,433 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 17:11:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,437 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 17:11:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 17:11:36,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,438 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 17:11:36,438 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 17:11:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,443 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 17:11:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 17:11:36,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:36,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 17:11:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-11-14 17:11:36,448 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 58 [2018-11-14 17:11:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:36,448 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-11-14 17:11:36,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-11-14 17:11:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:11:36,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:36,449 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:36,450 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:36,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash -511210103, now seen corresponding path program 4 times [2018-11-14 17:11:36,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:36,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,458 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:36,458 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:36,459 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-14 17:11:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:11:36,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:11:36,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:36,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:37,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {4663#true} call ULTIMATE.init(); {4663#true} is VALID [2018-11-14 17:11:37,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {4663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4663#true} is VALID [2018-11-14 17:11:37,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 17:11:37,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4663#true} {4663#true} #147#return; {4663#true} is VALID [2018-11-14 17:11:37,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {4663#true} call #t~ret4 := main(); {4663#true} is VALID [2018-11-14 17:11:37,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {4663#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {4683#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:37,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {4683#(<= 1500 main_~n~0)} assume true; {4683#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:37,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {4683#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~k~0 < ~p~0); {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {4690#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} ~j~0 := ~j~0 + 1; {4730#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:37,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {4730#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4730#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:37,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {4730#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:11:37,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,110 INFO L273 TraceCheckUtils]: 30: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {4664#false} assume !(~k~0 < ~p~0); {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:11:37,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 43: Hoare triple {4664#false} assume !(~i~0 < ~m~0); {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 44: Hoare triple {4664#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 45: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,113 INFO L273 TraceCheckUtils]: 49: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,113 INFO L273 TraceCheckUtils]: 52: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,113 INFO L273 TraceCheckUtils]: 53: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,114 INFO L273 TraceCheckUtils]: 54: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,114 INFO L273 TraceCheckUtils]: 55: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,114 INFO L273 TraceCheckUtils]: 56: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,115 INFO L273 TraceCheckUtils]: 58: Hoare triple {4664#false} assume !(~k~0 < ~p~0); {4664#false} is VALID [2018-11-14 17:11:37,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,115 INFO L273 TraceCheckUtils]: 61: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:11:37,115 INFO L273 TraceCheckUtils]: 62: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 64: Hoare triple {4664#false} assume !(~i~0 < ~m~0); {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 65: Hoare triple {4664#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 66: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 67: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,116 INFO L273 TraceCheckUtils]: 68: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 69: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 70: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 71: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L256 TraceCheckUtils]: 72: Hoare triple {4664#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 73: Hoare triple {4664#false} ~cond := #in~cond; {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {4664#false} assume ~cond == 0; {4664#false} is VALID [2018-11-14 17:11:37,117 INFO L273 TraceCheckUtils]: 75: Hoare triple {4664#false} assume !false; {4664#false} is VALID [2018-11-14 17:11:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-14 17:11:37,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:37,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:11:37,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-14 17:11:37,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:37,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:11:37,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:37,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:11:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:11:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:37,196 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 5 states. [2018-11-14 17:11:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:38,187 INFO L93 Difference]: Finished difference Result 287 states and 331 transitions. [2018-11-14 17:11:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:11:38,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-14 17:11:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2018-11-14 17:11:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2018-11-14 17:11:38,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 141 transitions. [2018-11-14 17:11:38,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:38,791 INFO L225 Difference]: With dead ends: 287 [2018-11-14 17:11:38,791 INFO L226 Difference]: Without dead ends: 212 [2018-11-14 17:11:38,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-14 17:11:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-11-14 17:11:39,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:39,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 158 states. [2018-11-14 17:11:39,223 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 158 states. [2018-11-14 17:11:39,224 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 158 states. [2018-11-14 17:11:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:39,233 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2018-11-14 17:11:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2018-11-14 17:11:39,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:39,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:39,234 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 212 states. [2018-11-14 17:11:39,234 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 212 states. [2018-11-14 17:11:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:39,242 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2018-11-14 17:11:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2018-11-14 17:11:39,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:39,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:39,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:39,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 17:11:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2018-11-14 17:11:39,248 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 76 [2018-11-14 17:11:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:39,249 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2018-11-14 17:11:39,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:11:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2018-11-14 17:11:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-14 17:11:39,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:39,250 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 10, 8, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:39,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:39,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1097079000, now seen corresponding path program 5 times [2018-11-14 17:11:39,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:39,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:39,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:39,258 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:39,258 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:39,258 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-14 17:11:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1